Concentration inequalities for functions of independent variables

Following the entropy method this paper presents general concentra-tion inequalities, which can be applied to combinatorial optimization and empirical processes. The inequalities give improved concentration results for optimal travelling salesmen tours, Steiner trees and the eigenvalues of random symmetric matrices.