Solution and Analysis of a One-Dimensional First-Passage Problem with a Nonzero Halting Probability

This paper treats a kind of a one-dimensional first-passage problem, which seeks the probability that a random walker first hits the origin at a specified time. In addition to a usual random walk which hops either rightwards or leftwards, the present paper introduces the “halt” that the walker does not hop with a nonzero probability. The solution to the problem is expressed using a Gauss hypergeometric function.Themoment generating function of the hitting time is also calculated, and a calculation technique of the moments is developed.The author derives the long-time behavior of the hitting-time distribution, which exhibits power-law behavior if the walker hops to the right and left with equal probability.


Introduction
The first-passage problem is a useful and fundamental problem in statistical physics [1].In this problem we seek the probability that a diffusion particle or a random walker first reaches a specific set of sites at a specified time.The firstpassage problem has many applications in statistical physics, such as reaction-rate theory [2], neuron dynamics [3], and economic analysis [4].
The simplest form of the first-passage problem is a random walker hopping on a one-dimensional lattice until it hits the origin.This problem is called the gambler's ruin problem in probability theory [5]-the motion of the random walker is regarded as the dynamics of a gambler's bankroll.Consider a random walker on a one-dimensional lattice hopping to the right with probability  → and left with  ← (= 1 −  → ) in a single time step.The problem seeks statistical properties of duration   , the time at which the walker from the position  first hits the origin (of course,   is a random variable.)The central quantity is the probability P(, ) that the walker at  first hits the origin after time .According to [5], the solution is obtained as )  (−)/2 →  (+)/2 ←  and  are of same parity, 0  and  are of the opposite parity, (1) by solving the equation P(,  + 1) =  → P(+1, )+ ← P( − 1, ) with initial and boundary conditions P(0, 0) = 1 and P(, 0) = P(0, ) = 0 (,  ≥ 1).The coefficient before  (−)/2 →  (+)/2 ← in (1) is the number of different paths from  hitting the origin first at time , and it is connected with the reflection principle of a random walk [6].Obviously, P(, ) = 0 holds when  < , because (  (+)/2 ) = 0.The present paper analyzes an extended form of the above one-dimensional first-passage problem; a random walker hops to the right with probability  → , to the left with  ← , and it does not hop with probability  0 = 1 −  → −  ← .Figure 1 schematically shows the problem.The only difference from the original ruin problem is that the halting probability  0 is introduced, but the results change greatly.In fact, the solution (1) of nonhalting case ( 0 = 0) is superseded by a formula involving a Gauss hypergeometric function in halting case  0 ̸ = 0.Moreover, moment analysis and asymptotic (longtime) behavior are developed.

International Journal of Statistical Mechanics
To calculate (, ), we classify the walker's paths according to the number of hopping.We count the paths consisting of  hops and  −  halts.First, the different patterns of putting  −  halts into  steps are given by ( −1 − ) in total, where " − 1" (not ) comes from the fact that a halting step never comes to the last th step.Next, if we focus on only the hopping steps (and ignore the halting steps), the paths are reduced to those of classical ruin problem; the probability that the walker from  hits the origin after  hops is given by P(, ).Thus, the total occurring probability of a path with  hops and  −  halts is Summing up all , we get In the third equality, the range of summation is changed; the terms corresponding to  >  have no contribution because 1/(( − )!) = 0.In the last equality we change the summation variable as  =  + 2.This result can be also obtained by solving directly the equation (,  + 1) =  → ( + 1, ) +  ← ( − 1, ) +  0 (, ) with conditions (0, 0) = 1 and (, 0) = (0, ) = 0 ( ≥ 1,  ≥ 1).We further proceed with calculation; we rewrite factorials using gamma functions, which is a preparatory step toward a hypergeometric function.Employing some formulas of the gamma function, one obtains See Appendix A for the calculation in detail.The probability (, ) is expressed as where (, ; ; ) is the Gauss hypergeometric function.This is an explicit form of the solution of our problem.This solution cannot be deduced from the nonhalting solution (1).The hypergeometric function in ( 5) is a genuine hypergeometric function, in the sense that it cannot be expressed using simpler functions.(It has been studied that some hypergeometric functions have tractable expressions, e.g., (1/2, 1; 3/2; − 2 ) =  −1 arctan  [7].) We comment here on the convergence of the sum in (5)at first sight, it seems to diverge when 4 →  ← / 2 0 > 1.By using the Pochhammer symbol ()  := ( + 1) ⋅ ⋅ ⋅ ( +  − 1) instead of gamma functions, If  > , (, ) = 0 holds automatically because 1/( − )! = 0. On the other hand, if  ≤ , either (( − )/2)  or (( −  + 1)/2)  becomes zero for  > ⌊( − )/2⌋.(More precisely, the former becomes zero when  and  are of same parity, and the latter becomes zero otherwise.)The sum consists of a finite number of terms in reality, so one does not need to worry about the convergence.The exact solution ( 5) is difficult to understand intuitively.We show numerical evaluation of (, ) in Figure 2. The initial position of the walker is fixed as  = 50.We separate graphs according to the parameter Δ :=  ← −  → ; Figures 2(a), 2(b), and 2(c), respectively, correspond to Δ = 0.2, 0.1, and 0. (Δ is a key parameter for the average duration, as discussed in the following section.)(, ) is a unimodal function of  for each parameter value.Power-law behavior (, ) ∝  −3/2 is suggested in large  when Δ = 0 (see Figure 2(d)), which is further discussed in Section 4.

