The Best Mixing Time for Random Walks on Trees |
| |
Authors: | Andrew Beveridge Jeanmarie Youngblood |
| |
Institution: | 1.Department of Mathematics, Statistics and Computer Science,Macalester College,Saint Paul,USA;2.Department of Mathematics,University of Minnesota,Minneapolis,USA |
| |
Abstract: | We characterize the extremal structures for mixing walks on trees that start from the most advantageous vertex. Let \(G=(V,E)\) be a tree with stationary distribution \(\pi \). For a vertex \(v \in V\), let \(H(v,\pi )\) denote the expected length of an optimal stopping rule from v to \(\pi \). The best mixing time for G is \(\min _{v \in V} H(v,\pi )\). We show that among all trees with \(|V|=n\), the best mixing time is minimized uniquely by the star. For even n, the best mixing time is maximized by the uniquely path. Surprising, for odd n, the best mixing time is maximized uniquely by a path of length \(n-1\) with a single leaf adjacent to one central vertex. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|