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

Devdatt P Dubhashi

1 199,00 1 19900
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.

Produktfakta

Språk Engelsk Engelsk Innbinding Innbundet
Utgitt 2009 Forfatter Devdatt P Dubhashi
Forlag
CAMBRIDGE UNIVERSITY PRESS
ISBN 9780521884273
Antall sider 216 Dimensjoner 22,9cm x 16cm x 1,9cm
Vekt 462 gram Leverandør Bertram Trading Ltd

Andre produkter med samme artist(er)/medvirkende