English
Related papers

Related papers: The minimum neighborliness of a random polytope

200 papers

Sometimes, it is possible to represent a complicated polytope as a projection of a much simpler polytope. To quantify this phenomenon, the extension complexity of a polytope $P$ is defined to be the minimum number of facets of a (possibly…

Combinatorics · Mathematics 2022-03-24 Matthew Kwan , Lisa Sauermann , Yufei Zhao

We study the problem of approximating the mixed volume $V(P_1^{(\alpha_1)}, \dots, P_k^{(\alpha_k)})$ of an $k$-tuple of convex polytopes $(P_1, \dots, P_k)$, each of which is defined as the convex hull of at most $m_0$ points in…

Computational Geometry · Computer Science 2025-12-30 Hariharan Narayanan , Sourav Roy

The random polytope $K_n$, defined as the convex hull of $n$ points chosen uniformly at random on the boundary of a smooth convex body, is considered. Proofs for lower and upper variance bounds, strong laws of large numbers and central…

Probability · Mathematics 2017-06-12 Nicola Turchi , Florian Wespi

Suppose we choose $N$ points uniformly randomly from a convex body in $d$ dimensions. How large must $N$ be, asymptotically with respect to $d$, so that the convex hull of the points is nearly as large as the convex body itself? It was…

Probability · Mathematics 2020-09-22 Alan Frieze , Wesley Pegden , Tomasz Tkocz

We consider the question of the largest possible combinatorial diameter among $(d-1)$-dimensional simplicial complexes on $n$ vertices, denoted $H_s(n, d)$. Using a probabilistic construction we give a new lower bound on $H_s(n, d)$ that is…

Combinatorics · Mathematics 2019-06-03 Francisco Criado , Andrew Newman

A "law of large numbers" for consecutive convex hulls for weakly dependent Gaussian sequences $\{X_n\}$, having the same marginal distribution, is extended to the case when the sequence $\{X_n\}$ has a weak limit. Let $\mathbb{B}$ be a…

Probability · Mathematics 2020-05-13 Youri Davydov , Vygantas Paulauskas

This paper considers the question of how to succinctly approximate a multidimensional convex body by a polytope. Given a convex body $K$ of unit diameter in Euclidean $d$-dimensional space (where $d$ is a constant) and an error parameter…

Computational Geometry · Computer Science 2022-12-09 Rahul Arya , Sunil Arya , Guilherme D. da Fonseca , David M. Mount

Let $D$ be an orientation of a simple graph. Given $u,v\in V(D)$, a directed shortest $(u,v)$-path is a $(u,v)$-geodesic. $S \subseteq V(D)$ is convex if, for every $u,v \in S$, the vertices in each $(u,v)$-geodesic and in each…

Combinatorics · Mathematics 2020-11-24 Julio C. S. Araujo , Pedro S. M. Arraes

We derive explicit formulae for the expected volume and the expected number of facets of the convex hull of several multidimensional Gaussian random walks in terms of the Gaussian persistence probabilities. Special cases include the already…

Probability · Mathematics 2020-12-25 Julien Randon-Furling , Dmitry Zaporozhets

Let $X_1,\ldots,X_n$ be independent random points that are distributed according to a probability measure on $\mathbb{R}^d$ and let $P_n$ be the random convex hull generated by $X_1,\ldots,X_n$ ($n\geq d+1$). Natural classes of probability…

Metric Geometry · Mathematics 2017-11-06 Gilles Bonnet , Julian Grote , Daniel Temesvari , Christoph Thaele , Nicola Turchi , Florian Wespi

We consider the sequence of independent centered Gaussian random elements of a separable Banach space and their consecutive closed convex hulls. If inicial elements converge weakly to some limite, then, as shown in Davydov- Paulauskas…

Probability · Mathematics 2026-04-13 Youri Davydov

We give an explicit formula for the probability that the convex hull of an $n$-step random walk in $R^d$ does not contain the origin, under the assumption that the distribution of increments of the walk is centrally symmetric and puts no…

Probability · Mathematics 2017-06-01 Zakhar Kabluchko , Vladislav Vysotsky , Dmitry Zaporozhets

Let $K$ be a convex body in $\mathbb{R}^d$ which slides freely in a ball. Let $K^{(n)}$ denote the intersection of $n$ closed half-spaces containing $K$ whose bounding hyperplanes are independent and identically distributed according to a…

Metric Geometry · Mathematics 2015-12-09 Ferenc Fodor , Daniel Hug , Ines Ziebarth

Let $\Gamma$ be an $N\times n$ random matrix with independent entries and such that in each row entries are i.i.d. Assume also that the entries are symmetric, have unit variances, and satisfy a small ball probabilistic estimate uniformly.…

Functional Analysis · Mathematics 2019-02-08 Olivier Guédon , A. E. Litvak , K. Tatarko

In this note we study the maximal perimeter of a convex set in $\mathbb{R}^n$ with respect to various classes of measures. Firstly, we show that for a probability measure $\mu$ on $ \mathbb{R}^n$, satisfying very mild assumptions, there…

Metric Geometry · Mathematics 2019-05-01 Galyna V. Livshyts

For a fixed $k\in\{1,\dots,d\}$ consider random vectors $X_0,\dots, X_{k}\in\mathbb R^d$ with an arbitrary spherically symmetric joint density function. Let $A$ be any non-singular $d\times d$ matrix. We show that the $k$-dimensional volume…

Probability · Mathematics 2019-08-08 Friedrich Götze , Anna Gusakova , Dmitry Zaporozhets

For a given convex body K in $R^d$, a random polytope $K^{(n)}$ is defined (essentially) as the intersection of $n$ independent closed halfspaces containing $K$ and having an isotropic and (in a specified sense) uniform distribution. We…

Metric Geometry · Mathematics 2009-01-22 Károly J. Böröczky , Rolf Schneider

Let p_N be a random degree N polynomial in one complex variable whose zeros are chosen independently from a fixed probability measure mu on the Riemann sphere S^2. This article proves that if we condition p_N to have a zero at some fixed…

Probability · Mathematics 2016-01-26 Boris Hanin

Let $U_1,\ldots,U_n$ be independent random vectors uniformly distributed on the unit sphere $\mathbb S^{d-1}\subseteq\mathbb R^d$, where $n\ge d$, and consider the random polyhedral cone \[ \mathcal W_{n,d}:=\mathop{\mathrm{pos}}…

Probability · Mathematics 2026-03-18 Zakhar Kabluchko

A set-system $S\subseteq \{0,1\}^n$ is cube-ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential…

Combinatorics · Mathematics 2026-04-21 Ahmad Abdi , Gérard Cornuéjols , Daniel Dadush , Mahsa Dalirrooyfard