A note on the polynomial ergodicity of the one-dimensional Zig-Zag process
From MaRDI portal
Publication:5868538
DOI10.1017/jpr.2021.97OpenAlexW3177293356MaRDI QIDQ5868538
Giorgos Vasdekis, Gareth O. Roberts
Publication date: 21 September 2022
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.11357
Central limit and other weak theorems (60F05) Continuous-time Markov processes on general state spaces (60J25) Monte Carlo methods (65C05)
Related Items
Speed up Zig-Zag, Polynomial convergence rates of piecewise deterministic Markov processes, Automatic zig-zag sampling in practice
Cites Work
- Unnamed Item
- The Zig-Zag Process and Super-Efficient Sampling for Bayesian Analysis of Big Data
- Subgeometric ergodicity of strong Markov processes
- Irreversible Monte Carlo algorithms for efficient sampling
- Glauber dynamics for the mean-field Ising model: cut-off, critical power law, and metastability
- Subgeometric rates of convergence of \(f\)-ergodic strong Markov processes
- Necessary conditions for geometric and polynomial ergodicity of random-walk-type Markov chains
- Piecewise deterministic Markov processes for continuous-time Monte Carlo
- Analysis of a nonreversible Markov chain sampler.
- A piecewise deterministic scaling limit of lifted Metropolis-Hastings in the Curie-Weiss model
- Subgeometric hypocoercivity for piecewise-deterministic Markov process Monte Carlo methods
- Large deviations for the empirical measure of the zig-zag process
- Spectral analysis of the zigzag process
- Hypocoercivity of piecewise deterministic Markov process-Monte Carlo
- Ergodicity of the zigzag process
- Rate of convergence for ergodic continuous Markov processes: Lyapunov versus Poincaré
- Stability of Markovian processes II: continuous-time processes and sampled chains
- Limit theorems for the zig-zag process