The backward generator of the drift--diffusion is . The survival probability satisfies the Kolmogorov backward equationwithThe target is absorbing, while reflection gives the Neumann boundary condition at .
The mean first-passage time obeys the backward equationFor , direct integration givesIn particular,This increases monotonically with drift away from the target, so the constrained optimum isExpanding the exponential at zero drift yields
The telegraph process has backward survival equationsInitially . Only a left-moving trajectory reaches the target, while reflection reverses a right-moving velocity at the outer wall, so the hyperbolic boundary conditions are
The backward equations for the two mean hitting times arewith and . Their difference obeysand the reflecting condition fixes . Integration then givesand
At the reflecting endpoint the two values coincide:Under the diffusion limit of the telegraph process with ,Rapid velocity reversals erase directional persistence. Their integrated velocity converges to Brownian motion with diffusivity , so its first-passage statistic converges to the zero-drift result.
Choose with and small relative to and the distance to the target. For each of many independent trajectories:
1. Set , , and .
2. Propose .
3. If , record the linearly interpolated target-crossing time and stop. If , reflect to and set .
4. Otherwise reverse with probability , set and , and repeat.
2. Propose .
3. If , record the linearly interpolated target-crossing time and stop. If , reflect to and set .
4. Otherwise reverse with probability , set and , and repeat.
The sample mean of the recorded times estimates . Sampling a Poisson number of reversals and their ordered times inside each step removes the at-most-one-reversal approximation, but the stated Bernoulli scheme converges as .
Articles by others on the same topic
There are currently no matching articles.