Anticoncentration of Random Vectors via the Strong Perfect Graph Theorem

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F25%3A00604107" target="_blank" >RIV/67985807:_____/25:00604107 - isvavai.cz</a>

Result on the web

<a href="https://doi.org/10.1007/s00493-024-00124-0" target="_blank" >https://doi.org/10.1007/s00493-024-00124-0</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/s00493-024-00124-0" target="_blank" >10.1007/s00493-024-00124-0</a>

Result language

angličtina

Original language name

Anticoncentration of Random Vectors via the Strong Perfect Graph Theorem

Original language description

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 (SIAM J Discrete Math 7:90–101, 1994) and a question of Jones (SIAM J Appl Math 34:1–6, 1978). The highlight of this work is an application of the strong perfect graph theorem by Chudnovsky et al. (Ann Math 164:51–229, 2006) in the context of anticoncentration.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10101 - Pure mathematics

Project

<a href="/en/project/GJ20-27757Y" target="_blank" >GJ20-27757Y: Random discrete structures</a><br>

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2025

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Combinatorica

ISSN

0209-9683

e-ISSN

1439-6912

Volume of the periodical

45

Issue of the periodical within the volume

1

Country of publishing house

DE - GERMANY

Number of pages

36

Pages from-to

1

UT code for WoS article

001379054500001

EID of the result in the Scopus database

2-s2.0-85212416730