Sensitivity of Mixing Times in Eulerian Digraphs

DOI10.1137/16M1073376zbMath1390.05219arXiv1603.05639OpenAlexW2964161458MaRDI QIDQ4609786

Lucas Boczkowski, Perla Sousi, Yuval Peres

Publication date: 26 March 2018

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

random walkmixing timeEulerian digraph

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Random walks on graphs (05C81)

Related Items (8)

On sensitivity of uniform mixing times ⋮ Rapid social connectivity ⋮ On an epidemic model on finite graphs ⋮ A characterization of \(L_{2}\) mixing and hypercontractivity via hitting times and maximal inequalities ⋮ Analysis of a non-reversible Markov chain speedup by a single edge ⋮ Stationary distribution and cover time of sparse directed configuration models ⋮ The exclusion process mixes (almost) faster than independent particles ⋮ Frogs on trees?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mixing times are hitting times of large sets
• Mixing time bounds via the spectral profile
• Card shuffling and Diophantine approximation
• On the cover time of random walks on graphs
• Random Walk: A Modern Introduction
• Mathematical Aspects of Mixing Times in Markov Chains
• Sharp Bounds on Random Walk Eigenvalues via Spectral Embedding
• Short random walks on graphs

This page was built for publication: Sensitivity of Mixing Times in Eulerian Digraphs