Papers
Topics
Authors
Recent
Search
2000 character limit reached

The sharp form of the Kolmogorov--Rogozin inequality and a conjecture of Leader--Radcliffe

Published 24 Jan 2022 in math.PR and math.CO | (2201.09861v1)

Abstract: Let $X$ be a random variable and define its concentration function by $$\mathcal{Q}{h}(X)=\sup{x\in \mathbb{R}}\mathbb{P}(X\in (x,x+h]).$$ For a sum $S_n=X_1+\cdots+X_n$ of independent real-valued random variables the Kolmogorov-Rogozin inequality states that $$\mathcal{Q}{h}(S_n)\leq C\left(\sum{i=1}{n}(1-\mathcal{Q}_{h}(X_i))\right){-\frac{1}{2}}.$$ In this paper we give an optimal bound for $\mathcal{Q}{h}(S_n)$ in terms of $\mathcal{Q}{h}(X_i)$, which settles a question posed by Leader and Radcliffe in 1994. Moreover, we show that the extremal distributions are mixtures of two uniform distributions each lying on an arithmetic progression.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.