Abstract
In Chap. 5 we saw the Chernoff Bound, our first example of a concentration bound. Typically, this bound is used to show that a random variable is very close to its expected value with high probability. Such tools are extremely valuable to users of the probabilistic method as they allow us to show that with high probability, a random experiment behaves approximately as we “expect” it to.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Molloy, M., Reed, B. (2002). Talagrand’s Inequality and Colouring Sparse Graphs. In: Graph Colouring and the Probabilistic Method. Algorithms and Combinatorics, vol 23. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04016-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-04016-0_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04015-3
Online ISBN: 978-3-642-04016-0
eBook Packages: Springer Book Archive