Past exam of the mathematics course of the University of Cambridge 2011 ia Paper 2 11F e Solution Created 2026-09-24 Updated 2026-10-14
Now the event is to hit before , starting at . Up to the first of those two hitting times, translate the interval by one unit; its endpoints become and the starting point becomes . The gambler's ruin hitting probability is thereforeStopping at is essential: using the original absorbing endpoint would answer a different event.
Past exam of the mathematics course of the University of Cambridge 2014 ib Paper 2 20H Solution Created 2026-09-24 Updated 2026-10-06
Write . For , . For , conditioning on the first step and using the Markov property gives . This establishes the required equations for the hitting probability.
To prove the hitting probability is the minimal nonnegative harmonic extension, let . Then andIf is any nonnegative solution of the same boundary equations, . Positivity of the transition probabilities implies by induction for every . The events increase to , so and . Therefore is the minimal nonnegative solution.
For the tournament won by two consecutive victories, a transient pair , with and third player , moves with equal probabilities to the absorbing state or the transient pair . Thus the two transient cycles arewith probability of absorption at each step. A full cycle without absorption has probability , so absorption occurs almost surely.
Starting from , the successive absorption winners are , with first-cycle probabilities . Summing the geometric repetitions givesStarting from , the order is , giving .
Because the first game is between and , the initial ordered pair of winners is , each with probability . Combining the immediate wins with the transient hitting probabilities,Their sum is one, consistent with almost-sure absorption.
Past exam of the mathematics course of the University of Cambridge 2018 iii Paper 201 4 c Solution Created 2026-10-03 Updated 2026-10-05
Put . By independence of the two Brownian motions, is a standard Brownian motion: its independent increments have the normal distribution with variance equal to elapsed time. The stopping time is the first time hits or .
To justify finiteness without presupposing the desired hitting probability, each unit-time increment of has the normal distribution . An increment of absolute value greater than forces exit from if the path was inside at its start. These independent increments give , where . Hence almost surely.
The stopped martingale lies in . The optional stopping theorem at gives , and the bounded convergence theorem gives . Writing , path continuity gives . Therefore, as in Brownian exit from an interval,
Past exam of the mathematics course of the University of Cambridge 2023 ib Paper 4 7H b Solution Created 2026-09-24 Updated 2026-09-25
Let be the probability of reaching state before state . The boundary values are and . First-step analysis at states and givesTherefore , so the requested hitting probability is
First assume . Stop the nearest-neighbour walk on reaching zero or a finite upper level . Its probability of reaching zero first solves , with boundary values one and zero. Solving this second-order recurrence givesAbsorption in the finite interval occurs almost surely: from every interior state there is a uniformly positive probability of an absorbing run within steps. As , the events of hitting zero before increase to the event of ever hitting zero, since a path reaching zero at a finite time has a finite maximum before then. ConsequentlyThis limiting argument selects the actual hitting probability, rather than just an arbitrary bounded solution of the infinite recurrence. If , the walk moves deterministically upwards from positive states and the probability is zero there; from state zero it is one. These agree with the formula interpreted separately at .
For , the event of ever reaching can be conditioned on the first step. Given , its remaining hitting probability is by the Markov property, including if . The law of total probability thus givesFor the definition uses time zero and gives , so the harmonic equation is needed only outside .
For a finite upper barrier , let be the probability of hitting zero before . It satisfies , , and . For , solving the second-order recurrence with roots and givesAs , the events increase to eventual hitting of zero: any finite path reaching zero has a finite maximal height. Since , this yields , with . In the endpoint case , a positive initial state only moves upward and the hitting probability is zero, agreeing with the positive-state formula. The finite-barrier argument selects the correct solution rather than the also-harmonic constant one.
For , condition on the first step. The Markov property makes the chance of eventual entry after reaching equal to , including when . Total probability givesThe countable sum is justified by its nonnegative terms. This first-step identity alone need not uniquely determine a hitting probability on an infinite state space; one must choose the minimal nonnegative solution or supply the appropriate boundary behavior.
For a radial function in three dimensions, the Laplacian is , while the imposed radial drift contributes . Thus the radial generator of an SDE diffusion isThe hitting probability for the inner sphere is harmonic for this diffusion generator in the shell, with value one on the inner sphere and zero on the outer sphere. At , the boundary value problem is thereforeIntegrating gives . The two boundary conditions determineBoth arguments of the logarithms are dimensionless. The result decreases from one to zero across the shell and lies strictly between zero and one for .
For a direct probability interpretation, stop at the first contact with either sphere. The stopped process is a bounded martingale by Itô's formula. The shell has positive inner radius, so its drift is bounded and its diffusion is nondegenerate; exit occurs almost surely. Optional stopping and dominated convergence therefore giveThe logarithm appears because the inward drift cancels one of the two geometric terms in the three-dimensional radial Laplacian, leaving the same radial diffusion generator as a planar Brownian motion with diffusion coefficient one.
Recurrence characterized by constant nonnegative superharmonic functions Created 2026-10-14 Updated 2026-11-05
An irreducible Markov chain is recurrent exactly when every nonnegative superharmonic function for a Markov chain is constant. In the recurrent case, absorb the chain at . The inequality and almost-sure hitting give ; exchange . In the transient case, the hitting probability of a state is one there and satisfies the superharmonic inequality, but its one-step average at is the strictly smaller return Probability. It is a nonconstant example.
Scale increments for a birth-death chain Created 2026-10-14 Updated 2026-11-05
The interior equation for a harmonic function for a Markov chain on the integers gives . Positive scale increments satisfy . For absorbing boundaries , the lower exit Probability from isThis satisfies the harmonic equation and the boundary values and therefore is the hitting probability. For parity-dependent probabilities, with ; geometric sums distinguish rightward, balanced and leftward escape.
// Target: markov-process.bigb
Take states for , with deterministic and transitions with probability , with probability , with probability , and with probability . The Markov chain is transient for , null recurrent for , and positive recurrent for . To see the Markov chain recurrence threshold, eliminate the primed-state hitting probabilities to obtain , with characteristic roots and . Boundedness forces return with probability one when the second root is at least one. When it is below one, the minimal nonnegative solution gives return probability from . In the positive recurrent case, put and . The stationary distribution is , and . It follows from balance across each level cut and sums to one; at criticality the invariant weights cannot be normalized.