Concentration of measure for the analysis of randomized algorithms /

Afficher d'autres versions (1)

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...

Description complète

Détails bibliographiques
Cote:Libro Electrónico
Auteur principal: Dubhashi, Devdatt
Autres auteurs: Panconesi, Alessandro
Format: Électronique eBook
Langue:Inglés
Publié: Cambridge ; New York : Cambridge University Press, ©2009.
Sujets:
Random variables.
Distribution (Probability theory)
Limit theorems (Probability theory)
Algorithms.
Computer algorithms.
Variables aléatoires.
Distribution (Théorie des probabilités)
Théorèmes limites (Théorie des probabilités)
Algorithmes.
distribution (statistics-related concept)
algorithms.
MATHEMATICS > Numerical Analysis.
Computer algorithms
Algorithms
Random variables
Accès en ligne:Texto completo
Table des matières:
  • Chernoff-Hoeffding bounds
  • Applications of the Chernoff-Hoeffding bounds
  • Chernoff-Hoeffding bounds in dependent settings
  • Interlude : probabilistic recurrences
  • Martingales and the method of bounded differences
  • The simple method of bounded differences in action
  • The method of averaged bounded differences
  • The method of bounded variances
  • Interlude : the infamous upper tail
  • Isoperimetric inequalities and concentration
  • Talagrand's isoperimetric inequality
  • Isoperimetric inequalities and concentration via transportation cost inequalities
  • Quadratic transportation cost and Talagrand's inequality
  • Log-Sobolev inequalities and concentration.

Documents similaires