Concentration of Measure for the Analysis of Randomized Algorithms

Versandkostenfrei!
Sofort lieferbar
52,99 €
inkl. MwSt.
Weitere Ausgaben:
PAYBACK Punkte
26 °P sammeln!
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, ...