Abstract
In this chapter, we introduce a new tool for proving bounds on concentration. It differs from the tools we have mentioned so far, in that it can be applied to a sequence of dependent trials. To see a concrete example of such a situation, imagine that we are colouring the vertices of a graph one by one, assigning to each vertex a colour chosen uniformly from those not yet assigned to any of its coloured neighbours. This ensures that the colouring obtained is indeed a proper colouring, and analyzing such a random process may yield good bounds on the minimum number of colours required to obtain vertex colourings with certain properties. However, our choices at each vertex are now no longer independent of those made at the other vertices.
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). Azuma’s Inequality and a Strengthening of Brooks’ Theorem. 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_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-04016-0_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04015-3
Online ISBN: 978-3-642-04016-0
eBook Packages: Springer Book Archive