Some remarks about the maximal perimeter of convex sets with respect to probability measures
Abstract
In this note we study the maximal perimeter of a convex set in Rn with respect to various classes of measures. Firstly, we show that for a probability measure μ on Rn, satisfying very mild assumptions, there exists a convex set of μ-perimeter at least Cn[4]Var|X| E|X|. This implies, in particular, that for any isotropic log-concave measure μ one may find a convex set of μ- perimeter of order n18. Secondly, we derive a general upper bound of Cn|| f||1n∞ on the maximal perimeter of a convex set with respect to any log-concave measure with density f in an appropriate position. Our lower bound is attained for a class of distributions including the standard normal distribution. Our upper bound is attained, say, for a uniform measure on the cube. In addition, for isotropic log-concave measures we prove an upper bound of order n2 for the maximal μ-perimeter of a convex set.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.