Cargando…
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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Otros Autores: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Cambridge ; New York :
Cambridge University Press,
©2009.
|
| Temas: | |
| Acceso en línea: | Texto completo |
| Sumario: | 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. |
|---|---|
| Descripción Física: | 1 online resource (xiv, 196 pages) : illustrations |
| Bibliografía: | Includes bibliographical references (pages 189-193) and index. |
| ISBN: | 9780511580956 0511580959 9780511579554 0511579551 9780511581274 0511581270 9781107606609 1107606608 1107200318 9781107200319 1282302779 9781282302778 9786612302770 6612302771 0511580630 9780511580635 0511578814 9780511578816 0511580290 9780511580291 |