Related papers: A note on volume thresholds for random polytopes

We experimentally study the fundamental problem of computing the volume of a convex polytope given as an intersection of linear inequalities. We implement and evaluate practical randomized algorithms for accurately approximating the…

Let $K$ be a smooth convex set with volume one in $\BBR^d$. Choose $n$ random points in $K$ independently according to the uniform distribution. The convex hull of these points, denoted by $K_n$, is called a {\it random polytope}. We prove…

In this paper we propose a method to construct probability measures on the space of convex bodies with a given pushforward distribution. Concretely we show that there is a measure on the metric space of centrally symmetric convex bodies,…

We study extremal properties of spherical random polytopes, the convex hull of random points chosen from the unit Euclidean sphere in $\mathbb{R}^n$. The extremal properties of interest are the expected values of the maximum and minimum…

Facets of the convex hull of $n$ independent random vectors chosen uniformly at random from the unit sphere in $\mathbb{R}^d$ are studied. A particular focus is given on the height of the facets as well as the expected number of facets as…

Central limit theorems for the log-volume of a class of random convex bodies in $\mathbb{R}^n$ are obtained in the high-dimensional regime, that is, as $n\to\infty$. In particular, the case of random simplices pinned at the origin and…

An asymptotic formula is proved for the expected $T$-functional of the convex hull of independent and identically distributed random points sampled from the Euclidean unit sphere in $\mathbb{R}^n$ according to an arbitrary positive…

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…

The symmetric convex hull of random points that are independent and distributed according to the cone probability measure on the $\ell_p$-unit sphere of $\mathbb R^n$ for some $1\leq p < \infty$ is considered. We prove that these random…

We establish the log-concavity of the volume of central sections of dilations of the cross-polytope (the strong B-inequality for the cross-polytope and Lebesgue measure restricted to an arbitrary subspace).

We study the Hausdorff distance between a random polytope, defined as the convex hull of i.i.d. random points, and the convex hull of the support of their distribution. As particular examples, we consider uniform distributions on convex…

We prove a pointwise version of the multi-dimensional central limit theorem for convex bodies. Namely, let X be an isotropic random vector in R^n with a log-concave density. For a typical subspace E in R^n of dimension n^c, consider the…

In this paper we develop tools for studying limit theorems by means of convexity. We establish bounds for the discrepancy in total variation between probability measures $\mu$ and $\nu$ such that $\nu$ is log-concave with respect to $\mu$.…

Pick $d+1$ points uniformly at random on the unit sphere in $\mathbb R^d$. What is the expected value of the angle sum of the simplex spanned by these points? Choose $n$ points uniformly at random in the $d$-dimensional ball. What is the…

We study random polytopes of the form $[X_1,\ldots,X_n]$ defined as convex hulls of independent and identically distributed random points $X_1,\ldots,X_n$ in $\mathbb{R}^d$ with one of the following densities: $$ f_{d,\beta} (x) =…

Let $X_1,\ldots,X_n$ be independent random points in the closed unit ball of $\mathbb{R}^d$. Assume that each $X_i$ has a beta distribution with parameter $\beta_i \ge -1$: if $\beta_i>-1$, then $X_i$ has Lebesgue density proportional to…

The sample range of uniform random points $X_1, \dots , X_n$ chosen in a given convex set is the convex hull ${\rm conv}[X_1, \dots, X_n]$. It is shown that in dimension three the expected volume of the sample range is not monotone with…

Based on observations of points uniformly distributed over a convex set in $\R^d$, a new estimator for the volume of the convex set is proposed. The estimator is minimax optimal and also efficient non-asymptotically: it is nearly unbiased…

The entropy per coordinate in a log-concave random vector of any dimension with given density at the mode is shown to have a range of just 1. Uniform distributions on convex bodies are at the lower end of this range, the distribution with…

We construct a quasi-polynomial time deterministic approximation algorithm for computing the volume of an independent set polytope with restrictions. Randomized polynomial time approximation algorithms for computing the volume of a convex…