An Elementary Proof of the Hitting Time Theorem

DOI10.1080/00029890.2008.11920588MaRDI QIDQ3107132zbMATH OpenOpenAlexWikidataFDO

Authors Remco van der Hofstad, Michael 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)

Recommendations

• The Hitting Time Theorem Revisited
• Poincaré inequalities and hitting times
• An elementary proof of de Finetti's theorem
• Hitting Time Theorems for Random Matrices
• An Elementary Proof that the First Hitting Time of an Open Set by a Jump Process is a Stopping Time
• Asymptotics for hitting times
• On partial sums of hitting times
• Hitting time distribution for skip-free Markov chains: a simple proof
• Hitting times and spectral gap inequalities

Cited in

(19)

• Dynamical criticality in gene regulatory networks
• Analysing the effect of test-and-trace strategy in an SIR epidemic model
• The slow bond random walk and the snapping out Brownian motion
• Persistence of sums of correlated increments and clustering in cellular automata
• Critical behavior in inhomogeneous random graphs
• Anatomy of a Young giant component in the random graph
• An ephemerally self-exciting point process
• Fraud risk assessment within blockchain transactions
• Runoff on rooted trees
• Dynamics of the Box-Ball System with Random Initial Conditions via Pitman’s Transformation
• Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems
• 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
• Asymptotic behaviour of the noisy voter model density process
• The multiplicative coalescent, inhomogeneous continuum random trees, and new universality classes for critical random graphs
• A spatial host-parasite model with host immunity: survival and linear spread of parasites on \(\mathbb{Z} \)
• Left-continuous random walk on \({\mathbb{Z}}\) and the parity of its hitting times
• Improved mixing of critical hardcore model

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3107132)