Concentration of Measure for the Analysis of Randomized Algorithms PDF Download

Are you looking for read ebook online? Search for your book and save it on your Kindle device, PC, phones or tablets. Download Concentration of Measure for the Analysis of Randomized Algorithms PDF full book. Access full book title Concentration of Measure for the Analysis of Randomized Algorithms by Devdatt P. Dubhashi. Download full books in PDF and EPUB format.

Concentration of Measure for the Analysis of Randomized Algorithms

Concentration of Measure for the Analysis of Randomized Algorithms PDF Author: Devdatt P. Dubhashi
Publisher: Cambridge University Press
ISBN: 1139480995
Category : Computers
Languages : en
Pages : 213

Get Book Here

Book Description
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.