No cutoff in Spherically symmetric trees
暂无分享,去创建一个
[1] Allan Sly,et al. Cutoff phenomena for random walks on random regular graphs , 2008, 0812.0060.
[2] P. Diaconis,et al. Generating a random permutation with random transpositions , 1981 .
[3] J. Keilson. Markov Chain Models--Rarity And Exponentiality , 1979 .
[4] Guan-Yu Chen,et al. Comparison of Cutoffs Between Lazy Walks and Markovian Semigroups , 2013, Journal of Applied Probability.
[5] E. Nestoridi,et al. Cutoff on trees is rare , 2020, 2012.11484.
[6] James Allen Fill,et al. The Passage Time Distribution for a Birth-and-Death Chain: Strong Stationary Duality Gives a First Stochastic Proof , 2007, 0707.4042.
[7] Jian Ding,et al. Sensitivity of mixing times , 2013 .
[8] P. Diaconis,et al. SHUFFLING CARDS AND STOPPING-TIMES , 1986 .
[9] Matthew I. Roberts,et al. Mixing Time Bounds via Bottleneck Sequences , 2016, 1610.07874.
[10] P. Diaconis,et al. LOGARITHMIC SOBOLEV INEQUALITIES FOR FINITE MARKOV CHAINS , 1996 .
[11] Eyal Lubetzky,et al. Comparing mixing times on sparse random graphs , 2017, SODA.
[12] V. Climenhaga. Markov chains and mixing times , 2013 .
[13] Yuval Peres,et al. Characterization of cutoff for reversible Markov chains , 2015, SODA.
[14] Perla Sousi,et al. Mixing Times are Hitting Times of Large Sets , 2011 .
[15] Perla Sousi,et al. Total variation cutoff in a tree , 2013 .