The best mixing time for random walks on trees
From MaRDI portal
Publication:503614
DOI10.1007/s00373-016-1714-yzbMath1353.05114arXiv1410.5112OpenAlexW2301608893MaRDI QIDQ503614
Jeanmarie Youngblood, Andrew Beveridge
Publication date: 13 January 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1410.5112
Trees (05C05) Extremal problems in graph theory (05C35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Random walks on graphs (05C81)
Related Items (3)
Some further results on the maximal hitting times of trees with some given parameters ⋮ A Hitting Time Formula for the Discrete Green's Function ⋮ The hitting time of random walk on unicyclic graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Exact mixing times for random walks on trees
- Mixing times for uniformly ergodic Markov chains
- Hitting Times, Cover Cost, and the Wiener Index of a Tree
- Maximum hitting time for random walks on graphs
- Reversal of Markov Chains and the Forget Time
- On Playing Golf with Two Balls
- A tight lower bound on the cover time for random walks on graphs
- Centers for Random Walks on Trees
This page was built for publication: The best mixing time for random walks on trees