Skip to:Content
|
Bottom
Cover image for Markov chain Monte Carlo simulations and their statistical analysis : with web-based Fortran code
Title:
Markov chain Monte Carlo simulations and their statistical analysis : with web-based Fortran code
Personal Author:
Publication Information:
Singapore : World Scientific, 2004
ISBN:
9789812389350

Available:*

Library
Item Barcode
Call Number
Material Type
Item Category 1
Status
Searching...
30000010082249 QC174.85.M64 B47 2004 Open Access Book Book
Searching...

On Order

Summary

Summary

This book teaches modern Markov chain Monte Carlo (MC) simulation techniques step by step. The material should be accessible to advanced undergraduate students and is suitable for a course. It ranges from elementary statistics concepts (the theory behind MC simulations), through conventional Metropolis and heat bath algorithms, autocorrelations and the analysis of the performance of MC algorithms, to advanced topics including the multicanonical approach, cluster algorithms and parallel computing. Therefore, it is also of interest to researchers in the field. The book relates the theory directly to Web-based computer code. This allows readers to get quickly started with their own simulations and to verify many numerical examples easily. The present code is in Fortran 77, for which compilers are freely available. The principles taught are important for users of other programming languages, like C or C++.


Table of Contents

Prefacep. vii
1 Sampling, Statistics and Computer Codep. 1
1.1 Probability Distributions and Samplingp. 1
1.1.1 Assignments for section 1.1p. 5
1.2 Random Numbersp. 6
1.2.1 Assignments for section 1.2p. 12
1.3 About the Fortran Codep. 13
1.3.1 CPU time measurements under Linuxp. 22
1.4 Gaussian Distributionp. 23
1.4.1 Assignments for section 1.4p. 25
1.5 Confidence Intervalsp. 26
1.5.1 Assignment for section 1.5p. 30
1.6 Order Statistics and HeapSortp. 30
1.6.1 Assignments for section 1.6p. 34
1.7 Functions and Expectation Valuesp. 35
1.7.1 Moments and Tchebychev's inequalityp. 36
1.7.2 The sum of two independent random variablesp. 40
1.7.3 Characteristic functions and sums of N independent random variablesp. 41
1.7.4 Linear transformations, error propagation and covariancep. 43
1.7.5 Assignments for section 1.7p. 46
1.8 Sample Mean and the Central Limit Theoremp. 47
1.8.1 Probability density of the sample meanp. 47
1.8.2 The central limit theoremp. 50
1.8.2.1 Counter examplep. 51
1.8.3 Binningp. 52
1.8.4 Assignments for section 1.8p. 53
2 Error Analysis for Independent Random Variablesp. 54
2.1 Gaussian Confidence Intervals and Error Barsp. 54
2.1.1 Estimator of the variance and biasp. 56
2.1.2 Statistical error bar routines (steb)p. 57
2.1.2.1 Ratio of two means with error barsp. 60
2.1.3 Gaussian difference testp. 60
2.1.3.1 Combining more than two data pointsp. 62
2.1.4 Assignments for section 2.1p. 64
2.2 The X[superscript 2] Distributionp. 66
2.2.1 Sample variance distributionp. 67
2.2.2 The X[superscript 2] distribution function and probability densityp. 70
2.2.3 Assignments for section 2.2p. 72
2.3 Gosset's Student Distributionp. 73
2.3.1 Student difference testp. 77
2.3.2 Assignments for section 2.3p. 81
2.4 The Error of the Error Barp. 81
2.4.1 Assignments for section 2.4p. 84
2.5 Variance Ratio Test (F-test)p. 85
2.5.1 F ratio confidence limitsp. 88
2.5.2 Assignments for section 2.5p. 89
2.6 When are Distributions Consistent?p. 89
2.6.1 X[superscript 2] Testp. 89
2.6.2 The one-sided Kolmogorov testp. 92
2.6.3 The two-sided Kolmogorov testp. 98
2.6.4 Assignments for section 2.6p. 101
2.7 The Jackknife Approachp. 103
2.7.1 Bias corrected estimatorsp. 106
2.7.2 Assignments for section 2.7p. 108
2.8 Determination of Parameters (Fitting)p. 109
2.8.1 Linear regressionp. 111
2.8.1.1 Confidence limits of the regression linep. 114
2.8.1.2 Related functional formsp. 115
2.8.1.3 Examplesp. 117
2.8.2 Levenberg-Marquardt fittingp. 121
2.8.2.1 Examplesp. 125
2.8.3 Assignments for section 2.8p. 127
3 Markov Chain Monte Carlop. 128
3.1 Preliminaries and the Two-Dimensional Ising Modelp. 129
3.1.1 Lattice labelingp. 133
3.1.2 Sampling and Re-weightingp. 138
3.1.2.1 Important configurations and re-weighting rangep. 141
3.1.3 Assignments for section 3.1p. 142
3.2 Importance Samplingp. 142
3.2.1 The Metropolis algorithmp. 147
3.2.2 The O(3) [sigma]-model and the heat bath algorithmp. 148
3.2.3 Assignments for section 3.2p. 152
3.3 Potts Model Monte Carlo Simulationsp. 152
3.3.1 The Metropolis codep. 156
3.3.1.1 Initializationp. 158
3.3.1.2 Updating routinesp. 160
3.3.1.3 Start and equilibrationp. 163
3.3.1.4 More updating routinesp. 164
3.3.2 Heat bath codep. 165
3.3.3 Timing and time series comparison of the routinesp. 168
3.3.4 Energy references, data production and analysis codep. 169
3.3.4.1 2d Ising modelp. 171
3.3.4.2 Data analysisp. 173
3.3.4.3 2d 4-state and 10-state Potts modelsp. 174
3.3.4.4 3d Ising modelp. 177
3.3.4.5 3d 3-state Potts modelp. 177
3.3.4.6 4d Ising model with non-zero magnetic fieldp. 178
3.3.5 Assignments for section 3.3p. 179
3.4 Continuous Systemsp. 181
3.4.1 Simple Metropolis code for the O(n) spin modelsp. 182
3.4.2 Metropolis code for the XY modelp. 186
3.4.2.1 Timing, discretization and rounding errorsp. 187
3.4.2.2 Acceptance ratep. 189
3.4.3 Heat bath code for the O(3) modelp. 192
3.4.3.1 Rounding errorsp. 194
3.4.4 Assignments for section 3.4p. 194
4 Error Analysis for Markov Chain Datap. 196
4.1 Autocorrelationsp. 197
4.1.1 Integrated autocorrelation time and binningp. 202
4.1.2 Illustration: Metropolis generation of normally distributed datap. 205
4.1.2.1 Autocorrelation functionp. 205
4.1.2.2 Integrated autocorrelation timep. 207
4.1.2.3 Corrections to the confidence intervals of the binning procedurep. 210
4.1.3 Self-consistent versus reasonable error analysisp. 211
4.1.4 Assignments for section 4.1p. 213
4.2 Analysis of Statistical Physics Datap. 214
4.2.1 The d = 2 Ising model off and on the critical pointp. 214
4.2.2 Comparison of Markov chain MC algorithmsp. 218
4.2.2.1 Random versus sequential updatingp. 218
4.2.2.2 Tuning the Metropolis acceptance ratep. 219
4.2.2.3 Metropolis versus heat bath: 2d q = 10 Pottsp. 221
4.2.2.4 Metropolis versus heat bath: 3d Isingp. 222
4.2.2.5 Metropolis versus heat bath: 2d O(3) [sigma] modelp. 223
4.2.3 Small fluctuationsp. 224
4.2.4 Assignments for section 4.2p. 227
4.3 Fitting of Markov Chain Monte Carlo Datap. 229
4.3.1 One exponential autocorrelation timep. 230
4.3.2 More than one exponential autocorrelation timep. 233
4.3.3 Assignments for section 4.3p. 235
5 Advanced Monte Carlop. 236
5.1 Multicanonical Simulationsp. 236
5.1.1 Recursion for the weightsp. 239
5.1.2 Fortran implementationp. 244
5.1.3 Example runsp. 247
5.1.4 Performancep. 250
5.1.5 Re-weighting to the canonical ensemblep. 251
5.1.6 Energy and specific heat calculationp. 254
5.1.7 Free energy and entropy calculationp. 261
5.1.8 Time series analysisp. 264
5.1.9 Assignments for section 5.1p. 267
5.2 Event Driven Simulationsp. 268
5.2.1 Computer implementationp. 270
5.2.2 MC runs with the EDS codep. 276
5.2.3 Assignments for section 5.2p. 278
5.3 Cluster Algorithmsp. 279
5.3.1 Autocorrelation timesp. 284
5.3.2 Assignments for section 5.3p. 286
5.4 Large Scale Simulationsp. 287
5.4.1 Assignments for section 5.4p. 289
6 Parallel Computingp. 292
6.1 Trivially Parallel Computingp. 292
6.2 Message Passing Interface (MPI)p. 294
6.3 Parallel Temperingp. 303
6.3.1 Computer implementationp. 305
6.3.2 Illustration for the 2d 10-state Potts modelp. 310
6.3.3 Gaussian Multiple Markov chainsp. 315
6.3.4 Assignments for section 6.3p. 316
6.4 Checkerboard algorithmsp. 316
6.4.1 Assignment for section 6.4p. 318
7 Conclusions, History and Outlookp. 319
Appendix A Computational Supplementsp. 326
A.1 Calculation of Special Functionsp. 326
A.2 Linear Algebraic Equationsp. 328
Appendix B More Exercises and some Solutionsp. 331
B.1 Exercisesp. 331
B.2 Solutionsp. 333
Appendix C More Fortran Routinesp. 338
Bibliographyp. 339
Indexp. 349
Go to:Top of Page