A central limit theorem for adaptive and interacting Markov chains
From MaRDI portal
Publication:2448700
DOI10.3150/12-BEJ493zbMath1303.60020arXiv1107.2574OpenAlexW2060485493MaRDI QIDQ2448700
Gersende Fort, Pierre Vandekerkhove, Pierre Priouret, Eric Moulines
Publication date: 5 May 2014
Published in: Bernoulli (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.2574
Central limit and other weak theorems (60F05) Monte Carlo methods (65C05) Discrete-time Markov processes on general state spaces (60J05)
Related Items
On the convergence rates of some adaptive Markov chain Monte Carlo algorithms, Adaptive schemes for piecewise deterministic Monte Carlo algorithms, The Wang-Landau algorithm reaches the flat histogram criterion in finite time, A central limit theorem for adaptive and interacting Markov chains, Accelerated Dimension-Independent Adaptive Metropolis
Cites Work
- Unnamed Item
- Unnamed Item
- Adaptive proposal distribution for random walk Metropolis algorithm
- A simple variance inequality for \(U\)-statistics of a Markov chain with applications
- Equi-energy sampler with applications in statistical inference and statistical mechanics
- Convergence of adaptive and interacting Markov chain Monte Carlo algorithms
- Kernel estimators of asymptotic variance for adaptive Markov chain Monte Carlo
- Limit theorems for some adaptive MCMC algorithms with subgeometric kernels
- On the ergodicity of the adaptive Metropolis algorithm on unbounded domains
- Sequentially interacting Markov chain Monte Carlo methods
- On nonlinear Markov chain Monte Carlo
- On the ergodicity properties of some adaptive MCMC algorithms
- Limit theorems for weighted samples with applications to sequential Monte Carlo methods
- Interacting Markov chain Monte Carlo methods for solving nonlinear measure-valued equations
- General state space Markov chains and MCMC algorithms
- A cautionary tale on the efficiency of some adaptive Monte Carlo schemes
- A functional central limit theorem for a class of interacting Markov chain Monte Carlo methods
- A note on Metropolis-Hastings kernels for general state spaces
- Geometric ergodicity of Metropolis algorithms
- Quantitative bounds on convergence of time-inhomogeneous Markov chains
- Renewal theory and computable convergence rates for geometrically erdgodic Markov chains
- Weak convergence and empirical processes. With applications to statistics
- Rates of convergence of the Hastings and Metropolis algorithms
- A central limit theorem for adaptive and interacting Markov chains
- Polynomial ergodicity of Markov transition kernels.
- Approximation Theorems of Mathematical Statistics
- Markov Chains and Stochastic Stability
- Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
- Stochastic Approximation in Monte Carlo Computation
- Convergence of the equi-energy sampler
- Non-linear Markov Chain Monte Carlo
- Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms
- A Note on Convergence of the Equi-Energy Sampler