Poincaré inequalities for Markov chains: a meeting with Cheeger, Lyapunov and Metropolis

08/10/2022
by   Christophe Andrieu, et al.
0

We develop a theory of weak Poincaré inequalities to characterize convergence rates of ergodic Markov chains. Motivated by the application of Markov chains in the context of algorithms, we develop a relevant set of tools which enable the practical study of convergence rates in the setting of Markov chain Monte Carlo methods, but also well beyond.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/24/2020

The Coupling/Minorization/Drift Approach to Markov Chain Convergence Rates

This review paper provides an introduction of Markov chains and their co...
research
02/21/2020

Central limit theorems for Markov chains based on their convergence rates in Wasserstein distance

Many tools are available to bound the convergence rate of Markov chains ...
research
11/30/2019

Mix and Match: Markov Chains Mixing Times for Matching in Rideshare

Rideshare platforms such as Uber and Lyft dynamically dispatch drivers t...
research
12/10/2021

Comparison of Markov chains via weak Poincaré inequalities with application to pseudo-marginal MCMC

We investigate the use of a certain class of functional inequalities kno...
research
06/06/2018

Rademacher complexity for Markov chains : Applications to kernel smoothing and Metropolis-Hasting

Following the seminal approach by Talagrand, the concept of Rademacher c...
research
10/04/2022

Detection and Evaluation of Clusters within Sequential Data

Motivated by theoretical advancements in dimensionality reduction techni...
research
11/13/2022

Multivariate strong invariance principles in Markov chain Monte Carlo

Strong invariance principles in Markov chain Monte Carlo are crucial to ...

Please sign up or login with your details

Forgot password? Click here to reset