no. 16 · Tuesday 17 November 2026
Decomposition Bounds for MCMC with Mixture Targets: Multimodality and Heavy-Tailedness
Abstract
We establish quantitative mixing-time bounds for Markov chain Monte Carlo algorithms targeting multimodal and heavy-tailed mixtures. The dynamics of a Markov chain are decomposed into local and global levels, and possibly weak Poincaré inequalities at both levels are combined to form convergence bounds. We apply this framework to location and scale mixtures of strongly log-concave distributions, obtaining explicit convergence bounds for random-walk Metropolis, proximal, and random-scan Gibbs samplers. For location mixtures connected along a finite path, the bounds depend polynomially on the number of components and exponentially on neighboring separation, remaining informative as the overall diameter grows. For scale mixtures, we relate the global dynamics of the chain to the isoperimetry of the log-scale mixing distribution, and illustrate the effect of heavy-tailed targets by examining inverse-gamma mixing distributions.
- fields
- Statistics Theory