Search arXivSearch

arXiv · 1504.04878

On the Brunn-Minkowski inequality for general measures with applications to new isoperimetric-type inequalities

Abstract

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 \[ \mu(\lambda A + (1-\lambda)B)^{1/n} \geq \lambda \mu(A)^{1/n} + (1-\lambda)\mu(B)^{1/n} \] holds true for an unconditional product measure $\mu$ 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 $\mu$ and unconditional convex bodies $A,B \subset \mathbb{R}^n$. Finally, we prove that the inequality is true for a symmetric $\log$-concave measure $\mu$ and a pair of symmetric convex sets $A,B \subset \mathbb{R}^2$, which, in particular, settles two-dimensional case of the conjecture for Gaussian measure proposed by R. Gardner and the fourth named author. In addition, we deduce the $1/n$-concavity of the parallel volume $t \mapsto \mu(A+tB)$, Brunn's type theorem and certain analogues of Minkowski first inequality.

Explore related subjects

Keep this discovery

BibTeXRIS

Galyna Livshyts, Arnaud Marsiglietti, Piotr Nayar, Artem Zvavitch. 2015-04-19. On the Brunn-Minkowski inequality for general measures with applications to new isoperimetric-type inequalities. https://arxiv.org/abs/1504.04878

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR