Concentration of Measure for the Analysis of Randomized Algorithms pdf epub mobi txt 电子书下载 2024

☆☆☆☆☆
简体网页||繁体网页

Devdatt P. Dubhashi

Cambridge University Press

2009-6-15

214

GBP 93.00

Hardcover

9780521884273

图书标签: 算法数学随机算法的应用概率 concentration_inequality Math CS

喜欢 Concentration of Measure for the Analysis of Randomized Algorithms 的读者还喜欢

下载链接在页面底部

点击这里下载

facebook linkedin mastodon messenger pinterest reddit telegram twitter viber vkontakte whatsapp 复制链接

想要找书就要到小哈图书下载中心

qciss.net

立刻按 ctrl+D收藏本页

你会得到大惊喜!!

发表于2024-08-03

Concentration of Measure for the Analysis of Randomized Algorithms epub 下载 mobi 下载 pdf 下载 txt 电子书下载 2024

Concentration of Measure for the Analysis of Randomized Algorithms pdf epub mobi txt 电子书下载 2024

图书描述

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.

Concentration of Measure for the Analysis of Randomized Algorithms 下载 mobi epub pdf txt 电子书