Fetching the paper…
Reading the bibliography…
Perturbation theory for Markov chains addresses the question how small differences in the transitions of Markov chains are reflected in differences between their distributions.
[author] Dobrushin, R.R. (1956). Central limit theorem for non-stationary Markov chains. I. Teor. Veroyatnost. i Primenen. 1 72–89
1956
Earlier work this paper cites.
[author] Dobrushin, R.R. (1956). Central limit theorem for nonstationary Markov chains. II. Teor. Veroyatnost. i Primenen. 1 365–425
1956
Earlier work this paper cites.
[author] Kartashov, N.N. (1986). Inequalities in theorems of ergodicity and stability for Markov chains with a common phase space, Parts I and II. Theory Probab. Appl. 30 247–259
1986
Earlier work this paper cites.
[author] Dobrushin, R.R. (1996). Lectures on Probability Theory and Statistics: Ecole d’Eté de Probabilités de Saint-Flour XXIV—1994 Perturbation methods of the theory of Gibbsian fields, 1–66. Springer Berlin Heidelberg, Berlin, Heidelberg
1994
Earlier work this paper cites.
[author] Mengersen, K.K. and Tweedie, R.R. (1996). Rates of convergence of the Hastings and Metropolis algorithms. Ann. Statist. 24 101–121
1996
Earlier work this paper cites.
[author] Roberts, G.G. and Tweedie, R.R. (1996). Exponential convergence of Langevin distributions and their discrete approximation. Bernoulli 2 341–363
1996
Earlier work this paper cites.
[author] Roberts, G.G. and Rosenthal, J.J. (1997). Geometric ergodicity and hybrid Markov chains. Electron. Comm. Probab. 2 no. 2, 13–25
1997
Earlier work this paper cites.
[author] Roberts, G.G., Rosenthal, J.J. and Schwartz, P.P. (1998). Convergence properties of perturbed Markov chains. J. Appl. Probab. 35 1–11
1998
Earlier work this paper cites.
[author] Tierney, L.L. (1998). A note on the Metropolis-Hastings kernels for general state spaces. Ann. Appl. Probab. 8 1–9
1998
Earlier work this paper cites.
[author] Keller, G.G. and Liverani, C.C. (1999). Stability of the spectrum for transfer operators. Ann. Scuola Norm. Sup. Pisa Classe Sci. 28 141–152
1999
Earlier work this paper cites.
[author] Shardlow, T.T. and Stuart, A.A. (2000). A perturbation theory for ergodic Markov chains and application to numerical approximations. SIAM J. Numer. Analysis 37 1120–1137
2000
Earlier work this paper cites.
[author] Breyer, L.L., Roberts, G.G. and Rosenthal, J.J. (2001). A note on geometric ergodicity and floating-point roundoff error. Statist. Probab. Lett. 53 123–127
2001
Earlier work this paper cites.
[author] Mitrophanov, A.A. (2003). Stability and exponential convergence of continuous-time Markov chains. J. Appl. Probab. 40 970–979
2003
Earlier work this paper cites.
[author] Villani, C.C. (2003). Topics in Optimal Transportation. American Mathematical Society
2003
Earlier work this paper cites.
[author] Gibbs, A.A. (2004). Convergence in the Wasserstein metric for Markov chain Monte Carlo algorithms with applications to image restoration. Stoch. Models 20 473–492
2004
Earlier work this paper cites.
[author] Mathé, P.P. (2004). Numerical integration using V-uniformly ergodic Markov chains. J. Appl. Probab. 41 1104–1112
2004
Earlier work this paper cites.
[author] Roberts, G.G. and Rosenthal, J.J. (2004). General state space Markov chains and MCMC algorithms. Probability Surveys 1 20–71
2004
Cited alongside, same era.
[author] Baxendale, P.P. (2005). Renewal theory and computable convergence rates for geometrically ergodic Markov chains. Ann. Appl. Probab. 15 700–738
2005
Cited alongside, same era.
[author] Mitrophanov, A.A. (2005). Sensitivity and convergence of uniformly ergodic Markov chains. J. Appl. Prob. 42 1003–1014
2005
Cited alongside, same era.
[author] Hairer, M.M. (2006). Ergodic properties of Markov processes. Lecture notes, Univ. Warwick. Available at http://www.hairer.org/notes/Markov.pdf
2006
Cited alongside, same era.
[author] Meyn, S.S. and Tweedie, R.R. (2009). Markov chains and stochastic stability, Second ed. Cambridge University Press
2009
Cited alongside, same era.
[author] Kartashov, N.N. and Golomozyĭ, V.V. (2013). Maximal coupling procedure and stability of discrete Markov chains. I. Theory of Probability and Mathematical Statistics 86 93–104
2013
Later among the works it cites.
[author] Mao, Y.Y., Zhang, M.M. and Zhang, Y.Y. (2013). A Generalization of Dobrushin coefficient. Chinese J. Appl. Probab. Statist. 29 489–494
2013
Later among the works it cites.
Bardenet, R
2014
Later among the works it cites.
[author] Eberle, A.A. (2014). Error bounds for Metropolis-Hastings algorithms applied to perturbations of Gaussian measures in high dimensions. Ann. Appl. Probab. 24 337–377
2014
Later among the works it cites.
[author] Hairer, M.M., Stuart, A.A. and Vollmer, S.S. (2014). Spectral gaps for a Metropolis-Hastings algorithm in infinite dimensions. Ann. Appl. Probab. 24 2455–2490
2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
[author] Ollivier, Y.Y. (2009). Ricci curvature of Markov chains on metric spaces. J. Funct. Anal. 256 810–864
2009
Cited alongside, same era.
[author] Villani, C.C. (2009). Optimal Transport: Old and New. Springer Verlag, Berlin. Grundlehren der Mathematischen Wissenschaften, no. 338
2009
Cited alongside, same era.
[author] Madras, N.N. and Sezer, D.D. (2010). Quantitative bounds for Markov chain convergence: Wasserstein and total variation distances. Bernoulli 16 882–908
2010
Cited alongside, same era.
Hairer, M
2011
Cited alongside, same era.
Welling, M
2011
Cited alongside, same era.
2012
Cited alongside, same era.
[author] Marin, J. M.J. M., Pudlo, P.P., Robert, C.C. and Ryder, R.R. (2012). Approximate Bayesian computational methods. Stat. Comp. 22 1167–1180
2012
Cited alongside, same era.
Korattikara, A
2014
Later among the works it cites.
2014
Later among the works it cites.
2015
Closest in time.
Betancourt, M
2015
Closest in time.
[author] Durmus, A.A. and Moulines, E.E. (2015). Quantitative bounds of convergence for geometrically ergodic Markov chain in the Wasserstein distance with application to the Metropolis Adjusted Langevin Algorithm. Stat. Comput. 25 5–19
2015
Closest in time.
2015
Closest in time.
2015
Closest in time.
[author] Alquier, P.P., Friel, N.N., Everitt, R.R. and Boland, A.A. (2016). Noisy Monte Carlo: Convergence of Markov chains with approximate transition kernels. Stat. Comp. 26 29–47
2016
Closest in time.
[author] Medina-Aguayo, J.J., Lee, A.A. and Roberts, G.G. (2016). Stability of noisy Metropolis–Hastings. Stat. Comp. 26 1187–1211
2016
Closest in time.
[author] Teh, Y.Y., Thiéry, A.A. and Vollmer, S.S. (2016). Consistency and fluctuations for stochastic gradient Langevin dynamics. J. Mach. Learn. Res. 17 1–33
2016
Closest in time.