Ergodicity of the zigzag process
arXiv:1712.09875 · doi:10.1214/18-AAP1453
Abstract
The zigzag process is a Piecewise Deterministic Markov Process which can be used in a MCMC framework to sample from a given target distribution. We prove the convergence of this process to its target under very weak assumptions, and establish a central limit theorem for empirical averages under stronger assumptions on the decay of the target measure. We use the classical "Meyn-Tweedie" approach. The main difficulty turns out to be the proof that the process can indeed reach all the points in the space, even if we consider the minimal switching rates.
References in corpus (18)
- Generalized event-chain Monte Carlo: Constructing rejection-free global-balance algorithms from infinitesimal steps
- The Zig-Zag Process and Super-Efficient Sampling for Bayesian Analysis of Big Data
- Rejection-free Monte-Carlo sampling for general potentials
- Irreversible Monte Carlo Algorithms for Efficient Sampling
- Optimal non-reversible linear drift for the convergence to equilibrium of a diffusion
- Variance Reduction using Nonreversible Langevin Samplers
- Non-reversible Metropolis-Hastings
- Piecewise-Deterministic Markov Chain Monte Carlo
- Irreversible Langevin samplers and variance reduction: a large deviation approach
- Invariant densities for dynamical systems with random switching
- A piecewise deterministic scaling limit of Lifted Metropolis-Hastings in the Curie-Weiss model
- Variable transformation to obtain geometric ergodicity in the random-walk Metropolis algorithm
- Limit theorems for the Zig-Zag process
- Piecewise deterministic simulated annealing
- Stochastic Bouncy Particle Sampler
- Binary Bouncy Particle Sampler
- Generalized Bouncy Particle Sampler
- Long-time behaviour of generalised Zig-Zag process
Cited by in corpus (19)
- On explicit -convergence rate estimate for piecewise deterministic Markov processes in MCMC algorithms
- Couplings for Andersen Dynamics
- PDMP characterisation of event-chain Monte Carlo algorithms for particle systems
- Sticky PDMP samplers for sparse and local inference problems
- Zig-zag sampling for discrete structures and non-reversible phylogenetic MCMC
- Mixing it up: A general framework for Markovian statistics
- Concentration Inequalities and UQ Bounds for Hypocoercive MCMC Samplers
- Complexity of zigzag sampling algorithm for strongly log-concave distributions
- Sampling algorithms in statistical physics: a guide for statistics and machine learning
- Random Splitting of Fluid Models: Ergodicity and Convergence
- Constructing sampling schemes via coupling: Markov semigroups and optimal transport
- Exponential ergodicity of a degenerate age-size piecewise deterministic process
- Quantitative control of Wasserstein distance between Brownian motion and the Goldstein--Kac telegraph process
- Zigzag path connects two Monte Carlo samplers: Hamiltonian counterpart to a piecewise deterministic Markov process
- Emergent electrostatics in planar XY spin models: the bridge connecting topological order with broken symmetry
- Piecewise deterministic sampling with splitting schemes
- Large Deviations of Irreversible Processes
- Efficient posterior sampling for high-dimensional imbalanced logistic regression
- Hypocoercivity meets lifts