# Littlewood-Offord Inequalities for Random Variables

@article{Leader1994LittlewoodOffordIF, title={Littlewood-Offord Inequalities for Random Variables}, author={Imre Leader and A. J. Radcliffe}, journal={SIAM J. Discrete Math.}, year={1994}, volume={7}, pages={90-101} }

The concentration of a real-valued random variable $X$ is
$$ c(X)=\sup_{t \in {\Bbb R}} {\bf P} (t < X < t+1). $$
Given bounds on the concentrations of n independent random variables, how large can the concentration of their sum be?
The main aim of this paper is to give a best possible upper bound for the concentration of the sum of $n$ independent random variables, each of concentration at most $1/k$, where $k$ is an integer. Other bounds on the concentration are also discussed, as well as… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-3 OF 3 CITATIONS

## Improved bandwidth approximation for trees

VIEW 4 EXCERPTS

CITES METHODS

HIGHLY INFLUENCED

## On Littlewood-Offord theory for arbitrary distributions

VIEW 3 EXCERPTS

CITES RESULTS

#### References

##### Publications referenced by this paper.

SHOWING 1-2 OF 2 REFERENCES