A Linear Programming Inequality with Applications to Concentration of Measure
Leonid Kontorovich
Abstract
We prove an elementary yet useful inequality bounding the maximal value of certain linear programs. This leads directly to a bound on the martingale difference for arbitrarily dependent random variables, providing a generalization of some recent concentration of measure results. The linear programming inequality may be of independent interest.
Create a lesson
Related papers
Truncated Moment Problems and the Extension Property on Monomial Curves
Rajkamal Nailwal, Aljaž Zalar, Igor Zobovič
Optimal stability of regularized spectral differentiation in Sobolev spaces
Teemu Tyni
Modular Topologies on Vector Spaces: Structure and Normability
M. Khamsi, J. Lang, O. Mendez
Critical Norm Profiles for Finite-Prime Composition Operators on the Hardy Space of Dirichlet Series
Xiang Fang, Feng Guo, Aman Mishra et al.
Sparse Operators and their boundedness on Morrey-type Spaces: An Expository Note
Manasa N. Vempati
Sharp Concave-Function Transfer for Lee-Type Schatten Norm Inequalities
Xing Li