Number of the records: 1
Anticoncentration of random vectors via the strong perfect graph theorem
- 1.
SYSNO ASEP 0580826 Document Type V - Research Report R&D Document Type The record was not marked in the RIV Title Anticoncentration of random vectors via the strong perfect graph theorem Author(s) Juškevičius, Tomas (UIVT-O) SAI
Kurauskas, V. (LT)Issue data Cornell University: Cornell University, 2023 Series arXiv.org e-Print archive Series number arXiv:2306.11904 Number of pages 34 s. Publication form Online - E Language eng - English Keywords concentration function ; Littlewood-Offord problem ; perfect graph R&D Projects GJ20-27757Y GA ČR - Czech Science Foundation (CSF) Institutional support UIVT-O - RVO:67985807 DOI 10.48550/arXiv.2306.11904 Annotation 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. Workplace Institute of Computer Science Contact Tereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800 Year of Publishing 2024 Electronic address https://arxiv.org/abs/2306.11904
Number of the records: 1