Concentration of Measure for the Analysis ...

Dekorationsartikel gehören nicht zum Leistungsumfang.

Sprache: Englisch

60,65 €

inkl. MwSt.

Versandkostenfrei per Post / DHL

auf Lager, Lieferzeit 1-2 Werktage

Kategorien:

Beschreibung

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.

Über den Autor

Devdatt P. Dubhashi is Professor in the Department of Computer Science and Engineering at Chalmers University, Sweden. He earned a Ph.D. in computer science from Cornell University and held positions at the Max-Planck-Institute for Computer Science in Saarbruecken, BRICS, the University of Aarhus and IIT Delhi. Dubhashi has published widely at international conferences and in journals, including many special issues dedicated to best contributions. His research interests span the range from combinatorics to probabilistic analysis of algorithms, and more recently, to computational systems biology and distributed information systems such as the Web.

Inhaltsverzeichnis

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.

Details

Erscheinungsjahr:	2012
Fachbereich:	Programmiersprachen
Genre:	Importe , Informatik
Rubrik:	Naturwissenschaften & Technik
Medium:	Taschenbuch
ISBN-13:	9781107606609
ISBN-10:	1107606608
Sprache:	Englisch
Einband:	Kartoniert / Broschiert
Autor:	Dubhashi, Devdatt P. Panconesi, Alessandro
Hersteller:	Cambridge University Press
Verantwortliche Person für die EU:	Libri GmbH, Europaallee 1, D-36244 Bad Hersfeld, gpsr@libri.de
Maße:	229 x 152 x 13 mm
Von/Mit:	Devdatt P. Dubhashi (u. a.)
Erscheinungsdatum:	01.03.2012
Gewicht:	0,355 kg