Practical Guide to Monte Carlo
| dc.creator | Jadach, S. | |
| dc.date | 1999-06-29 | |
| dc.date.accessioned | 2026-07-07T05:57:05Z | |
| dc.date.available | 2026-07-07T05:57:05Z | |
| dc.description | I show how to construct Monte Carlo algorithms (programs), prove that they are correct and document them. Complicated algorithms are build using a handful of elementary methods. This construction process is transparently illustrated using graphical representation in which complicated graphs consist of only several elementary building blocks. In particular I discuss the equivalent algorithms, that is different MC algorithms, with different arrangements of the elementary building blocks, which generate the same final probability distribution. I also show how to transform a given MC algorithm into another equivalent one and discuss advantages of the various ``architectures''. | |
| dc.identifier | https://arxiv.org/abs/physics/9906056 | |
| dc.identifier | http://arxiv.org/abs/physics/9906056 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/87854 | |
| dc.subject | Computational Physics | |
| dc.subject | Astrophysics | |
| dc.subject | High Energy Physics - Phenomenology | |
| dc.subject | Data Analysis, Statistics and Probability | |
| dc.title | Practical Guide to Monte Carlo | |
| dc.type | text |