Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
The mean square discrepancy of randomized nets
Hickernell F. ACM Transactions on Modeling and Computer Simulation6 (4):274-296,1996.Type:Article
Date Reviewed: Aug 1 1997

Multidimensional integrals over the S-dimensional unit cube can be approximated by the sample mean of the integral evaluated on a point set, P, with N points. The quadrature error depends in part on how uniformly the points in P are distributed on the unit cube. A good set P for quadrature is one that has a small discrepancy, D ( P ), where discrepancy is defined as a measure of the spread of the points in P.

Several deterministic sets have been found that have smaller discrepancies than simple random points. These sets are often called quasi-random points. Much effort has been directed towards finding quasi-random sequences that have asymptotically small -star discrepancies as N tends to infinity. The ( t , m , s )-nets are one example. Calculating the -star discrepancy of a particular set is impractical because it requires O ( N 5 ) operations. By comparison, the 2-star discrepancy is easier to compute, requiring only O ( N 2 ) operations using a naive algorithm, or O ( N log5 N ) operations using a more sophisticated algorithm.

Recently, a randomization of ( t , m , s )-nets was proposed that preserves their net properties. The aim is to obtain probabilistic quadrature error estimates in a similar manner as one would for simple Monte Carlo quadrature. In this paper, a formula for the mean square 2-discrepancy of randomized ( 0 , m , s )-nets is derived that requires only O ( s log N + s2 ) mathematical operations as N, s, or both tend to infinity. The 2-discrepancy for these randomized nets is shown to decay like O ( N - 1 ( log N )( s - 1 )&slash; 2 ) for large N, the same asymptotic order as the known lower bound for the 2-discrepancy of an arbitrary set.

--From the Introduction

The paper consists primarily of mathematical derivations of the expected value of the square of the discrepancy, under various assumptions, as well as asymptotic derivations. The paper is highly mathematical and is readable only by mathematicians with a background in probability theory. It is well structured and, for those readers, should not be difficult to follow.

The results should be applicable by people working in the fields of numerical quadrature and differentiation and Monte Carlo simulation, even if they cannot follow the derivations.

Reviewer:  M. Snyder Review #: CR120749 (9708-0610)
Bookmark and Share
 
Monte Carlo (I.6.8 ... )
 
 
Error Analysis (G.1.4 ... )
 
 
Probabilistic Algorithms (Including Monte Carlo) (G.3 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Monte Carlo": Date
Random processes in physical systems: an introduction to probability-based computer simulations
Whitney C., John Wiley & Sons, Inc., New York, NY, 1990. Type: Book (9780471517924)
May 1 1991
Nearly optimal importance sampling for Monte Carlo simulation of loss systems
Lassila P., Virtamo J. ACM Transactions on Modeling and Computer Simulation 10(4): 326-347, 2000. Type: Article
Jul 1 2001
Towards a polynomial-time randomized algorithm for closed product-form networks
Chen W., O’Cinneide C. ACM Transactions on Modeling and Computer Simulation 8(3): 227-253, 1998. Type: Article
Jun 1 1999
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy