Concentration of Measure for the Analysis of Randomized Algo (BOK)

Devdatt P Dubhashi

499,00 49900
Sendes vanligvis innen 5-15 dager
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.


Språk Engelsk Engelsk Innbinding Heftet
Utgitt 2012 Forfatter Devdatt P Dubhashi
ISBN 9781107606609
Antall sider 212 Dimensjoner 15,4cm x 22,9cm x 1,7cm
Vekt 342 gram Leverandør Bertram Trading Ltd

Andre produkter med samme artist(er)/medvirkende