Geometric discrepancy. An illustrated guide
From MaRDI portal
Publication:5902169
DOI10.1007/978-3-642-03942-3zbMath1197.11092OpenAlexW4249137521MaRDI QIDQ5902169
Publication date: 29 October 2009
Published in: Algorithms and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03942-3
Monte Carlo methods (65C05) Numerical integration (65D30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Irregularities of distribution, discrepancy (11K38) Extremal combinatorics (05D99)
Related Items (45)
Separability of imprecise points ⋮ A simple proof of the shallow packing lemma ⋮ A characterization theorem for the \(L^{2}\)-discrepancy of integer points in dilated polygons ⋮ Approximation-Friendly Discrepancy Rounding ⋮ Uniform approximation rates and metric entropy of shallow neural networks ⋮ Probabilistic Star Discrepancy Bounds for Double Infinite Random Matrices ⋮ A sharp discrepancy bound for jittered sampling ⋮ Distance bounds for high dimensional consistent digital rays and 2-D partially-consistent digital rays ⋮ Quantum discrepancy: a non-commutative version of combinatorial discrepancy ⋮ Construction of scrambled polynomial lattice rules over \(\mathbb{F}_{2}\) with small mean square weighted \(\mathcal{L}_{2}\) discrepancy ⋮ Lower bounds for the directional discrepancy with respect to an interval of rotations ⋮ Near-optimal coresets of kernel density estimates ⋮ Irregularities of distribution for bounded sets and half‐spaces ⋮ Extremal problems in hypergraph colourings ⋮ Cyclic polytope of the simplest cubic fields ⋮ DISCREPANCY OF SECOND ORDER DIGITAL SEQUENCES IN FUNCTION SPACES WITH DOMINATING MIXED SMOOTHNESS ⋮ TIGHTER BOUNDS FOR THE DISCREPANCY OF BOXES AND POLYTOPES ⋮ An Improvement of the Beck–Fiala Theorem ⋮ One-bit sensing, discrepancy and Stolarsky's principle ⋮ Toric algebra of hypergraphs ⋮ Helly’s theorem: New variations and applications ⋮ Discrepancy and numerical integration on metric measure spaces ⋮ Weighted geometric discrepancies and numerical integration on reproducing kernel Hilbert spaces ⋮ Piercing random boxes ⋮ Learning Complexity vs Communication Complexity ⋮ On negative dependence properties of Latin hypercube samples and scrambled nets ⋮ Discrepancy bounds for a class of negatively dependent random points including Latin hypercube samples ⋮ The determinant bound for discrepancy is almost tight ⋮ Mathematics of Analog‐to‐Digital Conversion ⋮ Local antithetic sampling with scrambled nets ⋮ The convexification effect of Minkowski summation ⋮ A lower bound for the discrepancy of a random point set ⋮ Deterministic discrepancy minimization ⋮ Semidefinite optimization in discrepancy theory ⋮ Low-discrepancy sequences for piecewise smooth functions on the two-dimensional torus ⋮ Unnamed Item ⋮ Integral norm discretization and related problems ⋮ Introducing Quasirandomness to Computer Science ⋮ Exponential Squared Integrability of the Discrepancy Function in Two Dimensions ⋮ Irregularities of distribution and geometry of planar convex sets ⋮ Subsampling in Smoothed Range Spaces ⋮ Upper and lower bounds for matrix discrepancy ⋮ Algorithmic Aspects of Combinatorial Discrepancy ⋮ Calculation of Discrepancy Measures and Applications ⋮ The Complexity of Differential Privacy
This page was built for publication: Geometric discrepancy. An illustrated guide
