Premium
Concentration inequalities for functions of independent variables
Author(s) -
Maurer Andreas
Publication year - 2006
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
DOI - 10.1002/rsa.20105
Subject(s) - mathematics , eigenvalues and eigenvectors , inequality , struct , random variable , entropy (arrow of time) , mathematical optimization , combinatorics , computer science , statistics , mathematical analysis , physics , programming language , quantum mechanics
Following the entropy method this paper presents general concentration inequalities, which can be applied to combinatorial optimization and empirical processes. The inequalities give improved concentration results for optimal traveling salesmen tours, Steiner trees, and the eigenvalues of random symmetric matrices. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006