An Upper Bound of the Minimal Dispersion via Delta Covers

Daniel Rudolf ()
Additional contact information
Daniel Rudolf: University of Goettingen, Institut für Mathematische Stochastik

A chapter in Contemporary Computational Mathematics - A Celebration of the 80th Birthday of Ian Sloan, 2018, pp 1099-1108 from Springer

Abstract: Abstract For a point set of n elements in the d-dimensional unit cube and a class of test sets we are interested in the largest volume of a test set which does not contain any point. For all natural numbers n, d and under the assumption of the existence of a δ-cover with cardinality |Γ δ| we prove that there is a point set, such that the largest volume of such a test set without any point is bounded above by log | Γ δ | n + δ $$\frac {\log \vert \varGamma _\delta \vert }{n} + \delta $$ . For axis-parallel boxes on the unit cube this leads to a volume of at most 4 d n log ( 9 n d ) $$\frac {4d}{n}\log (\frac {9n}{d})$$ and on the torus to 4 d n log ( 2 n ) $$\frac {4d}{n}\log (2n)$$ .

Date: 2018
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:spr:sprchp:978-3-319-72456-0_50

Ordering information: This item can be ordered from
http://www.springer.com/9783319724560

DOI: 10.1007/978-3-319-72456-0_50

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().