Analysis of Moment
In order to see properties of the random variable   , moment analysis is developed in this section.
First, we calculate the moment generating function of   , defined as Calculation process is summarized in Appendix B, and the result is Remarkably,   () contains no special functions, though the infinite summation in (7) involves a genuine hypergeometric function via (, ).
Repeatedly differentiating   () and putting  = 0, we have the first and second moments of the duration   as The average and the other moments remain finite when  ← >  → , and they diverge to infinity as  ← −  → ↘ 0. The variance of   is given by We can give a plain explanation for the average ⟨  ⟩.The walker moves to the left by a length Δ =  ← − → on average in a single hop.In other words, Δ is a mean velocity of the walker toward the origin.Hence, it takes /Δ time steps on average to reach the origin.
The moment generating function (8) looks too complicated to calculate higher moments by differentiation.Alternatively, we provide another calculation method for moments of the duration   .
We start from the difference equation for (, ): Multiply  and take summation for  to get the following: The left-hand side can be expressed as The last equality uses ∑ ∞ =0 (,  + 1) = 1, which means that a random walker surely hits the origin.(This normalization breaks if  ← <  → -see the discussion of total probability of hitting the origin in Section 5 in more detail.)We have a difference equation: A particular solution is given by ⟨  ⟩ = /( ← − → ), and the characteristic equation  →  2 − ( → +  ← ) +  ← = 0 admits the two roots 1 and  ← / → .Thus, the general solution is which has two constants  and .In a limiting case  → → 0, the problem is still well-defined, and ⟨  ⟩ should be finite, so  = 0. Also, it is obvious that ⟨ 0 ⟩ = 0, so  = 0.The appropriate solution is therefore Next we calculate the second moment.Multiplying  2 and taking summation, we derive a difference equation: where we use  2 = ( + 1) 2 − 2( + 1) + 1 for the calculation on the left-hand side.We assume a particular solution in the form ⟨ 2  ⟩ =  2  2 +  1 , and determine two constants as ( The second moment is The homogeneous-solution part vanishes for the same reason as the average.In short, this "bottom-up" method calculates higher moments inductively and generally ⟨   ⟩ becomes a polynomial of degree .For instance, the third moment is calculated as

Asymptotic Behavior
We look at long-time behavior of (, ) in this section.In particular, we confirm the power-law behavior (, ) ∝  −3/2 mentioned in Section 2 when  → =  ← (see Figure 2(d) for reference).
A summation and factorial, as well as a hypergeometric function, are not suitable to study limiting behavior, so we first reexpress the probability (, ) into a tractable form (it may be also possible to estimate factorials directly by Stirling's formula).According to [5], the solution (1) of the classic ruin problem has another expression: This form is convenient in that one does not need to care about the parities of  and .In fact, the integral holds the information of parities: ( − 1)! (( + ) /2)! (( − ) /2)!  and  are of same parity, 0 otherwise.

(22)
In Appendix C, we prove this formula.Applying (21) to (3), we have the integral form of the probability (, ): Here we estimate the integral where the integral variable is changed as ] =  in the second equality.For large , consider the following: Hence, the integrand is a rapidly decreasing function of ], and we can extend the upper limit of the integration to infinity.Together with the approximation sin(]/) ≃ ]/, we can carry out the integration as International Journal of Statistical Mechanics Therefore, the asymptotic form is expressed as By the arithmetic mean-geometric mean inequality, we note that with equality holding if and only if  → =  ← (or Δ = 0 by the notation in Section 2).Thus, the long-time behavior of (, ) is completely different according to whether Δ equals zero, or not as follows.

