Fetching the paper…
Reading the bibliography…
We establish quantitative bounds for rates of convergence and asymptotic variances for iterated conditional sequential Monte Carlo (i-cSMC) Markov chains and associated particle Gibbs samplers.
Central limit theorem for additive functionals of reversible Markov processes and applications to simple exclusions
C. Kipnis and S. Varadhan · 1986
Earlier work this paper cites.
Rates of convergence of the Hastings and Metropolis algorithms
K. L. Mengersen and R. L. Tweedie · 1996
Earlier work this paper cites.
Exact sampling with coupled Markov chains and applications to statistical mechanics
J. G. Propp and D. B. Wilson · 1996
Earlier work this paper cites.
Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms
G. O. Roberts and R. L. Tweedie · 1996
Earlier work this paper cites.
Geometric ergodicity and hybrid Markov chains
G. O. Roberts and J. S. Rosenthal · 1997
Earlier work this paper cites.
Exact sampling from a continuous state space
D. J. Murdoch and P. J. Green · 1998
Earlier work this paper cites.
Monte Carlo statistical methods
C. P. Robert and G. Casella · 1999
Earlier work this paper cites.
Markov chains and de-initializing processes
G. O. Roberts and J. S. Rosenthal · 2001
Earlier work this paper cites.
Lectures on the Coupling Method
T. Lindvall · 2002
Earlier work this paper cites.
Feynman-Kac Formulae
P. Del Moral · 2004
Earlier work this paper cites.
A mixture representation of π \pi with applications in Markov chain Monte Carlo and perfect sampling
J. P. Hobert and C. P. Robert · 2004
Cited alongside, same era.
The pseudo-marginal approach for efficient Monte Carlo computations
C. Andrieu and G. O. Roberts · 2009
Cited alongside, same era.
Particle Markov chain Monte Carlo methods
C. Andrieu, A. Doucet, and R. Holenstein · 2010
Cited alongside, same era.
On the utility of graphics cards to perform massively parallel simulation of advanced Monte Carlo methods
A. Lee, C. Yau, M. B. Giles, A. Doucet, and C. C. Holmes · 2010
Cited alongside, same era.
A nonasymptotic theorem for unnormalized Feynman–Kac particle models
F. Cérou, P. Del Moral, and A. Guyader · 2011
Cited alongside, same era.
Geometric ergodicity and the spectral gap of non-reversible Markov chains
Explicit error bounds for Markov chain Monte Carlo
D. Rudolf · 2013
Closest in time.
Stability properties of some particle filters
N. Whiteley · 2013
Closest in time.
On Feynman–Kac and particle Markov chain Monte Carlo models
P. Del Moral, R. Kohn, and F. Patras · 2014
Closest in time.
Perfect simulation using atomic regeneration with application to sequential Monte Carlo
A. Lee, A. Doucet, and K. Łatuszyński · 2014
Closest in time.
Variance bounding and geometric ergodicity of Markov chain Monte Carlo kernels for approximate Bayesian computation
A. Lee and K. Łatuszyński · 2014
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
I. Kontoyiannis and S. Meyn · 2012
Cited alongside, same era.
C. Andrieu, A. Lee, and M. Vihola · 2013
Cited alongside, same era.
A lognormal central limit theorem for particle approximations of normalizing constants
J. Bérard, P. Del-Moral, and A. Doucet · 2013
Cited alongside, same era.
N. Chopin and S. S. Singh · 2013
Cited alongside, same era.
Supplement to “Uniform ergodicity of the iterated conditional SMC and geometric ergodicity of particle Gibbs samplers”
C. Andrieu, A. Lee, and M. Vihola
Cited in the paper.
Closest in time.
Uniform ergodicity of the particle Gibbs sampler
F. Lindsten, R. Douc, and E. Moulines · 2014
Closest in time.
Convergence properties of pseudo-marginal Markov chain Monte Carlo algorithms
C. Andrieu and M. Vihola · 2015
Closest in time.
Efficient implementation of Markov chain Monte Carlo when using an unbiased likelihood estimator
A. Doucet, M. K. Pitt, G. Deligiannidis, and R. Kohn · 2015
Closest in time.
On the efficiency of pseudo-marginal random walk metropolis algorithms
C. Sherlock, A. H. Thiery, G. O. Roberts, and J. S. Rosenthal · 2015
Closest in time.