The power of averaging at two consecutive time steps: proof of a mixing conjecture by Aldous and Fill

DOI10.1214/16-AIHP782zbMath1382.60095arXiv1508.04836WikidataQ123003991 ScholiaQ123003991MaRDI QIDQ1700404

Jonathan Hermon, Yuval Peres

Publication date: 5 March 2018

Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)

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

zbMATH Keywords

cutoffmaximal inequalitiesmixing-timeaveraged chainfinite reversible Markov chains

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items (2)

A characterization of \(L_{2}\) mixing and hypercontractivity via hitting times and maximal inequalities ⋮ Mixing and average mixing times for general Markov processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mixing times are hitting times of large sets
• Cutoff phenomena for random walks on random regular graphs
• Characterization of cutoff for reversible Markov chains
• Maximal theorems and square functions for analytic operators on L ^p -spaces
• Tight inequalities among set hitting times in Markov chains
• Comparison of Cutoffs Between Lazy Walks and Markovian Semigroups
• ON THE MAXIMAL ERGODIC THEOREM

This page was built for publication: The power of averaging at two consecutive time steps: proof of a mixing conjecture by Aldous and Fill