A hitting probability is the probability of reaching one set before another and solves a discrete harmonic boundary problem.
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.
The first-passage time to a target set is . It is also called a hitting time.
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 and
The 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 has
Here 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 and
The 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.
For a diffusion with backward generator , the mean first-passage time satisfies in the interior, with the backward forms of the process's boundary conditions.
The waiting time for a specified directed edge to be traversed differs from the waiting time to visit its terminal state. First-step equations include no continuation term when the designated transition succeeds, but still count that last step. They can also be derived by augmenting the chain with an absorbing success state.
The survival probability is . When absorption eventually occurs,
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

Ancestors (7)

  1. Markov chain
  2. Markov process
  3. Probability theory
  4. Probability and statistics
  5. Area of mathematics
  6. Mathematics
  7. Home

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.