Discrepancy via Gaussian random walks
Kent Quanrud · 74:09
A lecture on combinatorial discrepancy: randomly coloring *n* points so every one of *m* sets is nearly balanced. Naive random coloring plus a union bound only gives about \(\sqrt{n\log n}\) (or \(\sqrt{n\log m}\)); S...