Coupling from the past for the null recurrent Markov chain
DOI10.1214/23-AAP2046zbMATH Open1548.60091MaRDI QIDQ6616871
Mir-Omid Haji-Mirsadeghi, Francois Baccelli, Sayeh Khaniha
Publication date: 9 October 2024
Published in: The Annals of Applied Probability (Search for Journal in Brave)
foliationdynamical systemrecurrenceinvariant measurepoint processdiscrete timerandom graphrenewal processpotential measureperfect simulationmeasure-valued Markov chaintaboo measureeternal family treeDoeblin couplingbridge Doeblin graphcoalescing random processesdiscrete space Markov chainone ended random treeunimodular random tree
Geometric probability and stochastic geometry (60D05) Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Markov chains and stochastic stability
- The oscillating random walk
- An almost optimal algorithm for unbounded searching
- Indistinguishability of percolation clusters
- Stochastic monotonicity and realizable monotonicity
- Non-intersection of transient branching random walks
- Doeblin trees
- Processes on unimodular random networks
- Random Measures, Theory and Applications
- Markov Chains
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- Eternal Family Trees and dynamics on unimodular random graphs
- Shift-coupling of random rooted graphs and networks
- Unimodular random trees
- Stochastically monotone Markov Chains
This page was built for publication: Coupling from the past for the null recurrent Markov chain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6616871)
