Concentration inequalities for functions of independent variables
Andreas Maurer · Random Structures and Algorithms · 2005
Abstract 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