Andere Kunden interessierten sich auch für
![Concentration and Gaussian Approximation for Randomized Sums]( "Concentration and Gaussian Approximation for Randomized Sums")
Concentration and Gaussian Approximation for Randomized Sums110,99 €![Concentration and Gaussian Approximation for Randomized Sums]( "Concentration and Gaussian Approximation for Randomized Sums")
Concentration and Gaussian Approximation for Randomized Sums110,99 €![Algorithmic Randomness and Complexity]( "Algorithmic Randomness and Complexity")
Algorithmic Randomness and Complexity104,99 €![Handbook of Randomized Computing]( "Handbook of Randomized Computing")
Handbook of Randomized Computing37,99 €![Random Discrete Structures]( "Random Discrete Structures")
Random Discrete Structures118,99 €![Random Fields on the Sphere]( "Random Fields on the Sphere")
Random Fields on the Sphere93,99 €![What Is Random?]( "What Is Random?")
What Is Random?25,99 €
Presents a coherent and unified account of classical and more advanced techniques for analyzing the performance of randomized algorithms. The presentation emphasizes discrete settings and elementary notions of probability, making it accessible to computer scientists and applied discrete mathematicians. The methods are compared by applying them to concrete problems.
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.
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.