On the coalescence time of reversible random walks

DOI10.1090/S0002-9947-2011-05523-6zbMath1247.60114arXiv1009.0664OpenAlexW1993614623MaRDI QIDQ5389420

Roberto Imbuzeiro Oliveira

Publication date: 26 April 2012

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

voter modelhitting timecoalescing random walk

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Continuous-time Markov processes on discrete state spaces (60J27)

Related Items (24)

Coalescence and meeting times on \(n\)-block Markov chains ⋮ Broadcasting on paths and cycles ⋮ Wright-Fisher diffusions in stochastic spatial evolutionary games with death-birth updating ⋮ Weak atomic convergence of finite voter models toward Fleming-Viot processes ⋮ Coalescing Walks on Rotor-Router Systems ⋮ Quasi-Stationary Distributions for the Voter Model on Complete Bipartite Graphs ⋮ Some inequalities for reversible Markov chains and branching random walks via spectral optimization ⋮ On broadcasting time in the model of travelling agents ⋮ Interacting particle systems as stochastic social dynamics ⋮ Mean field conditions for coalescing random walks ⋮ Metastable Markov chains ⋮ Reversible random walks on dynamic graphs ⋮ Voter models on subcritical scale‐free random graphs ⋮ On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting? ⋮ On the meeting of random walks on random DFA ⋮ Game-based coalescence in multi-agent systems ⋮ Latent voter model on locally tree-like random graphs ⋮ Mixing Times and Moving Targets ⋮ From coalescing random walks on a torus to Kingman's coalescent ⋮ Discordant Voting Processes on Finite Graphs ⋮ Discordant voting protocols for cyclically linked agents ⋮ Dynamical noise sensitivity for the voter model ⋮ Mean field behavior during the big bang regime for coalescing random walks ⋮ Mixing times for a constrained Ising process on the two-dimensional torus at low density

Cites Work

• Unnamed Item
• Unnamed Item
• Meeting times for independent Markov chains
• Coalescing random walks and voter model consensus times on the torus in \({\mathbb{Z}}^ d\)
• The Complexity of the Local Hamiltonian Problem

This page was built for publication: On the coalescence time of reversible random walks