Related papers: Central diagonal sections of Gaussian $n$-cubes

We revisit an ingenious argument of K. Ball to provide sharp estimates for the volume of sections of a convex body in John's position. Our technique combines the geometric Brascamp-Lieb inequality with a generalised Parseval-type identity.…

Random simplices and more general random convex bodies of dimension $p$ in $\mathbb{R}^n$ with $p\leq n$ are considered, which are generated by random vectors having an elliptical distribution. In the high-dimensional regime, that is, if…

We study sequential probability assignment in the Gaussian setting, where the goal is to predict, or equivalently compress, a sequence of real-valued observations almost as well as the best Gaussian distribution with mean constrained to a…

Suppose X is a random vector, that is distributed uniformly in some n-dimensional convex set. It was conjectured that when the dimension n is very large, there exists a non-zero vector u, such that the distribution of the real random…

We prove a local limit theorem, i.e. a central limit theorem for densities, for a sequence of independent and identically distributed random variables taking values on an abstract Wiener space; the common law of those random variables is…

We study the regularity of densities of distributions that are polynomial images of the standard Gaussian measure on $\mathbb{R}^n$. We assume that the degree of a polynomial is fixed and that each variable enters to a power bounded by…

Let $K$ be a $d$ dimensional convex body with a twice continuously differentiable boundary and everywhere positive Gauss-Kronecker curvature. Denote by $K_n$ the convex hull of $n$ points chosen randomly and independently from $K$ according…

We present a deterministic polynomial-time algorithm for estimating the volume of a hypercube intersected by a fixed number of constraints of the type $f(x) \leq b$, where $f$ is the sum of univariate functions that are each nonnegative,…

Let $X_1,\ldots,X_n$ be a standard normal sample in $\mathbb R^d$. We compute exactly the expected volume of the Gaussian polytope $\mathrm{conv}[X_1,\ldots,X_n]$, the symmetric Gaussian polytope $\mathrm{conv}[\pm X_1,\ldots,\pm X_n]$, and…

Consider the random sequential packing model with infinite input and in any dimension. When the input consists of non-zero volume convex solids we show that the total number of solids accepted over cubes of volume $\lambda$ is…

The mean width is a measure on three-dimensional convex bodies that enjoys equal status with volume and surface area [Rota]. As the phrase suggests, it is the mean of a probability density f. We verify formulas for mean widths of the…

We prove a log-Sobolev inequality for a certain class of log-concave measures in high dimension. These are the probability measures supported on the unit cube in R^n whose density takes the form exp(-H) where the function H is assumed to be…

Gr\"unbaum's inequality guarantees that the centroid of a convex body has halfspace depth at least $1/e$: every halfspace containing the centroid captures at least a $1/e$ fraction of the body's volume. For mixed-integer convex sets…

We derive the isoperimetric profile of Gaussian type for an absolutely continuous probability measure on Euclidean spaces with respect to the Lebesgue measure, whose density is a radial function.The key is a generalization of the Poincar\'e…

Several years ago the authors started looking at some problems of convex geometry from a more general point of view, replacing volume by an arbitrary measure. This approach led to new general properties of the Radon transform on convex…

Let $p$ be a positive number. Consider probability measure $\gamma_p$ with density $\varphi_p(y)=c_{n,p}e^{-\frac{|y|^p}{p}}$. We show that the maximal surface area of a convex body in $\mathbb{R}^n$ with respect to $\gamma_p$ is…

We study the probability distribution of the area and the number of vertices of random polygons in a convex set $K\subset\mathbb{R}^2$. The novel aspect of our approach is that it yields uniform estimates for all convex sets…

Two points are randomly selected inside a three-dimensional euclidian cube. The value l of their separation lies somewhere between zero and the length of a diagonal of the cube. The probability density P(l) of the separation is obtained…

The diameter of the Cayley graph of the Rubik's Cube group is the fewest number of turns needed to solve the Cube from the hardest initial configuration. For the 2$\times$2$\times$2 Cube, the diameter is 11 in the half-turn metric, 14 in…

We consider the volume of a Boolean expression of some congruent balls about a given system of centers in the $d$-dimensional Euclidean space. When the radius $r$ of the balls is large, this volume can be approximated by a polynomial of…