An Estimate for Concentration Functions
From MaRDI portal
Cited in
(19)- On the rate of decay of concentration functions of \(n\)-fold convolutions of probability distributions
- Broadcasting on random recursive trees
- On Hipp's compound Poisson approximations via concentration functions
- Non-abelian Littlewood-Offord inequalities
- Inverse Littlewood-Offord problems and the singularity of random symmetric matrices
- A sharp uniform bound for the distribution of sums of Bernoulli trials
- On the Kolmogorov-Rogozin inequality for the concentration function
- On the concentration function of a sum of independent random variables
- Root estimation in Galton–Watson trees
- On Poisson approximation
- Uniqueness of maximum scores in countable-outcome round-robin tournaments
- On the accuracy of infinitely divisible approximation of n-fold convolutions of probability distributions
- Irreducibility of random polynomials of \(\mathbb{Z}[X]\)
- Fluctuations of partition functions of directed polymers in weak disorder beyond the L^2-phase
- LU Factorization of Discrete Random Matrices
- Methods of Poisson approximation
- An expansion in the exponent for compound binomial approximations
- On Bernoulli decompositions for random variables, concentration bounds, and spectral localization
- Optimal query complexity bounds for finding graphs
This page was built for publication: An Estimate for Concentration Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3292881)
