2000 character limit reached
On sensitivity of uniform mixing times (1607.01672v3)
Published 6 Jul 2016 in math.PR
Abstract: We show that the order of the $L_{\infty}$-mixing time of simple random walks on a sequence of uniformly bounded degree graphs of size $n$ may increase by an optimal factor of $\Theta( \log \log n)$ as a result of a bounded perturbation of the edge weights. This answers a question and a conjecture of Kozma.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.