The DOI matches its Crossref record; 84 of the 84 references it cites were found in a registry or an index.
Spatial Point Processes
Abstract
Markov chain Monte Carlo (MCMC) originated with the classic paper of Metropolis et al. (1953), where it was used to simulate the distribution of states for a system of idealized molecules. Not long after, another approach tomolecular simulationwas introduced (Alder and Wainwright, 1959), in which the motion of the molecules was deterministic, following Newton’s laws ofmotion,which have an elegant formalization asHamiltonian dynamics. For finding the properties of bulk materials, these approaches are asymptotically equivalent, since even in a deterministic simulation, each local region of the material experiences effectively random influences from distant regions. Despite the large overlap in their application areas, the MCMC and molecular dynamics approaches have continued to coexist in the following decades (see Frenkel and Smit, 1996). In 1987, a landmark paper by Duane, Kennedy, Pendleton, and Roweth united the MCMC and molecular dynamics approaches. They called their method “hybrid Monte Carlo,” which abbreviates to “HMC,” but the phrase “Hamiltonian Monte Carlo,” retaining the abbreviation, is more specific and descriptive, and I will use it here. Duane et al. applied HMC not to molecular simulation, but to lattice field theory simulations of quantum chromodynamics. Statistical applications of HMC began with my use of it for neural network models (Neal, 1996a). I also provided a statistically-oriented tutorial on HMC in a review of MCMC methods (Neal, 1993, Chapter 5). There have been other applications of HMC to statistical problems (e.g. Ishwaran, 1999; Schmidt, 2009) and statisticallyoriented reviews (e.g. Liu, 2001, Chapter 9), but HMC still seems to be underappreciated by statisticians, and perhaps also by physicists outside the lattice field theory community. This review begins by describing Hamiltonian dynamics. Despite terminology that may be unfamiliar outside physics, the features of Hamiltonian dynamics that are needed for HMC are elementary. The differential equations of Hamiltonian dynamics must be discretized for computer implementation. The “leapfrog” scheme that is typically used is quite simple. Following this introduction to Hamiltonian dynamics, I describe how to use it to con- struct an MCMCmethod. The first step is to define a Hamiltonian function in terms of the probability distribution we wish to sample from. In addition to the variables we are interested in (the “position” variables), we must introduce auxiliary “momentum” variables, which typically have independent Gaussian distributions. The HMC method alternates simple updates for these momentum variables with Metropolis updates in which a new state is proposed by computing a trajectory according to Hamiltonian dynamics, implemented with the leapfrog method. A state proposed in this way can be distant from the the exploration of the state space that occurs whenMetropolis updates are done using a simple random-walkproposal distribution. (Analternativewayof avoiding randomwalks is touse short trajectories but only partially replace the momentum variables between trajectories, so that successive trajectories tend to move in the same direction.) After presenting the basic HMCmethod, I discuss practical issues of tuning the leapfrog stepsize and number of leapfrog steps, as well as theoretical results on the scaling of HMC with dimensionality. I then present a number of variations on HMC. The acceptance rate for HMC can be increased for many problems by looking at “windows” of states at the beginning and end of the trajectory. For many statistical problems, approximate computation of trajectories (e.g. using subsets of the data) may be beneficial. Tuning of HMC can be made easier using a “short-cut” in which trajectories computed with a bad choice of stepsize take little computation time. Finally, “tempering” methods may be useful when multiple isolated modes exist.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Monte Carlo sampling methods using Markov chains and their applications.
Hastings, W. K. (1970) · Biometrika · doi:10.1093/biomet/57.1.97 · Cited by 15,195
Gaussian Processes for Machine Learning
Rasmussen, C. E., & Williams, C. K. I. (2005) · doi:10.7551/mitpress/3206.001.0001 · Cited by 11,705
Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
GREEN, P. J. (1995) · Biometrika · doi:10.1093/biomet/82.4.711 · Cited by 5,930
Bayesian Learning for Neural Networks
Neal, R. M. (1996) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-0745-0 · Cited by 4,276
Duane, S., Kennedy, A. D., Pendleton, B. J., & Roweth, D. (1987) · Physics Letters B · doi:10.1016/0370-2693(87)91197-x · Cited by 3,872
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
Chernoff, H. (1952) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729330 · Cited by 3,550
Studies in Molecular Dynamics. I. General Method
Alder, B. J., & Wainwright, T. E. (1959) · The Journal of Chemical Physics · doi:10.1063/1.1730376 · Cited by 2,524
Ripley, B. D. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01615.x · Cited by 2,511
Simulated Tempering: A New Monte Carlo Scheme
Marinari, E., & Parisi, G. (1992) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/19/6/002 · Cited by 1,818
Weak convergence and optimal scaling of random walk Metropolis algorithms
Roberts, G. O., Gelman, A., & Gilks, W. R. (1997) · The Annals of Applied Probability · doi:10.1214/aoap/1034625254 · Cited by 1,693
Negative Association of Random Variables with Applications
Joag-Dev, K., & Proschan, F. (1983) · The Annals of Statistics · doi:10.1214/aos/1176346079 · Cited by 1,486
Neal, R. M. (2003) · The Annals of Statistics · doi:10.1214/aos/1056562461 · Cited by 1,361
Neal, R. M. (2001) · Statistics and Computing · doi:10.1023/a:1008923215028 · Cited by 1,172
Exact sampling with coupled Markov chains and applications to statistical mechanics
Propp, J. G., & Wilson, D. B. (1996) · Random Structures and Algorithms · doi:10.1002/(sici)1098-2418(199608/09)9:1/2<223::aid-rsa14>3.0.co;2-o · Cited by 1,159
Simulating Hamiltonian Dynamics
Leimkuhler, B., & Reich, S. (2005) · Cambridge University Press eBooks · doi:10.1017/cbo9780511614118 · Cited by 1,130
Lectures on the Coupling Method
Lindvall, T. (1992) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,096
Statistical Inference and Simulation for Spatial Point Processes
Moller, J., & Waagepetersen, R. P. (2003) · Chapman & Hall/CRC eBooks · doi:10.1201/9780203496930 · Cited by 1,055
van Dyk, D. A., & Meng, X.-L. (2001) · Journal of Computational and Graphical Statistics · doi:10.1198/10618600152418584 · Cited by 1,052
Probabilistic Inference Using Markov Chain Monte Carlo Methods
Neal, R. M. (2011) · Cited by 1,047
Parallel Tempering: Theory, Applications, and New PerspectivesPreprint
Earl, D. J., & Deem, M. W. (2008) · Cited by 1,037
Exponential Convergence of Langevin Distributions and Their Discrete Approximations
Roberts, G. O., & Tweedie, R. L. (1996) · Bernoulli · doi:10.2307/3318418 · Cited by 998
Bulletin of the International Statistical Institute
Leckie, G. (2013) · Cited by 958
Simulating normalizing constants: from importance sampling to bridge sampling to path sampling
Gelman, A., & Meng, X.-L. (1998) · Statistical Science · doi:10.1214/ss/1028905934 · Cited by 951
Andrieu, C., & Thoms, J. (2008) · Statistics and Computing · doi:10.1007/s11222-008-9110-y · Cited by 903
Random Number Generation and Monte Carlo Methods
B. Borkowf, C. (2000) · Technometrics · doi:10.1080/00401706.2000.10485723 · Cited by 799
New Model for the Study of Liquid–Vapor Phase Transitions
Widom, B., & Rowlinson, J. S. (1970) · The Journal of Chemical Physics · doi:10.1063/1.1673203 · Cited by 666
Optimal Scaling of Discrete Approximations to Langevin Diffusions
Roberts, G. O., & Rosenthal, J. S. (1998) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00123 · Cited by 632
SIMULATING RATIOS OF NORMALIZING CONSTANTS VIA A SIMPLE IDENTITY: A THEORETICAL EXPLORATION
Meng, X., & Wong, W. H. (1996) · Cited by 625
MTW, & Tanner, M. A. (1997) · Journal of the American Statistical Association · doi:10.2307/2965746 · Cited by 608
Brownian dynamics as smart Monte Carlo simulation
Rossky, P. J., Doll, J. D., & Friedman, H. L. (1978) · The Journal of Chemical Physics · doi:10.1063/1.436415 · Cited by 509
An Introduction to Probability Theory and Its Applications
Samuels, S. M. (1973) · Technometrics · doi:10.1080/00401706.1973.10489056 · Cited by 503
Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
Rosenthal, J. S. (1995) · Journal of the American Statistical Association · doi:10.1080/01621459.1995.10476548 · Cited by 487
STRAUSS, D. J. (1975) · Biometrika · doi:10.1093/biomet/62.2.467 · Cited by 416
The accuracy of symplectic integrators
McLachlan, R. I., & Atela, P. (1992) · Nonlinearity · doi:10.1088/0951-7715/5/2/011 · Cited by 380
Gibbs Sampling for Bayesian Non-Conjugate and Hierarchical Models by Using Auxiliary Variables
Damlen, P., Wakefield, J., & Walker, S. (1999) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00179 · Cited by 361
Møller, J., Pettitt, A. N., Reeves, R., & Berthelsen, K. K. (2006) · Biometrika · doi:10.1093/biomet/93.2.451 · Cited by 352
Sampling from multimodal distributions using tempered transitions
Neal, R. M. (1996) · Statistics and Computing · doi:10.1007/bf00143556 · Cited by 343
Modern Statistics for Spatial Point Processes*
MØLLER, J., & WAAGEPETERSEN, R. P. (2007) · Scandinavian Journal of Statistics · doi:10.1111/j.1467-9469.2007.00569.x · Cited by 305
A generalized guided Monte Carlo algorithm
Horowitz, A. M. (1991) · Physics Letters B · doi:10.1016/0370-2693(91)90812-5 · Cited by 282
MCMC for doubly-intractable distributions
Murray, I., Ghahramani, Z., & Mackay, D. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1206.6848 · Cited by 281
A new Monte Carlo technique: antithetic variates
Hammersley, J. M., & Morton, K. W. (1956) · Mathematical Proceedings of the Cambridge Philosophical Society · doi:10.1017/s0305004100031455 · Cited by 268
Hamiltonian evolution for the hybrid Monte Carlo algorithm
Sexton, J. C., & Weingarten, D. (1992) · Nuclear Physics B · doi:10.1016/0550-3213(92)90263-b · Cited by 256
Regeneration in Markov Chain Samplers
Mykland, P., Tierney, L., & Yu, B. (1995) · Journal of the American Statistical Association · doi:10.1080/01621459.1995.10476507 · Cited by 224
Area-interaction point processes
Baddeley, A. J., & van Lieshout, M. N. M. (1995) · Annals of the Institute of Statistical Mathematics · doi:10.1007/bf01856536 · Cited by 211
A note on Strauss's model for clustering
KELLY, F. P., & REPLEY, B. D. (1976) · Biometrika · doi:10.1093/biomet/63.2.357 · Cited by 203
Tanner, M. A. (1998) · Biometrics · doi:10.2307/3109795 · Cited by 199
Kendall, W. S., & Møller, J. (2000) · Advances in Applied Probability · doi:10.1017/s0001867800010284 · Cited by 190
Nearest-Neighbour Markov Point Processes and Random Sets
Baddeley, A., Møller, J., & Moller, J. (1989) · International Statistical Review / Revue Internationale de Statistique · doi:10.2307/1403381 · Cited by 179
An Improved Acceptance Procedure for the Hybrid Monte Carlo Algorithm
Neal, R. M. (1994) · Journal of Computational Physics · doi:10.1006/jcph.1994.1054 · Cited by 178
Higher-order hybrid Monte Carlo algorithms
Creutz, M. J., & Gocksch, A. (1989) · Physical Review Letters · doi:10.1103/physrevlett.63.9 · Cited by 168
Gaussian Processes to Speed up Hybrid Monte Carlo for Expensive Bayesian Integrals
Rasmussen, C. E. (2003) · doi:10.1093/oso/9780198526155.003.0045 · Cited by 167
An interruptible algorithm for perfect sampling via Markov chains
Fill, J. A. (1998) · The Annals of Applied Probability · doi:10.1214/aoap/1027961037 · Cited by 167
Exact Sampling from a Continuous State Space
Murdoch, D. J., & Green, P. J. (1998) · Scandinavian Journal of Statistics · doi:10.1111/1467-9469.00116 · Cited by 162
Global Monte Carlo algorithms for many-fermion systems
Creutz, M. J. (1988) · Physical review. D. Particles, fields, gravitation, and cosmology/Physical review. D. Particles and fields · doi:10.1103/physrevd.38.1228 · Cited by 150
Perfect Simulation for the Area-Interaction Point Process
Kendall, W. S. (1998) · Lecture notes in statistics · doi:10.1007/978-1-4612-2224-8_13 · Cited by 141
Shadow hybrid Monte Carlo: an efficient propagator in phase space of macromolecules
Izaguirre, J. A., & Hampton, S. S. (2004) · Journal of Computational Physics · doi:10.1016/j.jcp.2004.04.016 · Cited by 134
Mass tensor molecular dynamics
Bennett, C. H. (1975) · Journal of Computational Physics · doi:10.1016/0021-9991(75)90077-7 · Cited by 130
Some Inequalities for Reversible Markov Chains
Aldous, D. (1982) · Journal of the London Mathematical Society · doi:10.1112/jlms/s2-25.3.564 · Cited by 124
Meng, X., & Schilling, S. G. (2002) · Journal of Computational and Graphical Statistics · doi:10.1198/106186002457 · Cited by 114
The acceptance probability in the hybrid Monte Carlo method
Sourendu Gupta, A., Irbäc, A., Karsch, F., et al. (1990) · Physics Letters B · doi:10.1016/0370-2693(90)91790-i · Cited by 103
Perfect simulation and backward coupling
Foss, S., & Tweedie, R. L. (1998) · Stochastic Models · doi:10.1080/15326349808807466 · Cited by 102
How to couple from the past using a read-once source of randomness
Wilson, D. B. (2000) · Random Structures and Algorithms · doi:10.1002/(sici)1098-2418(200001)16:1<85::aid-rsa6>3.0.co;2-h · Cited by 100
An improved hybrid Monte Carlo method
Mackenze, P. B. (1989) · Physics Letters B · doi:10.1016/0370-2693(89)91212-4 · Cited by 99
Häggström, O., van Lieshout, M. N. M., Møller, J., Häggström, O., & Møller, J. (1999) · Bernoulli · doi:10.2307/3318694 · Cited by 96
A Bivariate Spatial Point Pattern of Ants' Nests
Harkness, R. D., & Isham, V. S. (1983) · Journal of the Royal Statistical Society Series C (Applied Statistics) · doi:10.2307/2347952 · Cited by 91
Advances in Markov chain Monte Carlo methods
Murray, I. (2007) · Cited by 75
Extension of Fill's perfect rejection sampling algorithm to general chains
Fill, J. A., Machida, M., Murdoch, D. J., & Rosenthal, J. S. (2000) · Random Structures and Algorithms · doi:10.1002/1098-2418(200010/12)17:3/4<290::aid-rsa6>3.0.co;2-q · Cited by 75
Acceptances and autocorrelations in hybrid Monte Carlo
Kennedy, A. D., & Pendleton, B. J. (1991) · Nuclear Physics B - Proceedings Supplements · doi:10.1016/0920-5632(91)90893-j · Cited by 61
Multiprocess parallel antithetic coupling for backward and forward Markov Chain Monte Carlo
Craiu, R. V., & Meng, X. (2005) · The Annals of Statistics · doi:10.1214/009053604000001075 · Cited by 60
Cost of the generalised hybrid Monte Carlo algorithm for free field theory
Kennedy, A. D., & Pendleton, B. J. (2001) · Nuclear Physics B · doi:10.1016/s0550-3213(01)00129-8 · Cited by 56
Playing Billiards in Version Space
Ruján, P. (1997) · Neural Computation · doi:10.1162/neco.1997.9.1.99 · Cited by 55
A primer on perfect simulation for spatial point processes
Berthelsen, K. K., & M�ller, J. (2002) · Bulletin of the Brazilian Mathematical Society New Series · doi:10.1007/s005740200019 · Cited by 40
Multipoint Metropolis Method with Application to Hybrid Monte Carlo
Qin, Z. S., & Liu, J. S. (2001) · Journal of Computational Physics · doi:10.1006/jcph.2001.6860 · Cited by 37
Function factorization using warped Gaussian processes
Schmidt, M. N. (2009) · International Conference on Machine Learning · doi:10.1145/1553374.1553492 · Cited by 29
On perfect simulation for some mixtures of distributions
Hobert, J. P., Robert, C. P., & Titterington, D. M. (1999) · Statistics and Computing · doi:10.1023/a:1008912006771 · Cited by 26
The Theory of Hybrid Stochastic Algorithms
Kennedy, A. D. (1990) · NATO ASI series. Series B : Physics · doi:10.1007/978-1-4615-3784-7_14 · Cited by 25
Perfect simulation of positive Gaussian distributions
Philippe, A., & Robert, C. P. (2003) · Statistics and Computing · doi:10.1023/a:1023264710933 · Cited by 22
A general limitation on Monte Carlo algorithms of the Metropolis type
Caracciolo, S., Pelissetto, A., & Sokal, A. D. (1994) · Physical Review Letters · doi:10.1103/physrevlett.72.179 · Cited by 22
Perfect Slice Samplers for Mixtures of DistributionsPreprint
Casella, G., Mengersen, K. L., Robert, C. P., & Titterington, D. M. (1999) · RePEc: Research Papers in Economics · Cited by 21
The Short-Cut Metropolis MethodPreprint
Neal, R. M. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.math/0508060 · Cited by 15
Efficient use of exact samples
Murdoch, D. J., & Rosenthal, J. S. (2000) · Statistics and Computing · doi:10.1023/a:1008991527785 · Cited by 15
Perfect Sampling for Point Process Cluster Modelling
McKeague, I. W., & Loizeaux, M. A. (2002) · Chapman & Hall/CRC eBooks · doi:10.1201/9781420035414.ch5 · Cited by 13
One-Shot CFTP; Application to a Class of Truncated Gaussian Densities
Beskos, A., & Roberts, G. O. (2005) · Methodology And Computing In Applied Probability · doi:10.1007/s11009-005-5001-2 · Cited by 8
Cited by
brms : An R Package for Bayesian Multilevel Models Using Stan
Bürkner, P.-C. (2017) · Journal of Statistical Software · doi:10.18637/jss.v080.i01 · Cited by 9,476
“Currently, these are the static Hamiltonian Monte-Carlo (HMC) Sampler sometimes also referred to as Hybrid Monte-Carlo (Neal 2011, 2003; Duane et al. 1987) and its extension the No-U-Turn Sampler (NUTS) by Hoffman and Gelman (2014).”
BackgroundMethodInfluentialStan : A Probabilistic Programming Language
Carpenter, B., Gelman, A., Hoffman, M. D., Lee, D., Goodrich, B., Betancourt, M., Brubaker, M., Guo, J., Li, P., & Riddell, A. (2017) · Journal of Statistical Software · doi:10.18637/jss.v076.i01 · Cited by 7,754
“An additional benefit of RHMC are transitions that can cover much larger variations in density, making it uniquely suited to these models; see (Neal 2011). vector[K] beta; beta <- mu + sigma * beta_raw; } model { beta ~ normal(0,1); } This reparameterization removes the particular correlations…”
MethodAn Introduction to Variational Autoencoders
Kingma, D. P., & Welling, M. (2019) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000056 · Cited by 2,609
Riemann manifold langevin and hamiltonian monte carlo methods
Girolami, M., & Calderhead, B. (2011) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2010.00765.x · Cited by 1,473
A survey of uncertainty in deep neural networks
Gawlikowski, J., Tassi, C. R. N., Ali, M., Lee, J., Humt, M., Feng, J., Kruspe, A., Triebel, R., Jung, P., Roscher, R., et al. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-023-10562-9 · Cited by 1,406
Metadata
- Authors
- Huber, M.
- Venue
- Handbook of Markov Chain Monte Carlo
- Publisher
- Chapman and Hall/CRC
- Published
- 2011-05-10
- Pages
- 227-252
- OpenAlex
- W2478027467
- Cited by
- 1,176
- References
- 84
- FWCI
- 106.13
- Type
- book chapter
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.