Gleb Smirnov
Abstract
A random sample typically has star discrepancy of order n^{-1/2}, while carefully constructed point sets can achieve discrepancy nearly n^{-1}. We show that these two regimes are much closer than they appear. For any probability measure, one can move only a small fraction of the points of an iid sample and obtain an n-point set with nearly optimal star discrepancy relative to the original measure. The proof gives an explicit online procedure based on multiscale balancing. This is joint work with Roman Vershynin.
Speaker
Research Area
Computational Mathematics
Affiliation
Australian National University
Date
Tue Sep 29th, 2026 - 2:00 pm.
Venue
Anita B. Lawrence-4082 and online (passcode: 112358)