Skip to main content

Concentration Inequalities

  • Chapter
  • 1828 Accesses

Part of the book series: Springer Series in Statistics ((SSS))

Abstract

Most of the methodology discussed in this book builds on elements of empirical process theory, certain concentration-of-measure inequalities, and simple combinatorial calculations. The aim of this and the following two chapters is to equip the reader with these simple tools. We keep the material at an elementary level, with additional information added in the exercises.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   159.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

§2.7. References

  • R. Ahlswede, P. Gács, and J. Körner, “Bounds on conditional probabilities with applications in multi-user communication,” Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, vol. 34, pp. 157–177, 1976 (correction in vol. 39, pp. 353–354, 1977).

    Article  MATH  Google Scholar 

  • K. Azuma, “Weighted sums of certain dependent random variables,” Tohoku Mathematical Journal, vol. 68, pp. 357–367, 1967.

    Article  MathSciNet  Google Scholar 

  • G. Bennett, “Probability inequalities for the sum of independent random variables,” Journal of the American Statistical Association, vol. 57, pp. 33–45, 1962.

    Article  MATH  Google Scholar 

  • S. N. Bernstein, The Theory of Probabilities, Gastehizdat, Moscow, 1946.

    Google Scholar 

  • S. Boucheron, G. Lugosi, and P. Massart, “A sharp concentration inequality with applications in random combinatorics and learning,” Random Structures and Algorithms, 1999. To appear.

    Google Scholar 

  • H. Chernoff, “A measure of asymptotic efficiency of tests of a hypothesis based on the sum of observations,” Annals of Mathematical Statistics, vol. 23, pp. 493–507, 1952.

    Article  MathSciNet  MATH  Google Scholar 

  • C. Craig, “On the Tchebychef inequality of Bernstein,” Annals of Mathematical Statistics, vol. 4, pp. 94–102, 1933.

    Article  MATH  Google Scholar 

  • A. Dembo, “Information inequalities and concentration of measure,” Annals of Probability, vol. 25, pp. 927–939, 1997.

    Article  MathSciNet  MATH  Google Scholar 

  • L. Devroye, “Exponential inequalities in nonparametric estimation,” in: Nonparametric Functional Estimation and Related Topics (edited by G. Roussas), pp. 31–44, Kluwer Academic, Dordrecht, 1991.

    Chapter  Google Scholar 

  • W. Hoeffding, “Probability inequalities for sums of bounded random variables,” Journal of the American Statistical Association, vol. 58, pp. 13–30, 1963.

    Article  MathSciNet  MATH  Google Scholar 

  • J. H. Kim, “The Ramsey number R(3, t) has order of magnitude t 2/log t,” Random Structures and Algorithms, vol. 7, pp. 173–207, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  • M. Ledoux, “On Talagrand’s deviation inequalities for product measures,” ESAIM: Probability and Statistics, vol. 1, pp. 63–87, 1996a.

    Article  MathSciNet  MATH  Google Scholar 

  • M. Ledoux, “Isoperimetry and gaussian analysis,” in: Lectures on Probability Theory and Statistics (edited by P. Bernard), pp. 165–294, Ecole d’Eté de Probabilités de St-Flour XXIV-1994, 1996b.

    Google Scholar 

  • K. Marton, “A simple proof of the blowing-up lemma,” IEEE Transactions on Information Theory, vol. 32, pp. 445–446, 1986.

    Article  MathSciNet  MATH  Google Scholar 

  • K. Marton, “Bounding ḋ-distance by informational divergence: a way to prove measure concentration,” Annals of Probability, vol. 24, pp. 857–866, 1996.

    Article  MathSciNet  MATH  Google Scholar 

  • K. Marton, “A measure concentration inequality for contracting Markov chains,” Geometric and Functional Analysis, vol. 6, pp. 556–571, 1996. Erratum: vol. 7, pp. 609–613, 1997.

    Article  MathSciNet  MATH  Google Scholar 

  • P. Massart, “Optimal constants for Hoeffding-type inequalities,” Mathématiques Université de Paris-Sud, Report 98.86, 1998.

    Google Scholar 

  • P. Massart, “About the constants in Talagrand’s concentration inequalities for empirical processes,” Annals of Probability, 1999. To appear.

    Google Scholar 

  • C. McDiarmid, “On the method of bounded differences,” in: Surveys in Combinatorics 1989, pp. 148–188, Cambridge University Press, Cambridge, 1989.

    Google Scholar 

  • C. McDiarmid, “Concentration,” in: Probabilistic Methods for Algorithmic Discrete Mathematics (edited by M. Habib, C. McDiarmid, J. Ramirez-Alfonsin and B. Reed), pp. 195–248, Springer-Verlag, New York, 1998.

    Google Scholar 

  • V. Milman and G. Schechtman, Asymptotic Theory of Finite-Dimensional Normed Spaces, Springer-Verlag, New York, 1986.

    MATH  Google Scholar 

  • M. Okamoto, “Some inequalities relating to the partial sum of binomial probabilities,” Annals of the Institute of Statistical Mathematics, vol. 10, pp. 29–35, 1958.

    Article  MathSciNet  MATH  Google Scholar 

  • W. Rhee and M. Talagrand, “Martingales, inequalities, and NP-complete problems,” Mathematics of Operations Research, vol. 12, pp. 177–181, 1987.

    Article  MathSciNet  MATH  Google Scholar 

  • E. Shamir and J. Spencer, “Sharp concentration of the chromatic number on random graphs G n,p,” Combinatorica, vol. 7, pp. 374–384, 1987.

    Article  MathSciNet  Google Scholar 

  • M. Talagrand, “An isoperimetric theorem on the cube and the Kintchine-Kahane inequalities,” Proceedings of the American Mathematical Society, vol. 104, pp. 905–909, 1988.

    Article  MathSciNet  MATH  Google Scholar 

  • M. Talagrand, “Isoperimetry and integrability of the sum of independent Banach-space valued random variables,” Annals of Probability, vol. 17, pp. 1546–1570, 1989.

    Article  MathSciNet  MATH  Google Scholar 

  • M. Talagrand, “Sample unboundedness of stochastic processes under increment conditions,” Annals of Probability, vol. 18, pp. 1–49, 1990.

    Article  MathSciNet  MATH  Google Scholar 

  • M. Talagrand, “A new isoperimetric inequality and the concentration of measure phenomenon,” in: Geometric Aspects of Functional Analysis (edited by J. Lindenstrauss and V. D. Milman), vol. 146, pp. 4–137, Lecture Notes in Mathematics, Springer-Verlag, Berlin, 1991a.

    Google Scholar 

  • M. Talagrand, “A new isoperimetric inequality for product measure and the tails of sums of independent random variables,” Geometric and Functional Analysis, vol. 1, pp. 211–223, 1991b.

    Article  MathSciNet  MATH  Google Scholar 

  • M. Talagrand, “Isoperimetry, logarithmic Sobolev inequalities on the discrete cube, and Margulis’ graph connectivity theorem,” Geometric and Functional Analysis, vol. 3, pp. 295–314, 1993a.

    Article  MathSciNet  MATH  Google Scholar 

  • M. Talagrand, “New Gaussian estimates for enlarged balls,” Geometric and Functional Analysis, vol. 3, pp. 502–526, 1993b.

    Article  MathSciNet  MATH  Google Scholar 

  • M. Talagrand, “Sharper bounds for Gaussian and empirical processes,” Annals of Probability, vol. 22, pp. 28–76, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  • M. Talagrand, “Concentration of measure and isoperimetric inequalities in product spaces,” Institut des Hautes Études Scientifiques. Publications Mathématiques, vol. 81, pp. 73–205, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  • M. Talagrand, “New concentration inequalities in product spaces,” Inventiones Mathematicae, vol. 126, pp. 505–563, 1996a.

    Article  MathSciNet  MATH  Google Scholar 

  • M. Talagrand, “A new look at independence,” Annals of Probability, vol. 24, pp. 1–34, 1996b.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer Science+Business Media New York

About this chapter

Cite this chapter

Devroye, L., Lugosi, G. (2001). Concentration Inequalities. In: Combinatorial Methods in Density Estimation. Springer Series in Statistics. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-0125-7_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-0125-7_2

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-6527-6

  • Online ISBN: 978-1-4613-0125-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics