2000 character limit reached
Dimensional behaviour of entropy and information
Published 17 Jan 2011 in math.FA, cs.IT, math.IT, and math.PR | (1101.3352v1)
Abstract: We develop an information-theoretic perspective on some questions in convex geometry, providing for instance a new equipartition property for log-concave probability measures, some Gaussian comparison results for log-concave measures, an entropic formulation of the hyperplane conjecture, and a new reverse entropy power inequality for log-concave measures analogous to V. Milman's reverse Brunn-Minkowski inequality.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.