An asymptotically optimal bound for the concentration function of a sum of independent integer random variables
Valentas Kurauskas

TL;DR
This paper proves an asymptotic bound for the maximum point probability of sums of independent integer random variables, confirming a conjecture about minimal concentration under variance constraints, with implications for Hilbert space-valued variables.
Contribution
It establishes an asymptotic version of Juškevičius's conjecture, showing the minimal concentration bound holds when the sum's variance is sufficiently large.
Findings
Proves the conjecture asymptotically for large variance sums.
Extends the result to Hilbert space-valued random variables.
Uses advanced probabilistic and combinatorial tools like inverse Littlewood–Offord theorems.
Abstract
For a random variable define . Let be independent integer random variables. Suppose for each . Ju\v{s}kevi\v{c}ius (2023) conjectured that where are independent and is a random integer variable with that has the smallest variance, i.e. the distribution of has probabilities or probabilities on some interval of integers, where . We prove this conjecture asymptotically: i.e., we show that for each there is such that if then . This implies an analogous asymptotically…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsProbability and Risk Models · Random Matrices and Applications · Risk and Portfolio Optimization
