Concentration of Measure for the Analysis of Randomized Algorithms

书名：Concentration of Measure for the Analysis of Randomized Algorithms
作者：DevdattP.Dubhashi/AlessandroPanconesi
译者：
ISBN：9780521884273
出版社：CambridgeUniversityPress
出版时间：2009-6-15
格式：epub/mobi/azw3/pdf
页数：214
豆瓣评分：

书籍简介：

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.

作者简介：

书友短评：

添加微信公众号:好书天下获取