The best mixing time for random walks on trees
From MaRDI portal
Publication:503614
DOI10.1007/s00373-016-1714-yzbMath1353.05114arXiv1410.5112MaRDI QIDQ503614
Andrew Beveridge, Jeanmarie Youngblood
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
05C05: Trees
05C35: Extremal problems in graph theory
60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
05C81: Random walks on graphs