Exact mixing times for random walks on trees

DOI10.1007/S00373-012-1175-XzbMath1268.60097OpenAlexW2031369582MaRDI QIDQ354448

Mohammad Hasan, M. Dambrine

Publication date: 19 July 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-012-1175-x

zbMATH Keywords

treeMarkov chainstopping rulerandom walkmixing time

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Random walks on graphs (05C81)

Related Items (4)

The access time of random walks on trees with given partition ⋮ A Hitting Time Formula for the Discrete Green's Function ⋮ The best mixing time for random walks on trees ⋮ A faster exact-counting protocol for anonymous dynamic networks

Cites Work

• Unnamed Item
• Unnamed Item
• Mixing times for uniformly ergodic Markov chains
• Collisions Among Random Walks on a Graph
• Maximum hitting time for random walks on graphs
• Occupation measures for Markov chains
• Reversal of Markov Chains and the Forget Time
• Finite Markov Chains and Algorithmic Applications
• Extremal cover times for random walks on trees
• A tight lower bound on the cover time for random walks on graphs
• Exit Frequency Matrices for Finite Markov Chains
• Centers for Random Walks on Trees

This page was built for publication: Exact mixing times for random walks on trees