Concentration of measure for the analysis of randomized algorithms /
Randomized algorithms have become a central part of the algorithms curriculum, based on their increasingly widespread use in modern applications. This book presents a coherent and unified treatment of probabilistic techniques for obtaining high probability estimates on the performance of randomized...
| מחבר ראשי: | |
|---|---|
| מחברים אחרים: | |
| פורמט: | Licensed eBooks |
| שפה: | אנגלית |
| יצא לאור: |
Cambridge ; New York :
Cambridge University Press,
©2009.
|
| גישה מקוונת: | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=284347 |
תוכן הענינים:
- Chernoff-Hoeffding bounds
- Applications of the Chernoff-Hoeffding bounds
- Chernoff-Hoeffding bounds in dependent settings
- Interlude : probabilistic recurrences
- Martingales and the method of bounded differences
- The simple method of bounded differences in action
- The method of averaged bounded differences
- The method of bounded variances
- Interlude : the infamous upper tail
- Isoperimetric inequalities and concentration
- Talagrand's isoperimetric inequality
- Isoperimetric inequalities and concentration via transportation cost inequalities
- Quadratic transportation cost and Talagrand's inequality
- Log-Sobolev inequalities and concentration.