Concentration of measure for the analysis of randomized algorithms

Concentration of Measure for the Analysis of Randomized Algorithms

Volumn 9780521884273, Issue , 2009, Pages 1-196

  Dubhashi, Devdatt P ^a   Panconesi, Alessandro ^b  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYSIS OF ALGORITHMS; COMPARATIVE STUDIES; CONCENTRATION OF MEASURE; ISOPERIMETRIC INEQUALITIES; LOG-SOBOLEV INEQUALITIES; PROBABILISTIC TECHNIQUE; RANDOMIZED ALGORITHMS; TALAGRAND'S INEQUALITY;

EID: 84927096892     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511581274     Document Type: Book

References (88)

1. W. Aiello, F. Chung, and L. Lu. Random evolution in massive graphs. In Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, 2001, pages 510-519.
2. N. Alon and J. Spencer. The Probabilistic Method, third edition. John Wiley, Hoboken, NJ, 2008.
3. N. Alon, J.-H. Kim, and J. Spencer. Nearly perfect matchings in regular simple hypergraphs. Isr. J. Math., 100:171-187, 1997.
4. M. Bellare and J. Rompel. Randomness-efficient oblivious sampling. In Proceed-ings of the 35th Annual Symposium on the Foundations of Computer Science, FOCS. IEEE, Santa Fe, NM, 1994, pages 276-287.
5. D. Blackwell. An analog of the minimax theorem for vector payoffs. Pac. J. Math., 6:1-8, 1956.
6. S. G. Bobkov and F. Gotze. Exponential integrability and transportation cost related to logarithmic sobolev inequalities. J. Funct. Anal., 163:1-28, 1999.
7. P. Boldi and S. Vigna. The webgraph framework I: Compression techniques. In Proceedings of the 13th International World Wide Web Conference, 2004, pages 595-601.
8. P. Boldi and S. Vigna. Codes for the World Wide Web. Internet Math., 2(4):407-429, 2005.
9. B. Bollobas, O. Riordan, J. Spencer, and G. E. Tusnady. The degree sequence of a scale-free random graph process. Random Struct. Algorithms, 18(3):279-290, 2001.
10. B. Bollobas. Chromatic number, girth and maximal degree. Discrete Math., 24(3):311-314, 1978.
11. B. Bollobas. Combinatorics: Set Systems, Hypergraphs, Families of Vectors and Combinatorial Probability. Cambridge University Press, Cambridge, 1986.
12. C. Borgs, J. T. Chayes, C. Daskalakis, and S. Roch. First to market is not everything: An analysis of preferential attachment with fitness. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007, pages 135-144.
13. G. Lugosi, S. Boucheron, and P. Massart. A sharp concentration inequality with applications. Random Struct. Algorithms, 16:277-292, 2000.
14. S. Boucheron, G. Lugosi, and P. Massart. Concentration inequalities using the entropy method. Ann. Probab., 31(3):1583-1614, 2003.
15. G. Buehrer and K. Chellapilla. A scalable pattern mining approach to web graph compression with communities. In WSDM '08: Proceedings of the International Conference on Web Search and Web Data Mining. ACM, New York, USA, 2008, pages 95-106.
16. J. W. Byers, J. Considine, and M. Mitzenmacher. Geometric generalizations of the power of two choices. In SPAA '04: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures. ACM, New York, USA, 2004, pages 54-63.
17. N. Cesa-Bianchi and G. Lugosi. Prediction, Learning, and Games. Cambridge University Press, Cambridge, 2006.
18. S. Chaudhuri and D. Dubhashi. Probabilistic recurrence relations revisited. Theor. Comput. Sci., 181(1):45-56, 1997.
19. H. Chernoff. A measure of asymptotic efficiency for tests of hypothesis based on the sum of observations. Ann. Math. Stat., 23:493-509, 1952.
20. F. Chierichetti, R. Kumar, S. Lattanzi, A. Panconesi, and P. Raghavan. Is the web a social graph? Manuscript.
21. F. Chierichetti, A. Panconesi, P. Raghavan, M. Sozio, A. Tiberi, and E. Upfal. Finding near neighbors through cluster pruning. In PODS '07: Proceedings of the Twenty-Sixth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. ACM, New York, USA, 2007, pages 103-112.
22. V. Chvatal. The tail of the hypergeometric distribution. Discrete Math., 25(3):285-287, 1979.
23. T. M. Cover and J. A. Thomas. Elements of Information Theory, second edition. Wiley-Interscience, Hoboken, NJ, 2006.
24. S. Dasgupta and A. Gupta. An elementary proof of a theorem of Johnson and Lindenstrauss. Random Struct. Algorithms, 22(1):60-65, 2003.
25. A. Dembo. Information inequalities and concentration of measure. Ann. Probab., 25(2):927-939, 1997.
26. F. Den Hollander. Large Deviations, volume 14. Fields Institute Monographs. American Mathematical Society, Providence, RI, 2000.
27. D. P. Dubhashi and D. Ranjan. Balls and bins: A study in negative dependence. Random Struct. Algorithms, 13(2):99-124, 1998.
28. D. Dubhashi, D. A. Grable, and A.Panconesi.Near-optimal, distributed edge colouring via the nibble method. Theor. Comput. Sci., 203(2):225-251, 1998.
29. D. P. Dubhashi. Martingales and locality in distributed computing. In Foundations of Software Technology and Theoretical Computer Science (Chennai, 1998), volume 1530. Lecture Notes in Computer Science. Springer, Berlin,1998, pages 174-185.
30. A. D. Flaxman, A. Frieze, and M. Krivelevich. On the random 2-stage minimum spanning tree. Random Struct. Algorithms, 28(1):24-36, 2006.
31. D. P. Foster and R. Vohra. Regret in the on-line decision problem. Games Econ. Behav., 29(1-2):7-35, 1999.
32. Yoav Freund and Robert E. Schapire. Adaptive game playing using multiplicative weights. Games Econ. Behav., 29(1-2):79-103, 1999.
33. A. M. Frieze. On the value of a random minimum spanning tree problem. Discrete Appl. Math., 10(1):47-56, 1985.
34. A. M. Frieze and C. J. H. McDiarmid. On random minimum length spanning trees. Combinatorica, 9(4):363-374, 1989.
35. N. Garg, G. Konjevod, and R. Ravi. A polylogarithmic approximation algorithm for the group Steiner tree problem. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, CA, 1998). ACM, New York, USA, 1998, pages 253-259.
36. D. Gillman. A Chernoff bound for random walks on expander graphs. Siam J. Comput., 27(4):1203-1220, 1998.
37. D. Grable. A large deviation inequality for functions of independent, multi-way choices. Comb. Probab. Comput., 7(1):57-63, 1998.
38. D.GrableandA.Panconesi.Nearly-optimal, distributededge-colouringin O(log log n) rounds. Random Struct. Algorithms, 10(3):385-405, 1997.
39. D. A. Grable and A. Panconesi. Fast distributed algorithms for Brooks-Vizing colorings. J. Algorithms, 37(1):85-120, 2000. Special issue for the best papers of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 1998.
40. G. Grimmett and Stirzaker D. Probability and Random Processes, second edition. Clarendon Press, Oxford, 1993.
41. O. Haggstrom. Finite Markov Chains and Algorithmic Applications. Cambridge University Press, Cambridge, 2002.
42. T. P. Hayes. Randomly coloring graphs of girth at least five. In STOC '03: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing. ACM, New York, USA, 2003, pages 269-278.
43. W. Hoeffding. Probability inequalities for the sum of bounded random variables. J. Am. Stat. Assoc., 58:13-30, 1963.
44. S. Janson. Large deviations for sums of partly dependent random variables. Random Struct. Algorithms, 24(3):234-248, 2004.
45. S. Janson and A. Rucinski. The infamous upper tail. Random Struct. Algorithms, 20(3):317-342, 2002.
46. S.JansonandA.Rucinski.Thedeletionmethodforuppertailestimates. Combinatorica, 24(4):615-640, 2004.
47. W. B. Johnson and J. Lindenstrauss. Extensions of Lipschitz mappings into a Hilbert space. In Conference in Modern Analysis and Probability (New Haven, Connecticut, 1982), volume 26. Contemporary Mathematics. American Mathematical Society, Providence, RI, 1984, pages 189-206.
48. N. Kahale. Large deviation bounds for markov chains. Comb. Probab. Comput., 6:465-474, 1997.
49. R. M. Karp. Probabilistic recurrence relations. J. Assoc. Comput. Mach., 41(6): 1136-1150, 1994.
50. J. H. Kim and V. H. Vu. Divide and conquer martingales and the number of triangles in a random graph. Random Struct. Algorithms, 24(2):166-174, 2004.
51. J. H. Kim. On Brooks' theorem for sparse graphs. Comb. Probab. Comput., 4(2):97-132, 1995.
52. J. Kleinberg and E. Tardos. Algorithm Design. Pearson-Addison Wesley, Boston, 2005.
53. G. Konjevod, R. Ravi, and A. Srinivasan. Approximation algorithms for the covering Steiner problem. Random Struct. Algorithms, 20(3):465-482, 2002.
54. D. C. Kozen. The Design and Analysis of Algorithms. Texts and Monographs in Computer Science. Springer-Verlag, New York, 1992.
55. R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. Stochastic models for the web graph. In Proceedings of the 41st IEEE Symposium on Foundations of Computer Science, 2000, pages 57-65.
56. M. Ledoux. The Concentration of Measure Phenomenon. American Mathematical Society, Providence, RI, 2001.
57. M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput., 15(4):1036-1053, 1986.
58. M. Luby. Removing randomness in parallel computation without a processor penalty. J. Comput. Syst. Sci., 47(2):250-286, 1993.
59. M. J. Luczak and C. McDiarmid. Concentration for locally acting permutations. Discrete Math., 265(1-3):159-171, 2003.
60. G. Lugosi. Concentration of Measure Inequalities. Lecture Notes, unpublished, 2005.
61. K. Marton. Bounding d-distance by information divergence: A method to prove measure concentration. Ann. Probab., 24(2):857-866, 1996.
62. K. Marton. Measure concentration for a class of random processes. Probab. Theory Relat. Fields, 110(2):427-439, 1998.
63. J. Matousek. Graduate Texts in Mathematics, volume 212. Lectures on Discrete Geometry. Springer, New York, 2002.
64. C. J. H. McDiarmid and R. B. Hayward. Large deviations for quicksort. J. Algorithms, 21(3):476-507, 1996.
65. C. J. H. McDiarmid. On the method of bounded differences. In J. Siemons, editor, Surveys in Combinatorics: Invited Papers at the 12th British Combinatorial Conference, volume 141. London Mathematical Society Lecture Notes Series. Cambridge University Press, Cambridge, 1989, pages 148-188.
66. C. McDiarmid. Centering sequences with bounded differences. Comb. Probab. Comput., 6(1):79-86, 1997.
67. C. McDiarmid. Concentration. In Probabilistic Methods for Algorithmic Discrete Mathematics, volume 16. Algorithms and Combinatorics. Springer, Berlin, 1998, pages 195-248.
68. C.McDiarmid.Concentrationforindependentpermutations.Comb.Probab. Comput., 11(2):163-178, 2002.
69. C. McDiarmid and B. Reed. Concentration for self-bounding functions and an inequality of Talagrand. Random Struct. Algorithms, 29(4):549-557, 2006.
70. A. Mei and R. Rizzi. Online permutation routing in partitioned optical passive star networks. IEEE Trans. Comput., 55(12):1557-1571, 2006.
71. G. L. Miller and J. H. Reif. Parallel tree contraction and its applications. Random. Comput., 5:47-72, 1989.
72. M. Mitzenmacher and E. Upfal. Probability and Computing. Cambridge University Press, Cambridge, 2005.
73. M. Molloy and B. Reed. Graph Colouring and the Probabilistic method, volume 23. Algorithms and Combinatorics. Springer-Verlag, Berlin, 2002.
74. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge, 1995.
75. N. Nisan and A. Wigderson. Hardness vs. Randomness. J. Comput. Syst. Sci., 49(2):149-167, 1994.
76. A. Panconesi and A. Srinivasan. Randomized distributed edge coloring via an extension of the Chernoff-Hoeffding bounds. SIAM J. Comput., 26(2):350-368, 1997.
77. A. Panconesi and J. Radhakrishnan. Expansion properties of (secure) wireless networks. In SPAA '04: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures. ACM, New York, USA, 2004, pages 281-285.
78. R. Di Pietro, L. V. Mancini, A. Mei, A. Panconesi, and J. Radhakrishnan. Connec-tivity properties of secure wireless sensor networks. In SASN '04: Proceedings of the 2nd ACM Workshop on Security of Ad Hoc and Sensor Networks. ACM, New York, USA, 2004, pages 53-58.
79. R.DiPietro, L.V.Mancini, A.Mei, A.Panconesi, andJ.Radhakrishnan. Redoubtable sensor networks. ACM Trans. Inf. Syst. Secur., 11(3):1-22, 2008.
80. W. Pugh. Skip lists: A probabilistic alternative to balanced trees. Commun. ACM, 33(6):668-676, 1990.
81. O.Bosquet, S.Boucheron, andG.Lugosi.Concentrationinequalities.In O. Bosquet, U. Von Luxburg and G. Ratsh editors, Advanced Lectures in Machine Learning. Springer, Berlin, 2004, pages 208-240.
82. P.-M. Samson. Concentration of measure inequalities for Markov chains and mixing processes. Ann. Probab., 28(1):416-461, 2000.
83. J. P. Schmidt, A. Siegel, and A. Srinivasan. Chernoff-Hoeffding bounds for appli-cations with limited independence. SIAM J. Discrete Math., 8(2):255-280, 1995.
84. J. M. Steele. Probability Theory and Combinatorial Optimization. SIAM, Philadelphia, PA, 1997.
85. M. Talagrand. Concentration of measure and isoperimetric inequalities in product spaces. Publ. Math. IHES, 81:73-205, 1995.
86. V. H. Vu. Concentration of non-Lipschitz functions and applications. Random Struct. Algorithms, 20(3):262-316, 2002. Probabilistic methods in combinatorial optimization.
87. T. Bohman. The triangle-free process. Manuscript. Http://arxiv.org/0806.4375.
88. S. Janson. Large deviations for sums of partly dependent random variables.Random Struct. Algorithms, 24(3):234-248, 2004.