Fetching the paper…
Reading the bibliography…
The Bouncy Particle sampler (BPS) and the Zig-Zag sampler (ZZS) are continuous time, non-reversible Monte Carlo methods based on piecewise deterministic Markov processes.
[author] Andrieu, ChristopheC. and Livingstone, SamuelS. (2019). Peskun-Tierney ordering for Markov chain and process Monte Carlo: beyond the reversible scenario. arXiv 1906.06197
1906
Earlier work this paper cites.
[author] Davis, M. H. A.M. H. A. (1993). Markov Models & Optimization. Chapman & Hall/CRC Monographs on Statistics & Applied Probability. Taylor & Francis
1993
Earlier work this paper cites.
[author] Meyn, Sean P.S. P. and Tweedie, R. L.R. L. (1993). Stability of Markovian processes III: Foster–Lyapunov criteria for continuous-time processes. Advances in Applied Probability 25 518–548
1993
Earlier work this paper cites.
[author] Rosenthal, Jeffrey S.J. S. (1995). Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo. Journal of the American Statistical Association 90 558–566
1995
Earlier work this paper cites.
[author] Arveson, WilliamW. (1996). Notes on measure and integration in locally compact spaces
1996
Earlier work this paper cites.
[author] Roberts, Gareth O.G. O. and Tweedie, Richard L.R. L. (1996). Exponential Convergence of Langevin Distributions and Their Discrete Approximations. Bernoulli 2 341–363
1996
Earlier work this paper cites.
[author] Engel, Klaus-JochenK.-J. and Nagel, RainerR. (2001). One-Parameter Semigroups for Linear Evolution Equations. Semigroup Forum 63 278-280. 10.1007/s002330010042
2001
Earlier work this paper cites.
[author] Roberts, Gareth O.G. O. and Stramer, OsnatO. (2002). Langevin Diffusions and Metropolis-Hastings Algorithms. Methodology and Computing in Applied Probability
2002
Earlier work this paper cites.
[author] Jacod, J.J. and Protter, P.P. (2004). Probability Essentials, 2nd ed. Springer Berlin Heidelberg
2004
Earlier work this paper cites.
[author] Roberts, Gareth O.G. O. and Rosenthal, Jeffrey S.J. S. (2004). General state space Markov chains and MCMC algorithms. Probab. Surveys 1 20–71. 10.1214/154957804100000024
2004
Earlier work this paper cites.
[author] Lu, JianfengJ. and Wang, LihanL. (2020). On explicit L 2 L^{2} -convergence rate estimate for piecewise deterministic Markov processes. arXiv 2007.14927
2007
Earlier work this paper cites.
[author] Roberts, Gareth O.G. O. and Rosenthal, Jeffrey S.J. S. (2007). Coupling and ergodicity of adaptive Markov chain Monte Carlo algorithms. Journal of Applied Probability 44 458–475
2007
Earlier work this paper cites.
[author] Andrieu, ChristopheC. and Thoms, JohannesJ. (2008). A tutorial on adaptive MCMC. Statistics and Computing 18. 10.1007/s11222-008-9110-y
2008
Earlier work this paper cites.
[author] Roberts, Gareth O.G. O. and Rosenthal, Jeffrey S.J. S. (2009). Examples of Adaptive MCMC. Journal of Computational and Graphical Statistics 18 349-367. 10.1198/jcgs.2009.06134
2009
Earlier work this paper cites.
2010
Cited alongside, same era.
[author] Bai, YanY., Roberts, Gareth O.G. O. and Rosenthal, Jeffrey S.J. S. (2011). On the containment condition for adaptive Markov chain Monte Carlo algorithms. Advances and Applications in Statistics 21 1–54
2011
Cited alongside, same era.
[author] Fort, G.G., Moulines, E.E. and Priouret, P.P. (2011). Convergence of adaptive and interacting Markov chain Monte Carlo algorithms. Ann. Statist. 39 3262–3289. 10.1214/11-AOS938
2011
Cited alongside, same era.
[author] Fort, GersendeG., Moulines, EricE., Priouret, PierreP. and Vandekerkhove, PierreP. (2011). A central limit theorem for adaptive and interacting Markov chains. Bernoulli 20
2011
Cited alongside, same era.
[author] Vanetti, PaulP., Bouchard-Côté, AlexandreA., Deligiannidis, GeorgeG. and Doucet, ArnaudA. (2017). Piecewise-Deterministic Markov Chain Monte Carlo. arXiv 1707.05296
2017
Later among the works it cites.
[author] Bierkens, JorisJ., Kamatani, KengoK. and Roberts, Gareth O.G. O. (2018). High-dimensional scaling limits of piecewise deterministic sampling algorithms. arXiv 1807.11358
2018
Later among the works it cites.
[author] Bouchard-Côté, AlexandreA., Vollmer, Sebastian J.S. J. and Doucet, ArnaudA. (2018). The Bouncy Particle Sampler: A Nonreversible Rejection-Free Markov Chain Monte Carlo Method. Journal of the American Statistical Association 113 855-867
2018
Later among the works it cites.
[author] Chimisov, CyrilC., Latuszynski, KrzysztofK. and Roberts, GarethG. (2018). Adapting The Gibbs Sampler. arXiv 1801.09299
2018
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] Girolami, MarkM. and Calderhead, BenB. (2011). Riemann manifold Langevin and Hamiltonian Monte Carlo methods. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 73 123-214
2011
Cited alongside, same era.
[author] Neal, Radford MR. M. (2011). MCMC using Hamiltonian dynamics. Handbook of Markov chain Monte Carlo 2 2
2011
Cited alongside, same era.
[author] Peters, E. A. J. F.E. A. J. F. and De With, G.G. (2012). Rejection-free Monte Carlo sampling for general potentials. Physical Review E - Statistical, Nonlinear, and Soft Matter Physics 85 1–5. 10.1103/PhysRevE.85.026703
2012
Cited alongside, same era.
2012
Cited alongside, same era.
[author] Michel, M.M., Kapfer, S. C.S. C. and Krauth, W.W. (2014). Generalized event-chain Monte Carlo: Constructing rejection-free global-balance algorithms from infinitesimal steps. The Journal of Chemical Physics 140. http://dx.doi.org/10.1063/1.4863991
2014
Cited alongside, same era.
[author] Craiu, Radu V.R. V., Gray, LawrenceL., Łatuszyński, KrzysztofK., Madras, NealN., Roberts, Gareth O.G. O. and Rosenthal, Jeffrey S.J. S. (2015). Stability of adversarial Markov chains, with an application to adaptive MCMC algorithms. Ann. Appl. Probab. 25 3592–3623. 10.1214/14-AAP1083
2015
Cited alongside, same era.
[author] Monmarché, P.P. (2016). Piecewise deterministic simulated annealing. ALEA 13 357–398
2016
Cited alongside, same era.
[author] Bardenet, RémiR., Doucet, ArnaudA. and Holmes, Christopher CC. C. (2017). On Markov chain Monte Carlo methods for tall data. Journal of Machine Learning Research 18
2017
Cited alongside, same era.
[author] Fearnhead, PaulP., Bierkens, JorisJ., Pollock, MurrayM. and Roberts, Gareth O.G. O. (2018). Piecewise Deterministic Markov Processes for Continuous-Time Monte Carlo. Statist. Sci. 33 386–412. 10.1214/18-STS648
2018
Later among the works it cites.
[author] Andrieu, ChristopheC., Durmus, AlainA., Nüsken, NikolasN. and Roussel, JulienJ. (2019). Hypocoercivity of Piecewise Deterministic Markov Process-Monte Carlo. arXiv 1808.08592
2019
Later among the works it cites.
[author] Bierkens, JorisJ., Fearnhead, PaulP. and Roberts, GarethG. (2019). The Zig-Zag Process and Super-Efficient Sampling for Bayesian Analysis of Big Data. Annals of Statistics 47. 10.1214/18-AOS1715
2019
Later among the works it cites.
[author] Bierkens, JorisJ., Roberts, GarethG. and Zitt, Pierre-AndréP.-A. (2019). Ergodicity of the zigzag process. The Annals of Applied Probability 29
2019
Later among the works it cites.
[author] Deligiannidis, GeorgeG., Bouchard-Côté, AlexandreA. and Doucet, ArnaudA. (2019). Exponential ergodicity of the bouncy particle sampler. Ann. Statist. 47 1268–1287. 10.1214/18-AOS1714
2019
Later among the works it cites.
Bierkens, J
2020
Closest in time.
[author] Pompe, EmiliaE., Holmes, ChrisC. and Łatuszyński, KrzysztofK. (2020). A framework for adaptive MCMC targeting multimodal distributions. Ann. Statist. 48 2930–2952. 10.1214/19-AOS1916
2020
Closest in time.
[author] Vialaret, MarieM. and Maire, FlorianF. (2020). On the convergence time of some non-reversible Markov chain Monte Carlo methods. Methodology and Computing in Applied Probability
2020
Closest in time.
[author] Durmus, AlainA., Guillin, ArnaudA. and Monmarché, PierreP. (2020). Geometric ergodicity of the Bouncy Particle Sampler. Ann. Appl. Probab. 30 2069–2098. 10.1214/19-AAP1552
2098
Closest in time.