Fetching the paper…
Reading the bibliography…
We study the problem of sampling high and infinite dimensional target measures arising in applications such as conditioned diffusions and inverse problems.
Metropolis, N.N., Rosenbluth, A. W.A. W., Rosenbluth, M. N.M. N., Teller, A. H.A. H., Teller, E.E. et al. (1953). Equation of state calculations by fast computing machines. J. Chem. Phys. 21 1087
1953
Earlier work this paper cites.
Cheeger, JeffJ. (1970). A lower bound for the smallest eigenvalue of the Laplacian. In Problems in Analysis (Papers Dedicated to Salomon Bochner, 1969) 195–199. Princeton Univ. Press, Princeton, NJ
1969
Earlier work this paper cites.
Hastings, W. K.W. K. (1970). Monte-Carlo sampling methods using Markov chains and their applications. Biometrika 57 97
1970
Earlier work this paper cites.
Athreya, K. B.K. B. andNey, P.P. (1978). A new approach to the limit theory of recurrent Markov chains. Trans. Amer. Math. Soc. 245 493–501
1978
Earlier work this paper cites.
Nummelin, E.E. (1978). A splitting technique for Harris recurrent Markov chains. Probab. Theory Related Fields 43 309–318
1978
Earlier work this paper cites.
Bakry, D.D. andÉmery, MichelM. (1985). Diffusions hypercontractives. In Séminaire de Probabilités, XIX, 1983/84. Lecture Notes in Math. 1123 177–206. Springer, Berlin
1983
Earlier work this paper cites.
Kipnis, C.C. andVaradhan, S. R. S.S. R. S. (1986). Central limit theorem for additive functionals of reversible Markov processes and applications to simple exclusions. Comm. Math. Phys. 104 1–19
1986
Earlier work this paper cites.
Lawler, Gregory F.G. F. andSokal, Alan D.A. D. (1988). Bounds on the L 2 L^{2} spectrum for Markov chains and Markov processes: A generalization of Cheeger’s inequality. Trans. Amer. Math. Soc. 309 557–580
1988
Earlier work this paper cites.
Sinclair, AlistairA. andJerrum, MarkM. (1989). Approximate counting, uniform generation and rapidly mixing Markov chains. Inform. and Comput. 82 93–133
1989
Earlier work this paper cites.
Adler, Robert J.R. J. (1990). An Introduction to Continuity, Extrema, and Related Topics for General Gaussian Processes. Institute of Mathematical Statistics Lecture Notes—Monograph Series 12. IMS, Hayward, CA
1990
Earlier work this paper cites.
Diaconis, PersiP. andStroock, DanielD. (1991). Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Probab. 1 36–61
1991
Earlier work this paper cites.
Da Prato, GiuseppeG. andZabczyk, JerzyJ. (1992). Stochastic Equations in Infinite Dimensions. Encyclopedia of Mathematics and Its Applications 44. Cambridge Univ. Press, Cambridge
1992
Earlier work this paper cites.
Geyer, C. J.C. J. (1992). Practical Markov chain Monte Carlo. Statist. Sci. 7 473–483
1992
Earlier work this paper cites.
Frigessi, ArnoldoA., di Stefano, PatriziaP., Hwang, Chii-RueyC.-R. andSheu, Shuenn JyiS. J. (1993). Convergence rates of the Gibbs sampler, the Metropolis algorithm and other single-site updating dynamics. J. Roy. Statist. Soc. Ser. B 55 205–219
1993
Earlier work this paper cites.
Lovász, L.L. andSimonovits, M.M. (1993). Random walks in a convex body and an improved volume algorithm. Random Structures Algorithms 4 359–412
1993
Earlier work this paper cites.
Chan, K. S.K. S. andGeyer, C. J.C. J. (1994). Discussion: Markov chains for exploring posterior distributions. Ann. Statist. 22 1747–1758
1994
Earlier work this paper cites.
Geyer, C. J.C. J. andThompson, E. A.E. A. (1995). Annealing Markov chain Monte Carlo with applications to ancestral inference. J. Amer. Statist. Assoc. 90 909–920
1995
Earlier work this paper cites.
Roberts, G. O.G. O. andTweedie, R. L.R. L. (1996). Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms. Biometrika 83 95–110
1996
Earlier work this paper cites.
Bogachev, Vladimir I.V. I. (1998). Gaussian Measures. Mathematical Surveys and Monographs 62. Amer. Math. Soc., Providence, RI
1998
Cited alongside, same era.
Tierney, LukeL. (1998). A note on Metropolis–Hastings kernels for general state spaces. Ann. Appl. Probab. 8 1–9
1998
Cited alongside, same era.
Röckner, MichaelM. andWang, Feng-YuF.-Y. (2001). Weak Poincaré inequalities and L 2 L^{2} -convergence rates of Markov semigroups. J. Funct. Anal. 185 564–603
2001
Cited alongside, same era.
Wang, Feng-YuF.-Y. (2003). Functional inequalities for the decay of sub-Markov semigroups. Potential Anal. 18 1–23
2003
Cited alongside, same era.
Lee, Peter M.P. M. (2004). Bayesian Statistics: An Introduction, 3rd ed. Arnold, London
2004
Cited alongside, same era.
Joulin, AldéricA. andOllivier, YannY. (2010). Curvature, concentration and error estimates for Markov chain Monte Carlo. Ann. Probab. 38 2418–2442
2010
Later among the works it cites.
Stuart, A. M.A. M. (2010). Inverse problems: A Bayesian perspective. Acta Numer. 19 451–559
2010
Later among the works it cites.
Beskos, A.A., Pinski, F.F., Sanz-Serna, J. M.J. M. andStuart, A. M.A. M. (2011). Hybrid Monte-Carlo on Hilbert spaces. Stochastic Process. Appl. 121 2201–2230
2011
Closest in time.
Dashti, M.M. andStuart, A. M.A. M. (2011). Uncertainty quantification and weak approximation of an elliptic inverse problem. SIAM J. Numer. Anal. 49 2524–2542
2011
Closest in time.
Hairer, M.M., Mattingly, J. C.J. C. andScheutzow, M.M. (2011). Asymptotic coupling and a general form of Harris’ Theorem with applications to stochastic delay equations. Probab. Theory Related Fields 149 223–259
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Robert, Christian P.C. P. andCasella, GeorgeG. (2004). Monte Carlo Statistical Methods, 2nd ed. Springer, New York
2004
Cited alongside, same era.
Bogachev, V. I.V. I. (2007). Measure Theory. Vol. I, II. Springer, Berlin
2007
Cited alongside, same era.
Hairer, M.M., Stuart, A. M.A. M. andVoss, J.J. (2007). Analysis of SPDEs arising in path sampling. II. The nonlinear case. Ann. Appl. Probab. 17 1657–1706
2007
Cited alongside, same era.
Beskos, AlexandrosA., Roberts, GarethG., Stuart, AndrewA. andVoss, JochenJ. (2008). MCMC methods for diffusion bridges. Stoch. Dyn. 8 319–350
2008
Cited alongside, same era.
Liu, Jun S.J. S. (2008). Monte Carlo Strategies in Scientific Computing. Springer, New York
2008
Cited alongside, same era.
Beskos, AlexandrosA., Roberts, GarethG. andStuart, AndrewA. (2009). Optimal scalings for local Metropolis–Hastings chains on nonproduct targets in high dimensions. Ann. Appl. Probab. 19 863–898
2009
Cited alongside, same era.
Cuny, ChristopheC. andLin, MichaelM. (2009). Pointwise ergodic theorems with rate and application to the CLT for Markov chains. Ann. Inst. Henri Poincaré Probab. Stat. 45 710–733
2009
Cited alongside, same era.
2011
Closest in time.
Łatuszyński, KrzysztofK. andNiemiro, WojciechW. (2011). Rigorous confidence bounds for MCMC under a geometric drift condition. J. Complexity 27 23–38
2011
Closest in time.
Pillai, N. S.N. S., Stuart, A. M.A. M. andThiéry, A. H.A. H. (2011). Optimal proposal design for random walk type Metropolis algorithms with Gaussian random field priors. ArXiv E-prints
2011
Closest in time.
Dashti, MasoumehM., Harris, StephenS. andStuart, AndrewA. (2012). Besov priors for Bayesian inverse problems. Inverse Probl. Imaging 6 183–200
2012
Closest in time.
Komorowski, TomaszT. andWalczuk, AnnaA. (2012). Central limit theorem for Markov processes with spectral gap in the Wasserstein metric. Stochastic Process. Appl. 122 2155–2184
2012
Closest in time.
Mattingly, Jonathan C.J. C., Pillai, Natesh S.N. S. andStuart, Andrew M.A. M. (2012). Diffusion limits of the random walk Metropolis algorithm in high dimensions. Ann. Appl. Probab. 22 881–930
2012
Closest in time.
Rudolf, DanielD. (2012). Explicit error bounds for Markov chain Monte Carlo. Dissertationes Math. (Rozprawy Mat.) 485 1–93
2012
Closest in time.
Schwab, C.C. andStuart, A. M.A. M. (2012). Sparse deterministic approximation of Bayesian inverse problems. Inverse Problems 28 045003, 32
2012
Closest in time.
Beskos, AlexandrosA., Kalogeropoulos, KonstantinosK. andPazos, ErikE. (2013). Advanced MCMC methods for sampling on diffusion pathspace. Stochastic Process. Appl. 123 1415–1453
2013
Closest in time.
Cotter, S. L.S. L., Roberts, G. O.G. O., Stuart, A. M.A. M. andWhite, D.D. (2013). MCMC methods for functions: Modifying old algorithms to make them faster. Statist. Sci
2013
Closest in time.
Łatuszyński, K.K. andRoberts, G. O.G. O. (2013). CLTs and asymptotic variance of time-sampled Markov chains. Methodol. Comput. Appl. Probab. 15 237–247
2013
Closest in time.
2013
Closest in time.
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
Closest in time.