Sensitivity of mixing times

DOI10.1214/ECP.v18-2765zbMath1307.60051arXiv1304.0244MaRDI QIDQ743063

Jian Ding, Yuval Peres

Publication date: 22 September 2014

Published in: Electronic Communications in Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.0244

zbMATH Keywords

sensitivityrandom walkmixing timebounded-degree graph

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Random walks on graphs (05C81)

Related Items (12)

No cutoff in spherically symmetric trees ⋮ On sensitivity of uniform mixing times ⋮ Some inequalities for reversible Markov chains and branching random walks via spectral optimization ⋮ A characterization of \(L_{2}\) mixing and hypercontractivity via hitting times and maximal inequalities ⋮ Smoothed Analysis on Connected Graphs ⋮ Large scale stochastic dynamics. Abstracts from the workshop held September 11--17, 2022 ⋮ Speeding up Markov chains with deterministic jumps ⋮ A comparison principle for random walk on dynamical percolation ⋮ Mixing times are hitting times of large sets ⋮ On sensitivity of mixing times and cutoff ⋮ Mixing time bounds via bottleneck sequences ⋮ Correction to: ``Speeding up Markov chains with deterministic jumps

This page was built for publication: Sensitivity of mixing times