Table of contents for Concentration of measure for the analysis of randomized algorithms / Devdatt Dubhashi, Alessandro Panconesi.


Bibliographic record and links to related information available from the Library of Congress catalog


Information from electronic data provided by the publisher. May be incomplete or contain other coding.


Counter
1. Chernoff-Hoeffding bounds; 2. Applying the CH-bounds; 3. CH-bounds with dependencies; 4. Interlude: probabilistic recurrences; 5. Martingales and the MOBD; 6. The MOBD in action; 7. Averaged bounded difference; 8. The method of bounded variances; 9. Interlude: the infamous upper tail; 10. Isoperimetric inequalities and concentration; 11. Talagrand inequality; 12. Transportation cost and concentration; 13. Transportation cost and Talagrand's inequality; 14. Log-Sobolev inequalities; Appendix A. Summary of the most useful bounds.


Library of Congress subject headings for this publication:
Random variables.
Distribution (Probability theory)
Limit theorems (Probability theory)
Algorithms.