Concentration of Measure for the Analysis of Randomized Algorithms

Description

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 tool kit from the Chernoff-Hoeffding (CH) 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 CH bounds in dependent settings. The authors emphasize 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.

Disclaimer:
Contents of this page are indexed from the Internet. All actions are under your responsability. Email us to report illegal contents or external links and we'll remove them immediately.

Please check the description for download links if any or do a search to find alternative books.

Can't Download?
Please search mirrors if you can't find download links for "Concentration of Measure for the Analysis of Randomized Algorithms" in "Description" and someone else may update the links. Check the comments when back to find any updates.

Search Mirrors
Maybe some mirror pages will be helpful, search this book at top of this page or click here to find more info.

1. Ebooks list page : 3461
2. Randomized Algorithms for Analysis and Control of Uncertain Systems
3. Probability and Computing: Randomized Algorithms and Probabilistic Analysis
4. Randomized Algorithms for Analysis and Control of Uncertain Systems (Communicati
5. Randomized Algorithms for Analysis and Control of Uncertain Systems (Communications and Control Engineering)
6. Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms
7. Randomized Algorithms
8. Randomized Algorithms
9. Randomized Algorithms
10. Randomized Algorithms: Approximation, Generation and Counting
11. Randomized Algorithms: Approximation, Generation and Counting (Distinguished Dissertations)
12. Real Analysis: Measure Theory, Integration, and Hilbert Spaces (Princeton Lectures in Analysis)
13. Robust Range Image Registration Using Genetic Algorithms and the Surface Interpenetration Measure (Series in Machine Perception & Artificial Intelligence)
14. Measure and Integration: A Concise Introduction to Real Analysis
15. Measure and Category: A Survey of the Analogies between Topological and Measure Spaces
16. Real Analysis: Measure Theory, Integration, and Hilbert Spaces