The Extreme Points of Subsets of s-Concave Probabilities and a Geometric Localization Theorem

34Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We prove that the extreme points of the set of s-concave probability measures satisfying a linear constraint are some Dirac measures and some s-affine probabilities supported by a segment. From this we deduce that the constrained maximization of a convex functional on the s-concave probability measures is reduced to this small set of extreme points. This gives a new approach to a localization theorem due to Kannan, Lovász and Simonovits which happens to be very useful in geometry to obtain inequalities for integrals like concentration and isoperimetric inequalities. Roughly speaking, the study of such inequalities is reduced to these extreme points.

Cite

CITATION STYLE

APA

Fradelizi, M., & Guédon, O. (2004). The Extreme Points of Subsets of s-Concave Probabilities and a Geometric Localization Theorem. Discrete and Computational Geometry, 31(2), 327–335. https://doi.org/10.1007/s00454-003-2868-y

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free