Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 89 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 29 tok/s Pro
GPT-5 High 31 tok/s Pro
GPT-4o 98 tok/s Pro
GPT OSS 120B 424 tok/s Pro
Kimi K2 164 tok/s Pro
2000 character limit reached

The sharp form of the Kolmogorov--Rogozin inequality and a conjecture of Leader--Radcliffe (2201.09861v1)

Published 24 Jan 2022 in math.PR and math.CO

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.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

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

Authors (1)