Fetching the paper…
Reading the bibliography…
Markov chain Monte Carlo (MCMC) methods generate samples that are asymptotically distributed from a target distribution of interest as the number of iterations goes to infinity.
On maximal and distributional coupling
H. Thorisson · 1986
Earlier work this paper cites.
Markov chain Monte Carlo maximum likelihood
C. Geyer · 1991
Earlier work this paper cites.
Inference from iterative simulation using multiple sequences
A. Gelman and D. B. Rubin · 1992
Earlier work this paper cites.
Bayesian learning via stochastic dynamics
R. M. Neal · 1993
Earlier work this paper cites.
Studying convergence of Markov chain Monte Carlo algorithms using coupled sample paths
V. E. Johnson · 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.
Analysis of the Gibbs sampler for a model related to James–Stein estimators
J. S. Rosenthal · 1996
Earlier work this paper cites.
Assessing convergence of Markov chain Monte Carlo algorithms
S. P. Brooks and G. O. Roberts · 1998
Earlier work this paper cites.
A simulation approach to convergence rates for Markov chain Monte Carlo algorithms
M. K. Cowles and J. S. Rosenthal · 1998
Earlier work this paper cites.
General methods for monitoring convergence of iterative simulations
A. Gelman and S. P. Brooks · 1998
Earlier work this paper cites.
Evaluating the accuracy of sampling-based approaches to the calculation of pos- terior moments
J. Geweke · 1998
Earlier work this paper cites.
A coupling-regeneration scheme for diagnosing convergence in Markov chain Monte Carlo algorithms
V. E. Johnson · 1998
Earlier work this paper cites.
Coupling, stationarity, and regeneration
H. Thorisson · 2000
Earlier work this paper cites.
Optimal scaling for various Metropolis–Hastings algorithms
G. O. Roberts and J. S. Rosenthal · 2001
Earlier work this paper cites.
Perfect sampling from independent Metropolis–Hastings chains
J. N. Corcoran and R. L. Tweedie · 2002
Earlier work this paper cites.
Feynman-Kac Formulae
P. Del Moral · 2004
Earlier work this paper cites.
General state space Markov chains and MCMC algorithms
G. O. Roberts and J. S. Rosenthal · 2004
Earlier work this paper cites.
Sequential Monte Carlo samplers
P. Del Moral, A. Doucet, and A. Jasra · 2006
Earlier work this paper cites.
Conditions for rapid mixing of parallel and simulated tempering on multimodal distributions
D. B. Woodard, S. C. Schmidler, and M. Huber · 2009
Earlier work this paper cites.
Particle Markov chain Monte Carlo methods
C. Andrieu, A. Doucet, and R. Holenstein · 2010
Earlier work this paper cites.
On the empirical estimation of integral probability metrics
B. K. Sriperumbudur, K. Fukumizu, A. Gretton, B. Schölkopf, and G. R. Lanckriet · 2012
Earlier work this paper cites.
Sequential Monte Carlo samplers: error bounds and insensitivity to initial conditions
N. Whiteley · 2012
Cited alongside, same era.
UCI machine learning repository, 2013
M. Lichman · 2013
Cited alongside, same era.
Exact thresholds for Ising–Gibbs samplers on general graphs
E. Mossel and A. Sly · 2013
Cited alongside, same era.
Bayesian inference for logistic models using Polya-Gamma latent variables
N. G. Polson, J. G. Scott, and J. Windle · 2013
Cited alongside, same era.
R: A Language and Environment for Statistical Computing
R Core Team · 2013
Cited alongside, same era.
Monte Carlo Statistical Methods
C. P. Robert and G. Casella · 2013
Cited alongside, same era.
ggridges: Ridgeline plots in ‘ggplot2’
C. O. Wilke · 2017
Later among the works it cites.
Uniform ergodicity of the iterated conditional SMC and geometric ergodicity of particle Gibbs samplers
C. Andrieu, A. Lee, and M. Vihola · 2018
Later among the works it cites.
Coupling and convergence for Hamiltonian Monte Carlo
N. Bou-Rabee, A. Eberle, and R. Zimmer · 2018
Later among the works it cites.
The sample size required in importance sampling
S. Chatterjee and P. Diaconis · 2018
Later among the works it cites.
On the coupling time of the heat-bath process for the Fortuin–Kasteleyn random–cluster model
A. Collevecchio, E. M. Elçi, T. M. Garoni, and M. Weigel · 2018
Later among the works it cites.
Log-concave sampling: Metropolis–Hastings algorithms are fast!
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A lognormal central limit theorem for particle approximations of normalizing constants
J. Bérard, P. Del Moral, and A. Doucet · 2014
Cited alongside, same era.
Exact estimation for Markov chain equilibrium expectations
P. W. Glynn and C.-H. Rhee · 2014
Cited alongside, same era.
On particle Gibbs sampling
N. Chopin and S. S. Singh · 2015
Cited alongside, same era.
Measuring sample quality with Stein’s method
J. Gorham and L. Mackey · 2015
Cited alongside, same era.
A kernel test of goodness of fit
K. Chwialkowski, H. Strathmann, and A. Gretton · 2016
Cited alongside, same era.
Subgeometric rates of convergence in Wasserstein distance for Markov chains
A. Durmus, G. Fort, and É. Moulines · 2016
Cited alongside, same era.
R. Dwivedi, Y. Chen, M. J. Wainwright, and B. Yu · 2018
Later among the works it cites.
Measuring Sample Quality with Diffusions
J. Gorham, A. Duncan, S. Vollmer, and L. Mackey · 2018
Later among the works it cites.
Smoothing with couplings of conditional particle filters
P. E. Jacob, F. Lindsten, and T. B. Schön · 2018
Later among the works it cites.
Scalable MCMC for Bayes shrinkage priors
J. E. Johndrow, P. Orenstein, and A. Bhattacharya · 2018
Later among the works it cites.
Variance estimation in the particle filter
A. Lee and N. Whiteley · 2018
Later among the works it cites.
Unbiased Markov chain Monte Carlo for intractable target distributions
L. Middleton, G. Deligiannidis, A. Doucet, and P. E. Jacob · 2018
Later among the works it cites.
Perturbation theory for Markov chains via Wasserstein distance
D. Rudolf and N. Schweizer · 2018
Later among the works it cites.
User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient
A. S. Dalalyan and A. Karagulyan · 2019
Closest in time.
Unbiased Hamiltonian Monte Carlo with couplings
J. Heng and P. E. Jacob · 2019
Closest in time.
Sequential Monte Carlo as approximate sampling: bounds, adaptive resampling via ∞ \infty -ESS, and an application to particle Gibbs
J. H. Huggins and D. M. Roy · 2019
Closest in time.
Unbiased smoothing using particle independent Metropolis-Hastings
L. Middleton, G. Deligiannidis, A. Doucet, and P. E. Jacob · 2019
Closest in time.
Monte Carlo theory, methods and examples
A. B. Owen · 2019
Closest in time.
Computational Optimal Transport
G. Peyré and M. Cuturi · 2019
Closest in time.
Non-reversible parallel tempering: an embarassingly parallel MCMC scheme
S. Syed, A. Bouchard-Côté, G. Deligiannidis, and A. Doucet · 2019
Closest in time.
Multivariate output analysis for Markov chain Monte Carlo
D. Vats, J. M. Flegal, and G. L. Jones · 2019
Closest in time.
Informed proposals for local MCMC in discrete spaces
G. Zanella · 2019
Closest in time.