The Best Mixing Time for Random Walks on Trees

Andrew Beveridge, Jeanmarie Youngblood

Type: Article

Publication Date: 2016-05-21

Citations: 6

DOI: https://doi.org/10.1007/s00373-016-1714-y

View Publication

Download PDF

Locations

Graphs and Combinatorics - View
arXiv (Cornell University) - View - PDF

Similar Works

Action	Title	Year	Authors
+	The Best Mixing Time for Random Walks on Trees	2014	Andrew A. Beveridge Jeanmarie Youngblood
+	The Best Mixing Time for Random Walks on Trees	2014	Andrew Beveridge Jeanmarie Youngblood
+	Extremal Random Walks on Trees	2009	Meng Wang
+ PDF Chat	The Exact Mixing Time for Trees of Fixed Order and Diameter	2024	Andrew Beveridge Kristin Heysse Rhys O'Higgins Lola Vescovo
+	Exact Mixing Times for Random Walks on Trees	2012	Andrew Beveridge Meng Wang
+ PDF Chat	COMPARING MIXING TIMES ON SPARSE RANDOM GRAPHS	2017	Anna Ben-Hamou Eyal Lubetzky Yuval Peres
+	Comparing mixing times on sparse random graphs	2017	Anna Ben-Hamou Eyal Lubetzky Yuval Peres
+	Multiple Random Walks on Graphs: Mixing Few to Cover Many	2020	Nicolás Rivera Thomas Sauerwald John Sylvester
+	Average mixing matrix of trees	2017	Chris Godsil Krystal Guo John Sinkovic
+	Average mixing matrix of trees	2017	Chris Godsil Krystal Guo John Sinkovic
+ PDF Chat	Multiple random walks on graphs: mixing few to cover many	2023	Nicolás Rivera Thomas Sauerwald John Sylvester
+	Extreme values of the stationary distribution of random walks on directed graphs	2016	Sinan G. Aksoy Fan Chung Xing Peng
+	Comparing mixing times on sparse random graphs	2018	Anna Ben-Hamou Eyal Lubetzky Yuval Peres
+	Mixing time of random walks on graphs	2004	Min Chen Keith Briggs
+	Multiple Random Walks on Graphs: Mixing Few to Cover Many	2020	Nicolás Rivera Thomas Sauerwald John Sylvester
+ PDF Chat	Mixing Time for a Random Walk on Rooted Trees	2009	Jason Fulman
+	Extreme values of the stationary distribution of random walks on directed graphs	2016	Sinan G. Aksoy Fan Chung Xing Peng
+	Geometric Bounds on the Fastest Mixing Markov Chain	2021	Sam Olesker-Taylor Luca Zanetti
+ PDF Chat	Sensitivity of Mixing Times in Eulerian Digraphs	2018	Lucas Boczkowski Yuval Peres Perla Sousi
+	Sensitivity of mixing times in Eulerian digraphs	2016	Lucas Boczkowski Yuval Peres Perla Sousi

Works That Cite This (5)

Action	Title	Year	Authors
+ PDF Chat	A Method for Geodesic Distance on Subdivision of Trees With Arbitrary Orders and Their Applications	2020	Fei Ma Ping Wang Xudong Luo
+	Some further results on the maximal hitting times of trees with some given parameters	2022	Shuchao Li Yangyang Xu Huihui Zhang
+	The hitting time of random walk on unicyclic graphs	2019	Xiaomin Zhu Xiao‐Dong Zhang
+	A Method for Geodesic Distance on Subdivision of Trees with Arbitrary Orders and Their Applications	2019	Fei Ma Ping Wang Xudong Luo
+	Exponential Graph is Provably Efficient for Decentralized Deep Training	2021	Bicheng Ying Kun Yuan Yiming Chen Hanbin Hu Pan Pan Wotao Yin

Works Cited by This (10)

Action	Title	Year	Authors
+	Reversible Markov Chains and Random Walks on Graphs	2014	David Aldous James Allen Fill
+	Maximum hitting time for random walks on graphs	1990	Graham Brightwell Peter Winkler
+	On Playing Golf with Two Balls	2003	Ioana Dumitriu Prasad Tetali Peter Winkler
+	Efficient stopping rules for Markov chains	1995	László Lovász Peter Winkler
+ PDF Chat	Centers for Random Walks on Trees	2009	Andrew Beveridge
+	Mixing times for uniformly ergodic Markov chains	1997	David Aldous László Lovász Peter Winkler
+	Exact Mixing Times for Random Walks on Trees	2012	Andrew Beveridge Meng Wang
+ PDF Chat	Reversal of Markov Chains and the Forget Time	1998	László Lovász Peter Winkler
+ PDF Chat	Hitting Times, Cover Cost, and the Wiener Index of a Tree	2016	Agelos Georgakopoulos Stephan Wagner
+	Mixing of random walks and other diffusions on a graph	1995	László Lovász Peter Winkler