Managing Editor: Sabelfeld, Karl K.
Editorial Board Member: Binder, Kurt / Bouleau, Nicolas / Chorin, Alexandre J. / Dimov, Ivan / Dubus, Alain / Egorov, Alexander D. / Ermakov, Sergei M. / Halton, John H. / Heinrich, Stefan / Kalos, Malvin H. / Lepingle, D. / Makarov, Roman / Mascagni, Michael / Mathe, Peter / Niederreiter, Harald / Platen, Eckhard / Sawford, Brian R. / Schmid, Wolfgang Ch. / Schoenmakers, John / Simonov, Nikolai A. / Sobol, Ilya M. / Spanier, Jerry / Talay, Denis
4 Issues per year
Mathematical Citation Quotient 2011: 0.06
Volume 19 (2013)
Volume 18 (2012)
Volume 17 (2011)
Volume 16 (2010)
Volume 15 (2009)
Volume 14 (2008)
Volume 13 (2008)
Volume 12 (2006)
Volume 11 (2005)
Volume 10 (2004)
Volume 9 (2003)
Volume 8 (2002)
Volume 6 (2000)
Volume 5 (1999)
Volume 4 (1998)
Volume 3 (1997)
Volume 2 (1996)
Most Downloaded Articles
- Simulation of binary random fields with Gaussian numerical models by Prigarin, Sergei M./ Martin, Andreas and Winkler, Gerhard
- On convergence of semi-statistical and projection-statistical methods for integral equations by Ivanov, Vladimir M. and Korenevski, Maxim L.
- A Green's function Monte Carlo algorithm for the Helmholtz equation subject to Neumann and mixed boundary conditions: Validation with an 1D benchmark problem by Chatterjee, Kausik and Anantapadmanabhan, Akshay
- The generalized van der Corput sequence and its application to numerical integration by Fujita, Takahiko/ Ito, Shunji and Ninomiya, Syoiti
An outline of quasi-probability: Why quasi-Monte-Carlo methods are statistically valid and how their errors can be estimated statistically
All proofs and references have been omitted from this outline, for the sake of brevity. All such details will be included in a much longer, complete paper, to be published soon.
1The University of North Carolina at Chapel Hill, Computer Science Department, Sitterson Hall, CB 3175, Chapel Hill, NC 27516, USA. Voice: 919-962-1752, 919-942-4856. Fax: 919-942-6616. e-Mail: email@example.com, firstname.lastname@example.org.
Citation Information: Monte Carlo Methods and Applications mcma. Volume 10, Issue 3-4, Pages 183–196, ISSN (Online) 1569-3961, ISSN (Print) 0929-9629, DOI: 10.1515/mcma.2004.10.3-4.183, May 2008
- Published Online:
The classical model of probability theory, due principally to Kolmogorov, defines probability as a totally-one measure on a sigma-algebra of subsets (events) of a given set (the sample space), and random variables as real-valued functions on the sample space, such that the inverse images of all Borel sets are events. From this model, all the results of probability theory are derived. However, the assertion that any given concrete situation is subject to probability theory is a scientific hypothesis verifiable only experimentally, by appropriate sampling, and never totally certain. Furthermore classical probability theory allows for the possibility of “outliers”—sampled values which are misleading. In particular, Kolmogorov's Strong Law of Large Numbers asserts that, if, as is usually the case, a random variable has a finite expectation (its integral over the sample space), then the average value of N independently sampled values of this function converges to the expectation with probability 1 as N tends to infinity. This implies that there may be sample sequences (belonging to a set of total probability 0) for which this convergence does not occur.
It is proposed to derive a large and important part of the classical probabilistic results, on the simple basis that the sample sequences are so constructed that the corresponding average values do converge to the mathematical expectation as N tends to infinity, for all Riemann-integrable random variables. A number of important results have already been proved, and further investigations are proceeding with much promise. By this device, the stochastic nature of some concrete situations is no longer a likely scientific hypothesis, but a proven mathematical fact, and the problem of outliers is eliminated. This model may be referred-to as “quasi-probability theory”; it is particularly appropriate for the large class of computations that are referred-to as “quasi-Monte-Carlo”.