Anticoncentration of random vectors via the strong perfect graph theorem
Abstract
In this paper we give anticoncentration bounds for sums of independent random vectors in finite-dimensional vector spaces. In particular, we asymptotically establish a conjecture of Leader and Radcliffe (1994) and a question of Jones (1978). The highlight of this work is an application of the strong perfect graph theorem by Chudnovsky, Robertson, Seymour and Thomas (2003) in the context of anticoncentration.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.