Skip to content
Sagan

Paper

Local and Global Contraction Principles for MCMC Mixing

Unreadunread

AI summary

arXiv:2606. 03033v1 Announce Type: cross Abstract: We develop a contraction-based framework for proving mixing-time bounds for Markov chain Monte Carlo algorithms.