Concluding Remarks and Discussions
In the present paper, we have solved a one-dimensional firstpassage problem where a random walker hops to the right with probability  → , left with  ← , and does not hop with  0 .We have calculated exactly the probability (, ) that the walker starting from position  has duration   = .The average and higher moments of   are calculated in two ways: by the moment generating function, and by the bottom-up calculation.The asymptotic form of (, ) is derived, and a power law (, ) ∼  −3/2 is obtained when  → =  ← .
We make a brief discussion on the continuum limit, which is an appropriate scaling limit where the step width and time interval of the walker tend to zero.Let the step width be  and time interval be , and position and time are scaled as  =  and  = .In the continuum limit we take that ,  → 0, together with are kept finite.V is the mean displacement per time unit, and  is the diffusion coefficient corresponding to a nonhalting (or formally called a simple) random walk.The probability density function is suitable in the continuum limit, rather than the probability distribution (, ).("lim" represents the continuum limit.)Carrying out calculation similar to that in [5], is obtained.The probability density  is called the inverse Gaussian distribution [8].In the continuum limit, the halting effect  0 is reflected only upon the diffusion coefficient as (1−  0 ).Comparing (, ) of a discrete problem in (5) and above (, ) of a continuum limit, we conclude that the discrete random walk is far more difficult than the continuous diffusion and that the results about the discrete random walk in this paper cannot be attained from continuous diffusion problem.
Combining ( 5), (7), and (8), we get We have not used the condition  → +  ← +  0 = 1 in the derivation of ( 5) and ( 8), so  → ,  ← , and  0 can take any value independently.Setting  → = /4 and Furthermore, setting  = − ln 2 (i.e.,  − = 2), These formulas are nontrivial, but the author cannot tell whether they are useful in practice.We stress that an infinite series of which each term involves a genuine hypergeometric function is hardly known.We comment on the total probability of hitting the origin.For the discrete problem, putting  = 0 the moment generating function   (), If  ← >  → , the walker surely comes to the origin eventually, but if  ← <  → , the walker manages to avoid hitting the origin with a nonzero probability.The equation (,  + 1) =  → ( + 1, ) +  ← ( − 1, ) +  0 (, ) describes a traffic jam, where (, ) stands for the probability distribution that the jam consists of  cars at time , and  → and  ← are involved in the rates at which cars enter and leave the jam.The scaling behavior with exponent −3/2 has been observed in the lifetime distribution of jams [9].We think that results obtained in this paper can become theoretical bases; in particular, our discrete problem is comparable to a microscopic description of traffic, where discreteness is not negligible.

B. Calculation of the Moment
Generating Function (8) We follow here the calculation of (8).Substituting (3) into (7), where a summation variable is changed as  =  −  − 2 in the last equality.Applying the negative binomial expansion with  =  0   and  =  + 2, one obtains and simplifies (B.1) into

International Journal of Statistical Mechanics
We can transform as follows using the duplication formula The moment generating function can be expressed by a Gauss hypergeometric function as It can be expressed by an elementary function as follows (see [7]):

C. Proof of (22)
We calculate the integral to prove (22).We first break up the product of circular functions into the sum:

Figure 1 :
Figure1: An illustration of the problem.The random walker hops to the right with probability  → and to the left with  ← ; hopping does not occur with probability  0 .( → +  ← +  0 = 1).The problem focuses on statistical properties of the duration   , which is the time the walker first hits the origin.