Concentration of Measure for the Analysis of Randomized Algorithms - Softcover

Dubhashi, Devdatt P.; Panconesi, Alessandro

Softcover

ISBN 10: 1107606608 ISBN 13: 9781107606609

Publisher: Cambridge University Press, 2012

Synopsis

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 tool kit from the Chernoff-Hoeffding (CH) 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 CH bounds in dependent settings. The authors emphasize 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.

About this title

Book Description

Randomized algorithms have become a central part of the algorithms curriculum, based on their increasingly widespread use in modern. This book presents a coherent and unified account of classical and more advanced techniques for analyzing the performance of such algorithms. The presentation emphasizes discrete settings and elementary notions of probability, making it accessible to computer scientists and applied discrete mathematicians. The relative strengths and weaknesses of the methods are demonstrated by applying them to concrete problems.

About the Author

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.

Edition details

• Publisher: Cambridge University Press
• Publication date: 2012
• ISBN 10: 1107606608
• ISBN 13: 9781107606609
• Binding: Paperback
• Language: English
• Number of pages: 214