An Elementary Proof of the Hitting Time Theorem

DOI10.1080/00029890.2008.11920588zbMath1229.60054OpenAlexW2171360836WikidataQ58182880 ScholiaQ58182880MaRDI QIDQ3107132

Remco van der Hofstad, Michael S. Keane

Publication date: 1 January 2012

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: http://www.jstor.org/stable/27642587

zbMATH Keywords

conditional probabilityleft-continuous random walkrandom walk hitting time theorem

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40) Probability theory (educational aspects) (97K50)

Related Items (15)

Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems ⋮ Dynamical criticality in gene regulatory networks ⋮ Analysing the effect of test-and-trace strategy in an SIR epidemic model ⋮ An ephemerally self-exciting point process ⋮ Persistence of sums of correlated increments and clustering in cellular automata ⋮ The probability of unusually large components for critical percolation on random \(d\)-regular graphs ⋮ On Random Walks with Geometric Lifetimes ⋮ Direct consequences of the basic ballot theorem ⋮ The slow bond random walk and the snapping out Brownian motion ⋮ The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs ⋮ Fraud risk assessment within blockchain transactions ⋮ Runoff on rooted trees ⋮ Anatomy of a young giant component in the random graph ⋮ Critical behavior in inhomogeneous random graphs ⋮ Dynamics of the Box-Ball System with Random Initial Conditions via Pitman’s Transformation

This page was built for publication: An Elementary Proof of the Hitting Time Theorem