Coalescence and meeting times on \(n\)-block Markov chains
Publication:300286
DOI10.1007/S10959-014-0579-3zbMath1347.60101arXiv1410.0099OpenAlexW2031414464MaRDI QIDQ300286
Publication date: 27 June 2016
Published in: Journal of Theoretical Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.0099
Sums of independent random variables; random walks (60G50) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Dynamical systems and their relations with probability theory and stochastic processes (37A50) Limit theorems in probability theory (60F99) Dynamical aspects of statistical mechanics (37A60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mean field conditions for coalescing random walks
- Waiting times: Positive and negative results on the Wyner-Ziv problem
- Coalescing random walks and voter model consensus times on the torus in \({\mathbb{Z}}^ d\)
- Sharp error terms and necessary conditions for exponential hitting times in mixing processes.
- Coalescing random walks and voting on graphs
- Multiple Random Walks in Random Regular Graphs
- Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
- On the Stochastic and Topological Structure of Markov Chains
- A recurrence theorem for dependent processes with applications to data compression
- Entropy and data compression schemes
- Thermodynamic Formalism
- Almost-sure waiting time results for weak and very weak Bernoulli processes
- On the coalescence time of reversible random walks
- Hidden Markov processes in the context of symbolic dynamics
- Equilibrium states and the ergodic theory of Anosov diffeomorphisms
This page was built for publication: Coalescence and meeting times on \(n\)-block Markov chains
