Local tail bounds for functions of independent random variables
From MaRDI portal
Publication:2468424
DOI10.1214/00911797000000088zbMath1130.60033arXiv0712.1686OpenAlexW2017780170MaRDI QIDQ2468424
Publication date: 22 January 2008
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0712.1686
concentration inequalitiesTalagrand's inequalityhypercontractivityconvex distanceconfiguration functions
Related Items (3)
Biased halfspaces, noise sensitivity, and local Chernoff inequalities ⋮ Proof of Tomaszewski's conjecture on randomly signed sums ⋮ Solving optimal stopping problems via empirical dual optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the value of a random minimum spanning tree problem
- Martingale inequalities and the jackknife estimate of variance
- An Efron-Stein inequality for nonsymmetric statistics
- The jackknife estimate of variance
- The eigenvalues of random symmetric matrices
- Inequalities in Fourier analysis
- On Russo's approximate zero-one law
- Concentration inequalities using the entropy method
- First passage percolation has sublinear distance variance.
- A proof of Parisi's conjecture on the random assignment problem
- Laws of large numbers and tail inequalities for random tries and PATRICIA trees
- Graph products, Fourier analysis and spectral techniques
- On the concentration of eigenvalues of random symmetric matrices
- Concentration of measure and isoperimetric inequalities in product spaces
- A new look at independence
- Étude des coefficients de Fourier des fonctions de \(L^ p(G)\)
- Logarithmic Sobolev inequalities for finite Markov chains
- The ?(2) limit in the random assignment problem
- On Talagrand's deviation inequalities for product measures
- Concentration inequalities for functions of independent variables
- Concentration for self-bounding functions and an inequality of Talagrand
- A sharp concentration inequality with applications
- The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph
- Proofs of the Parisi and Coppersmith‐Sorkin random assignment conjectures
- Discrete orthogonal polynomial ensembles and the Plancherel measure
- On the distributions of the lengths of the longest monotone subsequences in random words
- New concentration inequalities in product spaces
This page was built for publication: Local tail bounds for functions of independent random variables