2002 | OriginalPaper | Buchkapitel
Talagrand’s Inequality and Colouring Sparse Graphs
verfasst von : Michael Molloy, Bruce Reed
Erschienen in: Graph Colouring and the Probabilistic Method
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.