English
Related papers

Related papers: The mean width of circumscribed random polytopes

200 papers

We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…

Combinatorics · Mathematics 2022-09-16 Hariharan Narayanan , Rikhav Shah , Nikhil Srivastava

We prove a randomized version of the generalized Urysohn inequality relating mean-width to the other intrinsic volumes. To do this, we introduce a stochastic approximation procedure that sees each convex body K as the limit of intersections…

Metric Geometry · Mathematics 2016-06-30 Grigoris Paouris , Peter Pivovarov

The distance between convex bodies \(K, L \subseteq \R^n\) is defined as \[ d(K,L)= \inf \left\{ \lambda \ge 1: \ L-x \subseteq T (K-y) \subseteq \lambda (L-x) \right\}, \] where the infimum is taken over all \(x,y \in \R^n\) and all…

Functional Analysis · Mathematics 2026-02-27 Han Huang , Mark Rudelson

Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…

Metric Geometry · Mathematics 2026-03-10 Steven Hoehner

The collection $\mathcal{M}_n$ of all metric spaces on $n$ points whose diameter is at most $2$ can naturally be viewed as a compact convex subset of $\mathbb{R}^{\binom{n}{2}}$, known as the metric polytope. In this paper, we study the…

Probability · Mathematics 2022-05-31 Gady Kozma , Tom Meyerovitch , Ron Peled , Wojciech Samotij

The mean width is a measure on n-dimensional convex bodies. An integral formula for the mean width of a regular n-simplex appeared in the electrical engineering literature in 1997. As a consequence, expressions for the expected range of a…

Metric Geometry · Mathematics 2016-03-15 Steven R. Finch

Let $K \subset \R^d$ be a smooth convex set and let $\P_\la$ be a Poisson point process on $\R^d$ of intensity $\la$. The convex hull of $\P_\la \cap K$ is a random convex polytope $K_\la$. As $\la \to \infty$, we show that the variance of…

Probability · Mathematics 2012-06-22 Pierre Calka , J. E. Yukich

We investigate the asymptotic properties of random polytopes arising as convex hulls of $n$ independent random points sampled from a family of block-beta distributions. Notably, this family includes the uniform distribution on a product of…

Probability · Mathematics 2024-12-02 Florian Besau , Anna Gusakova , Christoph Thäle

We prove that for every convex body $K$ with the center of mass at the origin and every $\varepsilon\in \left(0,\frac{1}{2}\right)$, there exists a convex polytope $P$ with at most $e^{O(d)}\varepsilon^{-\frac{d-1}{2}}$ vertices such that…

Classical Analysis and ODEs · Mathematics 2017-05-05 Márton Naszódi , Fedor Nazarov , Dmitry Ryabogin

We consider random polytopes in the $d$-dimensional Euclidean space that are the convex hulls i.i.d. random points selected according to beta-prime distributions. These distributions are rotationally symmetric, heavy-tailed, and their…

Metric Geometry · Mathematics 2026-03-24 Ferenc Fodor , Balázs Grünfelder

Let $\{X_i\}_{i=1}^{\infty}$ be a sequence of independent copies of a random vector $X$ in $\mathbb{R}^n$. We revisit the question to determine the asymptotic shape of the random polytope $K_N={\rm conv}\{X_1,\ldots ,X_N\}$ where $N>n$. We…

Metric Geometry · Mathematics 2025-08-22 Minas Pafis , Natalia Tziotziou

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…

Probability · Mathematics 2015-03-13 John Pardon

Assume $K$ is a convex body in $R^d$, and $X$ is a (large) finite subset of $K$. How many convex polytopes are there whose vertices come from $X$? What is the typical shape of such a polytope? How well the largest such polytope (which is…

Combinatorics · Mathematics 2007-05-23 Imre Bárány

It is proved that for a symmetric convex body K in R^n, if for some tau > 0, |K cap (x+tau K)| depends on ||x||_K only, then K is an ellipsoid. As a part of the proof, smoothness properties of convolution bodies ls are studied.

Functional Analysis · Mathematics 2016-09-06 Mathieu Meyer , Shlomo Reisner , M. Schmuckenschlager

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…

Statistics Theory · Mathematics 2018-07-05 Victor-Emmanuel Brunel

Let $K$ and $K_0$ be convex bodies in $\mathbb{R}^d$, such that $K$ contains the origin, and define the process $(K_n, p_n)$, $n \geq 0$, as follows: let $p_{n+1}$ be a uniform random point in $K_n$, and set $K_{n+1} = K_n \cap (p_{n+1} +…

Probability · Mathematics 2014-06-26 Péter Kevei , Viktor Vígh

For any origin-symmetric convex body $K$ in $\mathbb{R}^n$ in isotropic position, we obtain the bound: \[ M^*(K) \leq C \sqrt{n} \log(n)^2 L_K ~, \] where $M^*(K)$ denotes (half) the mean-width of $K$, $L_K$ is the isotropic constant of…

Functional Analysis · Mathematics 2014-05-09 Emanuel Milman

Asymptotic normality for the natural volume measure of random polytopes generated by random points distributed uniformly in a convex body in spherical or hyperbolic spaces is proved. Also the case of Hilbert geometries is treated and…

Probability · Mathematics 2019-09-13 Florian Besau , Christoph Thäle

Let $X_1,\ldots,X_N$, $N>n$, be independent random points in $\mathbb{R}^n$, distributed according to the so-called beta or beta-prime distribution, respectively. We establish threshold phenomena for the volume, intrinsic volumes, or more…

Metric Geometry · Mathematics 2018-06-15 Gilles Bonnet , Giorgos Chasapis , Julian Grote , Daniel Temesvari , Nicola Turchi

The combinatorial diameter $\operatorname{diam}(P)$ of a polytope $P$ is the maximum shortest path distance between any pair of vertices. In this paper, we provide upper and lower bounds on the combinatorial diameter of a random "spherical"…

Probability · Mathematics 2021-12-28 Gilles Bonnet , Daniel Dadush , Uri Grupel , Sophie Huiberts , Galyna Livshyts