A characterization of \(L_{2}\) mixing and hypercontractivity via hitting times and maximal inequalities

DOI10.1007/s00440-017-0769-xzbMath1403.60067arXiv1609.07557OpenAlexW2963786720WikidataQ57987534 ScholiaQ57987534MaRDI QIDQ2413244

Jonathan Hermon, Yuval Peres

Publication date: 10 April 2018

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

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

zbMATH Keywords

relative entropyhitting timesmaximal inequalitieshypercontractivitymixing-timefinite reversible Markov chainslog-Sobolov inequalitiesrobustness of mixing times

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Continuous-time Markov processes on discrete state spaces (60J27) Random walks on graphs (05C81)

Related Items

On sensitivity of uniform mixing times, Some inequalities for reversible Markov chains and branching random walks via spectral optimization, Cutoff for the averaging process on the hypercube and complete bipartite graphs, Upgrading MLSI to LSI for reversible Markov chains, A spectral characterization for concentration of the cover time, A comparison principle for random walk on dynamical percolation, The exclusion process mixes (almost) faster than independent particles, Mixing time bounds via bottleneck sequences, A sharp log-Sobolev inequality for the multislice, Coalescing and branching simple symmetric exclusion process

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mixing times are hitting times of large sets
• Hitting times, functional inequalities, Lyapunov conditions and uniform ergodicity
• Sensitivity of mixing times
• Mixing time bounds via the spectral profile
• Modified logarithmic Sobolev inequalities in discrete settings
• On sensitivity of uniform mixing times
• The power of averaging at two consecutive time steps: proof of a mixing conjecture by Aldous and Fill
• On reverse hypercontractivity
• Logarithmic Sobolev inequalities for finite Markov chains
• On the precision of the spectral profile
• Sensitivity of Mixing Times in Eulerian Digraphs
• On Choosing and Bounding Probability Metrics
• Surprise probabilities in Markov chains
• Characterization of cutoff for reversible Markov chains
• Operator Limit Theorems