Elementary bounds on Poincare and log-Sobolev constants for decomposable Markov chains
arXiv:math/0503537 · doi:10.1214/105051604000000639
Abstract
We consider finite-state Markov chains that can be naturally decomposed into smaller ``projection'' and ``restriction'' chains. Possibly this decomposition will be inductive, in that the restriction chains will be smaller copies of the initial chain. We provide expressions for Poincare (resp. log-Sobolev) constants of the initial Markov chain in terms of Poincare (resp. log-Sobolev) constants of the projection and restriction chains, together with further a parameter. In the case of the Poincare constant, our bound is always at least as good as existing ones and, depending on the value of the extra parameter, may be much better. There appears to be no previously published decomposition result for the log-Sobolev constant. Our proofs are elementary and self-contained.
Published at http://dx.doi.org/10.1214/105051604000000639 in the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org)
References in corpus (1)
Cited by in corpus (22)
- Critical Gaussian multiplicative chaos: Convergence of the derivative martingale
- Poincaré and logarithmic Sobolev inequalities by decomposition of the energy landscape
- Metastable states, quasi-stationary distributions and soft measures
- Mixing time of critical Ising model on trees is polynomial in the height
- Complexity Results for MCMC derived from Quantitative Bounds
- On fine properties of mixtures with respect to concentration of measure and Sobolev type inequalities
- Convergence of sequential Markov Chain Monte Carlo methods: I. Nonlinear flow of probability measures
- Approximately counting bases of bicircular matroids
- Polymer dynamics in the depinned phase: metastability with logarithmic barriers
- Lattice Path Matroids: Negative Correlation and Fast Mixing
- Non-asymptotic Error Bounds for Sequential MCMC Methods in Multimodal Settings
- Linking and Cutting Spanning Trees
- Computing the norm of nonnegative matrices and the log-Sobolev constant of Markov chains
- Optimal Mixing of Glauber Dynamics: Entropy Factorization via High-Dimensional Expansion
- Simple Conditions for Metastability of Continuous Markov Chains
- On the limitations of single-step drift and minorization in Markov chain convergence analysis
- Discrete Bochner inequalities via the Bochner-Bakry-Emery approach for Markov chains
- Discrete Sampling using Semigradient-based Product Mixtures
- Metropolis algorithm and equienergy sampling for two mean field spin systems
- Glauber dynamics for colourings of chordal graphs and graphs of bounded treewidth
- Mixing time for the asymmetric simple exclusion process in a random environment
- Markov Chain-based Sampling for Exploring RNA Secondary Structure under the Nearest Neighbor Thermodynamic Model