In this paper, we are interested in Gaussian versions of the classical Brunn-Minkowski inequality. We prove in a streamlined way a semigroup version of the Ehrard inequality for $m$ Borel or convex sets based on a previous work by Borell. Our method also allows us to have semigroup proofs of the geometric Brascamp-Lieb inequality and of the reverse one which follow exactly the same lines.
We prove that an approximated version of the Brunn--Minkowski inequality with volume distortion coefficient implies a Gaussian concentration-of-measure phenomenon. Our main theorem is applicable to discrete spaces.
In this paper we present new versions of the classical Brunn-Minkowski inequality for different classes of measures and sets. We show that the inequality \[ μ(λA + (1-λ)B)^{1/n} \geq λμ(A)^{1/n} + (1-λ)μ(B)^{1/n} \] holds true for an unconditional product measure $μ$ with decreasing density and a pair of unconditional convex bodies $A,B \subset \mathbb{R}^n$. We also show that the above inequality is true for any unconditional $\log$-concave measure $μ$ and unconditional convex bodies $A,B \subset \mathbb{R}^n$. Finally, we prove that the inequality is true for a symmetric $\log$-concave measu…
We present an alternative, short proof of a recent discrete version of the Brunn-Minkowski inequality due to Lehec and the second named author. Our proof also yields the four functions theorem of Ahlswede and Daykin as well as some new variants.
We prove stability estimates for the Brunn-Minkowski inequality for convex sets. Unlike existing stability results, our estimates improve as the dimension grows. Our results are equivalent to a thin shell bound, which is one of the central ingredients in the proof of the central limit theorem for convex sets.
We give an alternative proof for discrete Brunn-Minkowski type inequalities, recently obtained by Halikias, Klartag and the author. This proof also implies somewhat stronger weighted versions of these inequalities. Our approach generalizes ideas of Gozlan, Roberto, Samson and Tetali from the theory of measure transportation and provides new displacement convexity of entropy type inequalities for the lattice point enumerator.
We compare two approaches to Ricci curvature on non-smooth spaces, in the case of the discrete hypercube $\{0,1\}^N$. While the coarse Ricci curvature of the first author readily yields a positive value for curvature, the displacement convexity property of Lott, Sturm and the second author could not be fully implemented. Yet along the way we get new results of a combinatorial and probabilistic nature, including a curved Brunn--Minkowski inequality on the discrete hypercube.
We provide a sharp quantitative version of the Gaussian concentration inequality: for every $r>0$, the difference between the measure of the $r$-enlargement of a given set and the $r$-enlargement of a half-space controls the square of the measure of the symmetric difference between the set and a suitable half-space. We also prove a similar estimate in the Euclidean setting for the enlargement with a general convex set. This is equivalent to the stability of the Brunn-Minkowski inequality for the Minkowski sum between a convex set and a generic one.
A generalization of Young's inequality for convolution with sharp constant is conjectured for scenarios where more than two functions are being convolved, and it is proven for certain parameter ranges. The conjecture would provide a unified proof of recent entropy power inequalities of Barron and Madiman, as well as of a (conjectured) generalization of the Brunn-Minkowski inequality. It is shown that the generalized Brunn-Minkowski conjecture is true for convex sets; an application of this to the law of large numbers for random sets is described.
We provide a simple, general argument to obtain improvements of concentration-type inequalities starting from improvements of their corresponding isoperimetric-type inequalities. We apply this argument to obtain robust improvements of the Brunn-Minkowski inequality (for Minkowski sums between generic sets and convex sets) and of the Gaussian concentration inequality. The former inequality is then used to obtain a robust improvement of the Riesz rearrangement inequality under certain natural conditions. These conditions are compatible with the applications to a finite-range nonlocal isoperimetr…
We develop a reverse entropy power inequality for convex measures, which may be seen as an affine-geometric inverse of the entropy power inequality of Shannon and Stam. The specialization of this inequality to log-concave measures may be seen as a version of Milman's reverse Brunn-Minkowski inequality. The proof relies on a demonstration of new relationships between the entropy of high dimensional random vectors and the volume of convex bodies, and on a study of effective supports of convex measures, both of which are of independent interest, as well as on Milman's deep technology of $M$-ellip…
The Brunn-Minkowski inequality for the generalized Gaussian distribution
School of Mathematical Sciences, Key Laboratory of Intelligent Computing and Applications (Ministry of Education), Tongji University(同济大学数学科学学院、智能计算与应用教育部重点实验室)
A number of geometric inequalities for convex sets arising from Brunn's concavity principle have recently been shown to yield local stochastic formulations. Comparatively, there has been much less progress towards stochastic forms of related functional inequalities. We work towards a stochastic geometry of concave functions to establish local versions of dimensional forms of Brunn's principle a la Borell, Brascamp-Lieb, and Rinott. To do so, we define shadow systems of convex epigraphs and hypographs, and revisit Rinott's approach in the context of multiple integral rearrangement inequalities.
In this paper, we study the conjecture of Gardner and Zvavitch from \cite{GZ}, which suggests that the standard Gaussian measure $γ$ enjoys $\frac{1}{n}$-concavity with respect to the Minkowski addition of \textbf{symmetric} convex sets. We prove this fact up to a factor of 2: that is, we show that for symmetric convex $K$ and $L,$ $$ γ(λK+(1-λ)L)^{\frac{1}{2n}}\geq λγ(K)^{\frac{1}{2n}}+(1-λ)γ(L)^{\frac{1}{2n}}. $$ Further, we show that under suitable dimension-free uniform bounds on the Hessian of the potential, the log-concavity of even measures can be strengthened to $p$-concavity, with $p>…
The Brunn-Minkowski and Prékopa-Leindler inequalities admit a variety of proofs that are inspired by convexity. Nevertheless, the former holds for compact sets and the latter for integrable functions so it seems that convexity has no special signficance. On the other hand, it was recently shown that the Brunn-Minkowski inequality, specialized to convex sets, follows from a local stochastic dominance for naturally associated random polytopes. We show that for the subclass of $\log$-concave functions and associated stochastic approximations, a similar stochastic dominance underlies the Prékopa-L…
The Ehrhard-Borell inequality is a far-reaching refinement of the classical Brunn-Minkowski inequality that captures the sharp convexity and isoperimetric properties of Gaussian measures. Unlike in the classical Brunn-Minkowski theory, the equality cases in this inequality are far from evident from the known proofs. The equality cases are settled systematically in this paper. An essential ingredient of the proofs are the geometric and probabilistic properties of certain degenerate parabolic equations. The method developed here serves as a model for the investigation of equality cases in a broa…
Certain excess versions of the Minkowski and Hölder inequalities are given. These new results generalize and improve the Minkowski and Hölder inequalities.