Markov chains with almost exponential hitting times

DOI10.1016/0304-4149(82)90016-3zbMath0491.60077OpenAlexW2079207922MaRDI QIDQ1167484

David J. Aldous

Publication date: 1982

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-4149(82)90016-3

zbMATH Keywords

ergodic Markov chainhitting timeexponential approximationrapidly mixing

Mathematics Subject Classification ID

Continuous-time Markov processes on discrete state spaces (60J27)

Related Items (22)

Wright-Fisher diffusions in stochastic spatial evolutionary games with death-birth updating ⋮ Weak atomic convergence of finite voter models toward Fleming-Viot processes ⋮ On the two-dimensional dynamical Ising model in the phase coexistence region ⋮ Dimension spectrum of Axiom A diffeomorphisms. I: The Bowen-Margulis measure ⋮ Slow Transitions and Starvation in Dense Random-Access Networks ⋮ Estimates of deviations of transition probabilities of inhomogeneous Markov processes ⋮ Mean field conditions for coalescing random walks ⋮ On the meeting of random walks on random DFA ⋮ A probabilistic proof of Cooper and Frieze's "First Visit Time Lemma" ⋮ The replicator equation in stochastic spatial evolutionary games ⋮ Flows of rare events for regularly perturbed semi-Markov processes ⋮ Cover times, blanket times, and majorizing measures ⋮ Tight Markov chains and random compositions ⋮ Estimates for the deviations of the transition characteristics of nonhomogeneous Markov processes ⋮ On the asymptotics of occurrence times of rare events for stochastic spin systems. ⋮ Hitting times for random walks on vertex-transitive graphs ⋮ Speed of convergence for laws of rare events and escape rates ⋮ Markovian dynamics on complex reaction networks ⋮ Precise asymptotics of some meeting times arising from the voter model on large random regular graphs ⋮ Exact results on the first hitting via conditional strong quasi-stationary times and applications to metastability ⋮ Monotone runs of uniformly distributed integer random variables: A probabilistic analysis ⋮ On the time taken by random walks on finite groups to visit every state

Cites Work

• Markov chain models - rarity and exponentiality

This page was built for publication: Markov chains with almost exponential hitting times