Advertisement

Abstract

Chernoff-Hoeffding bounds are sharp tail probability bounds for sums of bounded independent random variables. Often we cannot avoid dependence among random variables involved in the sum. In some cases the theory of martingales has been used to obtain sharp bounds when there is a limited amount of dependence. This paper will present a simple but powerful new technique that uses the existence of small sized equitable graph colorings to prove sharp Chernoff-Hoeffding type concentration results for sums of random variables with dependence. This technique also allows us to focus on the dependency structure of the random variables and in cases where the dependency structure is a tree or an outerplanar graph, it allows us to derive bounds almost as sharp as those obtainable had the random variables been mutually independent. This technique connects seemingly unrelated topics: extremal graph theory and concentration inequalities. The technique also motivates several open questions in equitable graph colorings, positive answers for which will lead to surprisingly strong Chernoff-Hoeffding type bounds.

Keywords

Chromatic Number Dependency Graph Tail Probability Color Class Graph Class 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Béla Bollobás. The chromatic number of random graphs. Combinatorica, 8:49–55, 1988.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Bela Bollobás and Richard K. Guy. Equitable and proportional coloring of trees. Journal of Combinatorial Theory, Series B, 34:177–186, 1983.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Herman Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Mathematical Statistics, 23:493–507, 1952.MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Hajnal and Szeméredi. Proof of a conjecture of erdös. In P. Erdoös, A. Rényi, and V.T. Sós, editors, Combinatorial Theory and Its Applications, Vol II, Volume 4 of Colloquia Mathematica Societatis János Bolyai, pages 601–623. North-Holland, 1970.Google Scholar
  5. 5.
    Wassily Hoeffding. Probability inequalities for sums of bounded random variables. American Statistical Association Journal, 58:13–30, 1963.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Colin McDiarmid. Concentration. In M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed, editors, Probabilistic Methods for Algorithmic Discrete Mathematics, pages 195–248. Springer, 1998.Google Scholar
  7. 7.
    Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, 1995.Google Scholar
  8. 8.
    Alessandro Panconesi and Aravind Srinivasan. Randomized distributed edge colouring via an extension of the chernoff-hoeffding bounds. SIAM Journal on Computing, 26(2):350–368, 1997.zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Sriram V. Pemmaraju. Equitable colorings, proportional colorings, and chernoff-hoeffding bounds. Technical report, TR 01-05 Department of Computer Science, The University of Iowa, 2001.Google Scholar
  10. 10.
    Jeanette Schmidt, Alan Siegel, and Aravind Srinivasan. Chernoff-hoeffding bounds for applications with limited independence. SIAM Journal on Discrete Mathematics, 8(2):223–250, 1995.zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Joel Spencer. Ten Lectures on the Probabilistic Method. SIAM, Philadelphia, 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Sriram V. Pemmaraju
    • 1
  1. 1.Department of Computer ScienceThe University of IowaIowa City

Personalised recommendations