Non-coupling from the past

DOI10.1007/978-3-030-60754-8_22zbMath1469.60333arXiv1907.05605OpenAlexW2961838265MaRDI QIDQ1983063

Yanyan Li

Publication date: 15 September 2021

Full work available at URL: https://arxiv.org/abs/1907.05605

zbMATH Keywords

coalescenceMarkov chaincoupling from the pastperfect simulationCFTPcoalescence number

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Cites Work

• How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
• Probability on Graphs
• Exact sampling with coupled Markov chains and applications to statistical mechanics
• Boundary Theory for Recurrent Markov Chains
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item