Upgrading MLSI to LSI for reversible Markov chains

DOI10.1016/J.JFA.2023.110076MaRDI QIDQ6175737zbMATH OpenOpenAlexFDO

Authors Justin Salez, Konstantin E. Tikhomirov, Pierre Youssef

Publication date 18 August 2023

Published in Journal of Functional Analysis (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2212.06028, https://basepub.dauphine.psl.eu/handle/123456789/24933

zbMATH Keywords

functional inequalitieslogarithmic Sobolev inequalitiesmixing timesmodified log-Sobolev inequalitiesreversible Markov chains

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Continuous-time Markov processes on discrete state spaces (60J27) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Abstract: For reversible Markov chains on finite state spaces, we show that the modified log-Sobolev inequality (MLSI) can be upgraded to a log-Sobolev inequality (LSI) at the surprisingly low cost of degrading the associated constant by $log(1/p)$, where $p$ is the minimum non-zero transition probability. We illustrate this by providing the first log-Sobolev estimate for Zero-Range processes on arbitrary graphs. As another application, we determine the modified log-Sobolev constant of the Lamplighter chain on all bounded-degree graphs, and use it to provide negative answers to two open questions by Montenegro and Tetali (2006) and Hermon and Peres (2018). Our proof builds upon the `regularization trick' recently introduced by the last two authors.

Recommendations

• Modified logarithmic Sobolev inequalities in discrete settings
• Modified log-sobolev inequalities, mixing and hypercontractivity
• Logarithmic Sobolev inequalities for finite Markov chains
• Modified logarithmic Sobolev inequalities for some models of random walk
• The logarithmic Sobolev constant of some finite Markov chains

Cites work

• A characterization of \(L_{2}\) mixing and hypercontractivity via hitting times and maximal inequalities
• A probabilistic approach to convex \((\phi)\)-entropy decay for Markov chains
• A version of Aldous' spectral-gap conjecture for the zero range process
• Comparison theorems for reversible Markov chains
• Concentration inequalities. A nonasymptotic theory of independence
• Convex entropy decay via the Bochner-Bakry-Emery approach
• Cutoff for the mean-field zero-range process with bounded monotone rates
• Entropy dissipation estimates for inhomogeneous zero-range processes
• Entropy dissipation estimates in a zero-range dynamics
• Generating a random permutation with random transpositions
• scientific article; zbMATH DE number 1574603 (Why is no real title available?)
• scientific article; zbMATH DE number 1405932 (Why is no real title available?)
• Interaction of Markov processes
• Log-Sobolev inequality for the multislice, with applications
• Logarithmic Sobolev inequalities for finite Markov chains
• Logarithmic Sobolev inequality for zero-range dynamics
• Logarithmic Sobolev inequality for zero-range dynamics: independence of the number of particles
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Mathematical aspects of mixing times in Markov chains.
• Mixing times for random walks on finite lamplighter groups
• Modified log-Sobolev inequalities and two-level concentration
• Modified log-Sobolev inequalities for strongly log-concave distributions
• Modified log-Sobolev inequalities, Beckner inequalities and moment estimates
• Modified logarithmic Sobolev inequalities in discrete settings
• Rates of convergence for lamplighter processes
• The concentration of measure phenomenon
• The logarithmic Sobolev constant of the lamplighter
• Uniform mixing time for random walk on lamplighter graphs

Cited in

(4)

• Regularized modified log-Sobolev inequalities and comparison of Markov chains
• Spectral gap of the symmetric inclusion process
• Entropy contractions in Markov chains: half-step, full-step and continuous-time
• Kawasaki dynamics beyond the uniqueness threshold

This page was built for publication: Upgrading MLSI to LSI for reversible Markov chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6175737)