A Hitting probability describes reaching a target, possibly before a competing target. For a Markov chain and disjoint sets , let and defineIts boundary values are on and on . Outside , first-step analysis gives the discrete harmonic equation . If the finite chain hits almost surely from every state, these equations determine uniquely: stop at the boundary or use the maximum principle for the difference of two solutions.
For a symmetric nearest-neighbour random walk on absorbed at its endpoints, the Probability of hitting before zero is . It has the correct endpoint values and equals the average of its two neighbours; for example, starting at two on gives Probability .
On an infinite state space, boundary values and harmonicity need not imply uniqueness. The Hitting probability is the minimal nonnegative solution, obtained as the increasing limit of finite-horizon hitting probabilities. Taking empty gives the Probability of ever hitting , with paths that never hit contributing zero. A Hitting probability concerns an entire sample path; it differs from the Probability of occupying the target at a specified time.
Outside a target set, first-step analysis for a Markov chain gives . Moving the holding term and dividing gives the displayed average over the next distinct state. Thus inserting or removing self-loops preserves eventual hitting probabilities, provided the state is not made absorbing and the relative probabilities of its exits are unchanged. Boundary values are one on the target and zero in closed classes unable to reach it. The waiting time changes, but the sequence of distinct visited states does not.
For with and standard Brownian motion, the one-time occupation Probability is . It is maximized at , giving . The actual hitting probability is . To derive it, solve on with , , obtaining , and let . A path that reached the level and returned contributes to the latter event but not to a given one-time tail.
With three evenly matched players, the previous winner plays the previous spectator. A pair of successive distinct winners moves to or with equal probabilities, where is the remaining player. The transient states form two directed 3-cycles and each step has absorption Probability one half. Starting with a game between two specified players, their overall winning probabilities are each , while the original spectator wins with Probability .
The hitting probability of a set is one on that set and transition-harmonic elsewhere by the Markov property. Finite-horizon hitting probabilities begin at the boundary indicator and increase through the same positive transition recursion. Any nonnegative solution dominates every iterate; monotone passage to infinite time shows that it dominates the Hitting probability. This proves minimality without requiring almost-sure hitting.
A Splitting probability is the Probability that a stochastic process reaches one target before competing targets. For a diffusion it is harmonic for the Kolmogorov backward equation, with boundary values one on the selected target and zero on the others.
For a discrete-time Markov chain and a set of absorbing states, its absorption time is the hitting time . It is zero when the initial state already lies in , and infinite on a sample path that never enters . Finiteness almost surely need not imply a finite expected value. For a finite-state model, a uniform positive probability of absorption within a fixed number of steps gives a geometric series bound on the survival probabilities and proves that the mean is finite. The mean absorption time of a lazy symmetric random walk is an explicit example.
For standard Brownian motion and , is finite almost surely andThe Brownian reflection principle gives this distribution function. The Brownian scaling identity and the Strong Markov property show its probability distribution is a strictly stable distribution with index .
For with , exponential tilting of the terminal Brownian value gives times the barrier-survival Probability for Brownian drift . Thus the moment equals for every real .
The Brownian reflection principle gives for a standard normal random variable . This is the distribution function of . An independent Brownian motion observed at this hitting time has the Cauchy distribution with scale .
For a positive level , this density describes the first-passage time of . The Girsanov theorem multiplies the zero-drift density by the stopped likelihood . Its total mass is one for nonnegative drift and for negative drift; the latter has remaining mass at infinite hitting time.
For , real and standard Brownian motion, the first-passage time to a linear boundary hasHere is the standard normal distribution function. Differentiation gives , the drifted Brownian first-passage density. Its Laplace transform is for . There is mass at infinity when ; for the hitting time is finite almost surely.
When is real and nonnegative, the discounted drifted Brownian first-passage density is . Integrating yields . In a Black-Scholes model with , the identity ensures this formula covers every real interest rate.
For , , and ,where . The diffusion generator is . Its bounded eigenfunction on the positive half-line with boundary value one is , giving the formula through the discounted boundary-hitting representation. The zero-discount limit is the Hitting probability .
For standard Brownian motion, set and . The Strong Markov property and immediate positive excursions give almost surely for each fixed . However, these level-indexed processes are not indistinguishable stochastic processes. Almost surely the random level is positive and exceeds . It is first attained before time one but is not exceeded until after time one, so . The simultaneous-equality event therefore has Probability zero. The strict passage process is the right-continuous choice needed for a subordinator.
For standard Brownian motion started at zero, is finite almost surely for andThe Brownian reflection principle proves finiteness. For , the Exponential martingale for Brownian motion stopped at is bounded by . The dominated convergence theorem gives , and taking gives the transform.
When a first-passage time has an absolutely continuous distribution, its density is , where is its survival function. In a continuous-time Markov chain, this density is the total Probability flux from surviving states into the absorbing set.
The Mean first-passage time to a target is , which can be infinite. For a diffusion with backward generator , a finite sufficiently regular mean solves the Poisson equationoutside , with on the absorbing target. Reflecting parts of the boundary require the reflecting condition of the generator, rather than an absorbing value. These conditions express different physical rules and cannot be exchanged.
For Brownian diffusion with generator on , , absorption at both endpoints givesIf zero instead reflects while absorbs, the boundary conditions are , and the solution is . In particular the mean time from the reflecting endpoint is , displaying the squared-distance diffusion scale.
Dynkin's formula explains the equation: before absorption, has constant expected value. For these bounded-interval nonnegative bounded solutions, this identity first bounds by , proving integrability of ; passing to the limit then proves . Boundary equations without a finiteness or minimality condition can have extraneous solutions on unbounded domains.
For a Markov chain with transition matrix , fix a directed transition with . Its transition-completion time isIt counts the successful final step. Merely visiting by another route does not complete this event. In a finite irreducible chain its mean is finite and first-step analysis givesThe subtracted continuation term removes exactly the case where the designated transition has just succeeded. An equivalent construction sends that transition to a new absorbing success state and computes its Expected hitting time.
For the two-state chain , , with , the waiting time for has means and . Starting at one, the hitting time of state one is zero, whereas the transition-completion time must first wait for and then . This example makes the difference between an edge event and a state event explicit.
For a nonnegative first-passage time , possibly infinite, the survival probability isIt describes the Probability that absorption has not yet occurred. The tail-integral identityholds as an identity of extended nonnegative quantities, even when absorption is not almost sure or the expected time is infinite. Indeed, pathwise, and Tonelli's theorem exchanges expectation and integration. For an integer-valued hitting time, the corresponding formula is .
If the finite-time distribution is absolutely continuous, its first-passage-time density is . Where , its hazard function is . Constant hazard gives and mean .
The limit of as is the Probability of never being absorbed; a positive limit forces infinite mean. Conversely, zero limit does not guarantee a finite mean. Brownian first passage to a positive level occurs almost surely, but its survival tail is proportional to , whose integral diverges.
For an initially intact link with no rebinding, survival probability obeys . A force-tilted activation barrier with force , constant and integrates to the displayed law. The rupture-force probability density is , not itself. The no-rebinding approximation requires separated partners to leave the capture region before appreciable reassociation; it is not guaranteed by the rate equation alone.
Differentiate the logarithm of the rupture-force probability density . Its interior stationary point satisfies . The physical domain is , giving the displayed mode. This differs from the median rupture force under a linear ramp; replacing one by the other shifts a fitted intercept and can bias the inferred zero-force rate.
Solving for survival under a linear force ramp gives the displayed expression. At large , its slope against approaches ; at low loading rate the median is approximately . A full fit can infer activation distance and zero-force escape rate . An absolute barrier additionally needs an attempt prefactor, and equilibrium binding strength additionally needs reverse-state information.
Suppose an urn starts with green balls and red balls. Drawing green removes one green ball, while drawing red adds one green and one red ball. The difference remains two, and is harmonic for the green-ball chain. Stopping on hitting or and then letting tend to infinity gives termination Probability
Articles by others on the same topic
There are currently no matching articles.