The DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
Handbook of Monte Carlo Methods
Abstract
A comprehensive overview of Monte Carlo simulation that explores the latest topics, techniques, and real-world applications More and more of today’s numerical problems found in engineering and finance are solved through Monte Carlo methods. The heightened popularity of these methods and their continuing development makes it important for researchers to have a comprehensive understanding of the Monte Carlo approach. Handbook of Monte Carlo Methods provides the theory, algorithms, and applications that helps provide a thorough understanding of the emerging dynamics of this rapidly-growing field. The authors begin with a discussion of fundamentals such as how to generate random numbers on a computer. Subsequent chapters discuss key Monte Carlo topics and methods, including: - Random variable and stochastic process generation - Markov chain Monte Carlo, featuring key algorithms such as the Metropolis-Hastings method, the Gibbs sampler, and hit-and-run - Discrete-event simulation - Techniques for the statistical analysis of simulation data including the delta method, steady-state estimation, and kernel density estimation - Variance reduction, including importance sampling, latin hypercube sampling, and conditional Monte Carlo - Estimation of derivatives and sensitivity analysis - Advanced topics including cross-entropy, rare events, kernel density estimation, quasi Monte Carlo, particle systems, and randomized optimization The presented theoretical concepts are illustrated with worked examples that use MATLAB, a related Web site houses the MATLAB code, allowing readers to work hands-on with the material and also features the author's own lecture notes on Monte Carlo methods. Detailed appendices provide background material on probability theory, stochastic processes, and mathematical statistics as well as the key optimization concepts and techniques that are relevant to Monte Carlo simulation. Handbook of Monte Carlo Methods is an excellent reference for applied statisticians and practitioners working in the fields of engineering and finance who use or would like to learn how to use Monte Carlo in their research. It is also a suitable supplement for courses on Monte Carlo methods and computational statistics at the upper-undergraduate and graduate levels.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“In an appropriate asymptotic tail regime, the minimax tilting yields an estimator with vanishing relative error (VRE) property (Kroese et al., 2011).”
From The Normal Law Under Linear Restrictions: Simulation and Estimation via Minimax Tilting (2017) · cites this paper as Kroese et al., 2011
In the citing paper
“The main limitation of the estimator l (with or without variable reordering) is that Var( l) is unknown and its estimate S 2 can be notoriously unreliable in the sense that the observed S 2 may be very small, while the true Var( l) is huge (Kroese et al., 2011;Botev et al., 2013).”
From The Normal Law Under Linear Restrictions: Simulation and Estimation via Minimax Tilting (2017) · cites this paper as Kroese et al., 2011
Citations
Cites
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
Matsumoto, M., & Nishimura, T. (1998) · ACM Transactions on Modeling and Computer Simulation · doi:10.1145/272991.272995 · Cited by 5,780
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
Taussky, O., & Knuth, D. E. (1970) · The American Mathematical Monthly · doi:10.2307/2317055 · Cited by 3,822
Monte Carlo Methods in Financial Engineering
Glasserman, P. (2003) · Stochastic Modelling and Applied Probability · doi:10.1007/978-0-387-21617-1 · Cited by 3,782
Bassham, L. E., Rukhin, A. L., Soto, J., Nechvatal, J. R., Smid, M. E., Barker, E. B., Leigh, S. D., Levenson, M., Vangel, M., Banks, D. L., et al. (2010) · NIST Special Publication 800-22 Revision 1a · doi:10.6028/nist.sp.800-22r1a · Cited by 3,617 · cited 1×
“2], and adapted version of the Diehard suite of tests by Marsaglia [28], the ones implemented by the National Institute of Standards and Technology (NIST) [37], and various other tests.”
MethodOn the distribution of points in a cube and the approximate evaluation of integrals
Sobol', I. M. (1967) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(67)90144-9 · Cited by 2,975
Random Number Generation and Quasi-Monte Carlo Methods.
Collings, B. J., & Niederreiter, H. (1993) · Journal of the American Statistical Association · doi:10.2307/2290359 · Cited by 2,884
Halton, J. H. (1960) · Numerische Mathematik · doi:10.1007/bf01386213 · Cited by 1,985
Monte Carlo: Concepts, Algorithms, and Applications
Wasserstein, R. L. (1997) · Technometrics · doi:10.1080/00401706.1997.10485133 · Cited by 1,790
Monte Carlo and quasi-Monte Carlo methods
Caflisch, R. E. (1998) · Acta Numerica · doi:10.1017/s0962492900002804 · Cited by 1,754
A Simple Unpredictable Pseudo-Random Number Generator
Blum, L., Blum, M., & Shub, M. (1986) · SIAM Journal on Computing · doi:10.1137/0215025 · Cited by 1,036
TestU01: A C library for empirical testing of random number generators
L'Ecuyer, P., & Simard, R. (2007) · ACM Transactions on Mathematical Software · doi:10.1145/1268776.1268777 · Cited by 1,014
Random Number Generation and Monte Carlo Methods
B. Borkowf, C. (2000) · Technometrics · doi:10.1080/00401706.2000.10485723 · Cited by 799
Algorithm 659: Implementing Sobol's quasirandom sequence generator
Bratley, P., & Fox, B. L. (1988) · ACM Transactions on Mathematical Software · doi:10.1145/42288.214372 · Cited by 754
Lattice Methods for Multiple Integration
Sloan, I. H., & Joe, S. (1994) · doi:10.1093/oso/9780198534723.001.0001 · Cited by 750
Number-Theoretic Methods in Statistics.
Ripley, B. D., Fang, K.-T., & Wang, Y. (1995) · Journal of the Royal Statistical Society. Series A (Statistics in Society) · doi:10.2307/2983421 · Cited by 621
Algorithm AS 183: An Efficient and Portable Pseudo-Random Number Generator
Wichmann, B. A., & Hill, I. D. (1982) · Applied Statistics · doi:10.2307/2347988 · Cited by 618
RANDOM NUMBERS FALL MAINLY IN THE PLANES
Marsaglia, G. (1968) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.61.1.25 · Cited by 521
MONTE CARLO METHODS FOR SOLVING MULTIVARIABLE PROBLEMS
Hammersley, J. M. (1960) · Annals of the New York Academy of Sciences · doi:10.1111/j.1749-6632.1960.tb42846.x · Cited by 516
Monte Carlo and Quasi-Monte Carlo Sampling
(2009) · Springer Series in Statistics · doi:10.1007/978-0-387-78165-5 · Cited by 497
On irregularities of distribution
Roth, K. F. (1954) · Mathematika · doi:10.1112/s0025579300000541 · Cited by 475
Good Parameters and Implementations for Combined Multiple Recursive Random Number Generators
L'Ecuyer, P. (1999) · Operations Research · doi:10.1287/opre.47.1.159 · Cited by 460
Monte Carlo methods in finance
Jäckel, P. (2002) · Cited by 459
Randomly Permuted (t,m,s)-Nets and (t, s)-Sequences
Owen, A. B. (1995) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-2552-2_19 · Cited by 397
A pseudo-random number generator for the System/360
Lewis, P. A. W., Goodman, A. S., & Miller, J. M. (1969) · IBM Systems Journal · doi:10.1147/sj.82.0136 · Cited by 370
An Object-Oriented Random-Number Package with Many Long Streams and Substreams
L'Ecuyer, P., Simard, R., Chen, E. J., & Kelton, W. D. (2002) · Operations Research · doi:10.1287/opre.50.6.1073.358 · Cited by 347
Remark on algorithm 659: Implementing Sobol's quasirandom sequence generator
Joe, S., & Kuo, F. Y. (2003) · ACM Transactions on Mathematical Software · doi:10.1145/641876.641879 · Cited by 346
Generalized Feedback Shift Register Pseudorandom Number Algorithm
Lewis, T. G., & Payne, W. H. (1973) · Journal of the ACM · doi:10.1145/321765.321777 · Cited by 312
Fourier Analysis of Uniform Random Number Generators
Coveyou, R. R., & Macpherson, R. D. (1967) · Journal of the ACM · doi:10.1145/321371.321379 · Cited by 295
L'Ecuyer, P. (1990) · Communications of the ACM · doi:10.1145/84537.84555 · Cited by 282
Uniform random number generation
L'Ecuyer, P. (1994) · Annals of Operations Research · doi:10.1007/bf02136827 · Cited by 279
Scrambled net variance for integrals of smooth functions
Owen, A. B. (1997) · The Annals of Statistics · doi:10.1214/aos/1031594731 · Cited by 269
SIMD-Oriented Fast Mersenne Twister: a 128-bit Pseudorandom Number Generator
Saito, M., & Matsumoto, M. (2008) · Monte Carlo and Quasi-Monte Carlo Methods 2006 · doi:10.1007/978-3-540-74496-2_36 · Cited by 257
Uniform Random Numbers: Theory and Practice
Tezuka, S. (1995) · Cited by 247
Fishman, G. S., & Moore, III (1986) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0907002 · Cited by 205
Matsumoto, M., & Kurita, Y. (1992) · ACM Transactions on Modeling and Computer Simulation · doi:10.1145/146382.146383 · Cited by 171
Algorithm 823: Implementing scrambled digital sequences
Hong, H. S., & Hickernell, F. J. (2003) · ACM Transactions on Mathematical Software · doi:10.1145/779359.779360 · Cited by 144
Quasi-Monte Carlo methods with applications in finance
L’Ecuyer, P. (2009) · Finance and Stochastics · doi:10.1007/s00780-009-0095-y · Cited by 138
Marsaglia, G. (2003) · Journal of Modern Applied Statistical Methods · doi:10.22237/jmasm/1051747320 · Cited by 127
Extensible Lattice Sequences for Quasi-Monte Carlo Quadrature
Hickernell, F. J., Hong, H. S., L’Ecuyer, P., & Lemieux, C. (2000) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827599356638 · Cited by 124
Software for uniform random number generation: distinguishing the good and the bad
L’Ecuyer, P. (2001) · doi:10.5555/564124.564139 · Cited by 96
New Developments in Uniform Pseudorandom Number and Vector Generation
Niederreiter, H. (1995) · Lecture notes in statistics · doi:10.1007/978-1-4612-2552-2_5 · Cited by 90
Recent trends in random number and random vector generation
Niederreiter, H. (1991) · Annals of Operations Research · doi:10.1007/bf02204856 · Cited by 82
L’Ecuyer, P., & Couture, R. (1997) · INFORMS journal on computing · doi:10.1287/ijoc.9.2.206 · Cited by 79
Construction algorithms for polynomial lattice rules for multivariate integration
Dick, J., Kuo, F. Y., Pillichshammer, F., & Sloan, I. H. (2005) · Mathematics of Computation · doi:10.1090/s0025-5718-05-01742-4 · Cited by 68
On the performance of birthday spacings tests with certain families of random number generators
L’Ecuyer, P., & Simard, R. (2001) · Mathematics and Computers in Simulation · doi:10.1016/s0378-4754(00)00253-6 · Cited by 56
Structural properties for two classes of combined random number generators
L’Ecuyer, P., & Tezuka, S. (1991) · Mathematics of Computation · doi:10.1090/s0025-5718-1991-1094954-3 · Cited by 52
On the Assessment of Random and Quasi-Random Point Sets
Hellekalek, P. (1998) · Lecture notes in statistics · doi:10.1007/978-1-4612-1702-2_2 · Cited by 51
Sparse serial tests of uniformity for random number generators
L'Ecuyer, P., Simard, R., & Wegenkittl, S. (2002) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827598349033 · Cited by 50
Close-Point Spatial Tests and Their Application to Random Number Generators
L'Écuyer, P., Cordeau, J.-F., & Simard, R. (2000) · Operations Research · doi:10.1287/opre.48.2.308.12385 · Cited by 38
F2-Linear Random Number Generators
L’Ecuyer, P., & Panneton, F. (2009) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/b110059_9 · Cited by 32
Criteria for the assessment of random number generators
Afflerbach, L. (1990) · Journal of Computational and Applied Mathematics · doi:10.1016/0377-0427(90)90330-3 · Cited by 21
Cited by
Computer Simulation of Liquids
Allen, M. P., & Tildesley, D. J. (2017) · doi:10.1093/oso/9780198803195.001.0001 · Cited by 20,945
Why the Monte Carlo method is so important today
Kroese, D. P., Brereton, T., Taimre, T., & Botev, Z. I. (2014) · WIREs Computational Statistics · doi:10.1002/wics.1314 · Cited by 757
Self-citationYondo, R., Andrés, E., & Valero, E. (2018) · Progress in Aerospace Sciences · doi:10.1016/j.paerosci.2017.11.003 · Cited by 311
A Comparative Study of Multiple-Criteria Decision-Making Methods under Stochastic Inputs
Kolios, A., Mytilinou, V., Lozano-Minguez, E., & Salonitis, K. (2016) · Energies · doi:10.3390/en9070566 · Cited by 291
A Systematization of the Unscented Kalman Filter Theory
Menegaz, H. M. T., Ishihara, J. Y., Borges, G. A., & Vargas, A. N. (2015) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2404511 · Cited by 278
Metadata
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.