You are here

Concentration of Measure for the Analysis of Randomized Algorithms

Devdatt P. Dubhashi and Alessandro Panconesi
Publisher: 
Cambridge University Press
Publication Date: 
2012
Number of Pages: 
196
Format: 
Paperback
Price: 
34.99
ISBN: 
9781107606609
Category: 
Monograph
We do not plan to review this book.

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.

Dummy View - NOT TO BE DELETED