Quasi-random points keep their distance

I.M. Sobol and B.V. Shukhman

Mathematics and Computers in Simulation (MATCOM), 2007, vol. 75, issue 3, 80-86

Abstract: In contrast to random points that may cluster, quasi-random points keep their distance. These distances are investigated.1.If N independent random points in the n-dimensional unit hypercube are selected, two of these points may be arbitrarily close. However, if Q0, Q1, …, QN−1, are quasi-random points, the minimum distance between pairs of these points, dN, has a positive lower bound. For the Sobol sequence dN≥1/2nN−1. Numerical experiments suggest that for large N(1)dN≍N−1/n.2.For certain search algorithms, it is important to know points Qi and Qi+1 that are not close. For the Sobol sequence, the distancesρ(Q2k,Q2k+1)=12n,and14n≤ρ(Q4k+1,Q4k+2)≤145n+c,where c=0 for even n and c=4 for odd n.3.Numerical estimations of dN for the Halton and Faure sequences were carried out. It is likely that for these sequences, (1) is true also.

Keywords: Monte Carlo method; Quasi-Monte Carlo method; Numerical mathematics (search for similar items in EconPapers)
Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475406002382
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:75:y:2007:i:3:p:80-86

DOI: 10.1016/j.matcom.2006.09.004

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().