The distribution of the discrepancy of scrambled digital (t, m, s)-nets

Hee Sun Hong*, Fred J. Hickernell, Gang Wei

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

4 Citations (Scopus)

Abstract

Owen proposed a method of scrambling (t, m, s)-nets to eliminate statistical bias while retaining the low discrepancy property. Recently a central limit theorem has been proved for scrambled net quadrature. This article compares the empirical distribution of the square discrepancy of scrambled digital (t, m, s)-nets with the theoretical asymptotic distribution suggested by the central limit theorem. Furthermore this article discusses the variance and the empirical distribution of the square discrepancy of Owen's scrambling and a variant, linear scrambling.

Original languageEnglish
Pages (from-to)335-345
Number of pages11
JournalMathematics and Computers in Simulation
Volume62
Issue number3-6
DOIs
Publication statusPublished - 3 Mar 2003
Event3rd IMACS Seminar on Monte Carlo Methods - Salzburg, Austria
Duration: 10 Sept 200114 Sept 2001
http://mcm2001.sbg.ac.at/

Scopus Subject Areas

  • Theoretical Computer Science
  • Computer Science(all)
  • Numerical Analysis
  • Modelling and Simulation
  • Applied Mathematics

User-Defined Keywords

  • (t, s)-Sequences
  • Asymptotically normal
  • Chi-square
  • Empirical distribution

Fingerprint

Dive into the research topics of 'The distribution of the discrepancy of scrambled digital (t, m, s)-nets'. Together they form a unique fingerprint.

Cite this