Concentration of measure for the analysis of randomized algorithms
著者
書誌事項
Concentration of measure for the analysis of randomized algorithms
Cambridge University Press, 2012, c2009
- : pbk.
大学図書館所蔵 件 / 全5件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p.189-193) and index
内容説明・目次
内容説明
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 algorithms. It covers the basic toolkit from the Chernoff-Hoeffding bounds to more sophisticated techniques like martingales and isoperimetric inequalities, as well as some recent developments like Talagrand's inequality, transportation cost inequalities and log-Sobolev inequalities. Along the way, variations on the basic theme are examined, such as Chernoff-Hoeffding bounds in dependent settings. The authors emphasise comparative study of the different methods, highlighting respective strengths and weaknesses in concrete example applications. The exposition is tailored to discrete settings sufficient for the analysis of algorithms, avoiding unnecessary measure-theoretic details, thus making the book accessible to computer scientists as well as probabilists and discrete mathematicians.
目次
- 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.
「Nielsen BookData」 より