Doeblin trees

DOI10.1214/19-EJP375zbMath1429.05186arXiv1811.10058MaRDI QIDQ2279314

Mir-Omid Haji-Mirsadeghi, James T. III Murphy, François Baccelli

Publication date: 12 December 2019

Published in: Electronic Journal of Probability (Search for Journal in Brave)

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

zbMATH Keywords

Markov chaincoupling from the pastbridge graphunimodular networkbi-recurrent pathDoeblin grapheternal family tree

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Stationary stochastic processes (60G10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items (1)

Coupling from the past for the null recurrent Markov chain

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterization results and Markov chain Monte Carlo algorithms including exact simulation for some spatial point processes
• Two ergodicity criteria for stochastically recursive sequences
• Pointwise theorems for amenable groups.
• Geometric ergodicity and perfect simulation
• Stochastically recursive sequences and their generalizations
• Probability theory. Edited by K. A. Borovkov. Transl. from the Russian by O. Borovkova and P. S. Ruzankin
• Perfect simulation for a class of positive recurrent Markov chains
• Processes on unimodular random networks
• Markov Chains and Stochastic Stability
• How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
• Perfect Simulation of Conditionally Specified Models
• Exact Sampling from a Continuous State Space
• Perfect simulation and backward coupling^∗
• Perfect simulation using dominating processes on ordered spaces, with application to locally stable point processes
• Exact sampling with coupled Markov chains and applications to statistical mechanics
• How to couple from the past using a read-once source of randomness
• On Exact Simulation of Markov Random Fields Using Coupling from the Past
• Renewal processes, population dynamics, and unimodular trees
• Eternal Family Trees and dynamics on unimodular random graphs
• Shift-coupling of random rooted graphs and networks

This page was built for publication: Doeblin trees