Uses and abuses of statistical simulation

More and more problems are being tackled by simulation as large computing costs per hour approach those of mathematicians' time. Abuses of simulation arise from ignorance or careless use of little understood procedures, and some of the fundamental tools of the subject are much less well understood than commonly supposed. This is illustrated here by the saga of pseudorandom number generators, normal variate generators and the analysis of queueing system simulations. On the positive side, genuinely new uses of simulation are appearing, particularly in statistical inference. These are exemplified by recursive algorithms for simulating complex systems and simulation-based likelihood inference for point processes.

[1]  Peter J. Diggle,et al.  Simple Monte Carlo Tests for Spatial Pattern , 1977 .

[2]  C. S. Smith,et al.  Multiplicative Pseudo-Random Number Generators with Prime Modulus , 1971, JACM.

[3]  Shu Tezuka,et al.  The k-distribution of generalized feedback shift register pseudorandom numbers , 1983, CACM.

[4]  Brian Wichmann,et al.  Building a random-number generator , 1987 .

[5]  E. J. Hannan The Variance of the Mean of a Stationary Process , 1957 .

[6]  J. Besag Statistical Analysis of Non-Lattice Data , 1975 .

[7]  R. R. Coveyou,et al.  Fourier Analysis of Uniform Random Number Generators , 1967, JACM.

[8]  B. Efron,et al.  The Jackknife: The Bootstrap and Other Resampling Plans. , 1983 .

[9]  Sidney Addelman,et al.  trans-Dimethanolbis(1,1,1-trifluoro-5,5-dimethylhexane-2,4-dionato)zinc(II) , 2008, Acta crystallographica. Section E, Structure reports online.

[10]  D. J. Strauss A model for clustering , 1975 .

[11]  Karl-Heinz Jockel,et al.  Finite Sample Properties and Asymptotic Efficiency of Monte Carlo Tests , 1986 .

[12]  Bradley Efron Better Bootstrap Confidence Intervals: Rejoinder , 1987 .

[13]  P. Flinn Monte Carlo calculation of phase separation in a two-dimensional Ising system , 1974 .

[14]  Brian David Ripley,et al.  The lattice structure of pseudo-random number generators , 1983, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[15]  M. Mazumdar,et al.  On Using the Box‐Muller Transformation with Multiplicative Congruential Pseudo‐Random Number Generators , 1975 .

[16]  Henry R. Neave,et al.  On Using the Box‐Müller Transformation with Multiplicative Congruential Pseudo‐Random Number Generators , 1973 .

[17]  Lee W. Schruben,et al.  Pseudorandom Number Assignment in Statistically Designed Simulation and Distribution Sampling Experiments , 1978 .

[18]  P. A. P. Moran,et al.  The estimation of standard errors in Monte Carlo simulation experiments , 1975 .

[19]  Doan T. Modianos,et al.  Testing intrinsic random-number generators , 1987 .

[20]  G. Marsaglia The Structure of Linear Congruential Sequences , 1972 .

[21]  B. Ripley Statistical inference for spatial processes , 1990 .

[22]  B. Efron The jackknife, the bootstrap, and other resampling plans , 1987 .

[23]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[24]  B. Efron Better Bootstrap Confidence Intervals , 1987 .

[25]  G. Marsaglia,et al.  Matrices and the structure of random number sequences , 1985 .

[26]  E. R. Golder,et al.  The Box‐Müller Method for Generating Pseudo‐Random Normal Deviates , 1976 .

[27]  Brian D. Ripley,et al.  Stochastic Simulation , 2005 .

[28]  D. Ruppert,et al.  Optimization Using Stochastic Approximation and Monte Carlo Simulation (with Application to Harvesting of Atlantic Menhaden) , 1984 .

[29]  A. Barker Monte Carlo calculations of the radial distribution functions for a proton-electron plasma , 1965 .

[30]  G. Marsaglia Random numbers fall mainly in the planes. , 1968, Proceedings of the National Academy of Sciences of the United States of America.

[31]  W. Loh,et al.  Calibrating Confidence Coefficients , 1987 .

[32]  E. J. Orav,et al.  An Implementation of Graphical Analysis in Statistical Simulations , 1985 .

[33]  John T. Stasko,et al.  Pairing heaps: experiments and analysis , 1987, CACM.

[34]  I. D. Hill,et al.  An Efficient and Portable Pseudo‐Random Number Generator , 1982 .

[35]  W. A. Beyer,et al.  The lattice structure of multiplicative congruential pseudo-random vectors , 1971 .

[36]  Donald Ervin Knuth,et al.  The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .

[37]  P. Diggle,et al.  Monte Carlo Methods of Inference for Implicit Statistical Models , 1984 .

[38]  G. A. Young,et al.  The bootstrap: To smooth or not to smooth? , 1987 .

[39]  A. A. Crane,et al.  An introduction to the regenerative method for simulation analysis , 1977 .

[40]  Donald L. Iglehart,et al.  Regenerative Simulation of Response Times in Networks of Queues , 1980, J. ACM.

[41]  B. Ripley Modelling Spatial Patterns , 1977 .

[42]  E. M. L. Beale Regression: a bridge between analysis and simulation , 1985 .

[43]  B. Ripley Computer generation of random variables: a tutorial , 1983 .

[44]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.