Anticoncentration of random vectors via the strong perfect graph theorem
Probability
2023-08-15 v3 Combinatorics
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.
Keywords
Cite
@article{arxiv.2306.11904,
title = {Anticoncentration of random vectors via the strong perfect graph theorem},
author = {Tomas Juškevičius and Valentas Kurauskas},
journal= {arXiv preprint arXiv:2306.11904},
year = {2023}
}
Comments
34 pages