Concentration of Measure for the Analysis of Randomized Algorithms

Concentration of Measure for the Analysis of Randomized Algorithms
Author :
Publisher : Cambridge University Press
Total Pages : 213
Release :
ISBN-10 : 9781139480994
ISBN-13 : 1139480995
Rating : 4/5 (94 Downloads)

Book Synopsis Concentration of Measure for the Analysis of Randomized Algorithms by : Devdatt P. Dubhashi

Download or read book Concentration of Measure for the Analysis of Randomized Algorithms written by Devdatt P. Dubhashi and published by Cambridge University Press. This book was released on 2009-06-15 with total page 213 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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 Related Books

Concentration of Measure for the Analysis of Randomized Algorithms
Language: en
Pages: 213
Authors: Devdatt P. Dubhashi
Categories: Computers
Type: BOOK - Published: 2009-06-15 - Publisher: Cambridge University Press

DOWNLOAD EBOOK

Randomized algorithms have become a central part of the algorithms curriculum, based on their increasingly widespread use in modern applications. This book pres
Concentration of Measure for the Analysis of Randomized Algorithms
Language: en
Pages: 213
Authors: Devdatt P. Dubhashi
Categories: Computers
Type: BOOK - Published: 2009-06-15 - Publisher: Cambridge University Press

DOWNLOAD EBOOK

This book presents a coherent and unified account of classical and more advanced techniques for analyzing the performance of randomized algorithms.
Concentration of Measure for the Analysis of Randomized Algorithms
Language: en
Pages: 200
Authors: Ken Gross
Categories:
Type: BOOK - Published: 2005 - Publisher:

DOWNLOAD EBOOK

This book describes the methods a dermatologist, pathologist, or technician can use to optimize the Mohs technique in skin cancer treatment.
Randomized Algorithms
Language: en
Pages: 496
Authors: Rajeev Motwani
Categories: Computers
Type: BOOK - Published: 1995-08-25 - Publisher: Cambridge University Press

DOWNLOAD EBOOK

For many applications a randomized algorithm is either the simplest algorithm available, or the fastest, or both. This tutorial presents the basic concepts in t
Concentration of Measure Inequalities in Information Theory, Communications, and Coding
Language: en
Pages: 256
Authors: Maxim Raginsky
Categories: Computers
Type: BOOK - Published: 2014 - Publisher:

DOWNLOAD EBOOK

Concentration of Measure Inequalities in Information Theory, Communications, and Coding focuses on some of the key modern mathematical tools that are used for t