文章基本信息

标题：Sensitivity of mixing times
本地全文：下载
作者：Ding, Jian ; Peres, Yuval
期刊名称：Electronic Communications in Probability
印刷版ISSN：1083-589X
出版年度：2013
卷号：18
页码：1-6
DOI：10.1214/ECP.v18-2765
语种：English
出版社：Electronic Communications in Probability
摘要：In this note, we demonstrate an instance of bounded-degree graphs of size $n$, for which the total variation mixing time for the random walk is decreased by a factor of $\log n/ \log\log n$ if we multiply the edge-conductances by bounded factors in a certain way.
关键词：mixing time; sensitivity; geometric bounds.;60J10