You are here

Concentration of Measure for the Analysis of Randomized Algorithms

Publisher: 
Cambridge University Press
Number of Pages: 
196
Price: 
34.99
ISBN: 
9781107606609
Date Received: 
Wednesday, April 18, 2012
Reviewable: 
No
Include In BLL Rating: 
No
Reviewer Email Address: 
Devdatt P. Dubhashi and Alessandro Panconesi
Publication Date: 
2012
Format: 
Paperback
Category: 
Monograph

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.

Publish Book: 
Modify Date: 
Wednesday, April 18, 2012

Dummy View - NOT TO BE DELETED