English
Related papers

Related papers: A note on volume thresholds for random polytopes

200 papers

We prove the central limit theorem for the volume and the $f$-vector of the Poisson random polytope $\Pi_{\eta}$ in a fixed convex polytope $P\subset\mathbb{R}^d$. Here, $\Pi_{\eta}$ is the convex hull of the intersection of a Poisson…

Probability · Mathematics 2010-10-19 Imre Bárány , Matthias Reitzner

For an isotropic convex body $K\subset\mathbb{R}^n$ we consider the isotropic constant $L_{K_N}$ of the symmetric random polytope $K_N$ generated by $N$ independent random points which are distributed according to the cone probability…

Metric Geometry · Mathematics 2018-07-09 Joscha Prochno , Christoph Thäle , Nicola Turchi

We consider a minimum enclosing and maximum inscribed tropical balls for any given tropical polytope over the tropical projective torus in terms of the tropical metric with the max-plus algebra. We show that we can obtain such tropical…

Combinatorics · Mathematics 2023-03-07 David Barnhill , Ruriko Yoshida , Keiji Miura

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

It is known that for a convex body K in R^d of volume one, the expected volume of random simplices in K is minimised if K is an ellipsoid, and for d = 2, maximised if K is a triangle. Here we provide corresponding stability estimates.

Metric Geometry · Mathematics 2010-06-03 Gergely Ambrus , Károly J. Böröczky

We study the geometry of centrally-symmetric random polytopes, generated by $N$ independent copies of a random vector $X$ taking values in $\mathbb{R}^n$. We show that under minimal assumptions on $X$, for $N \gtrsim n$ and with high…

Probability · Mathematics 2019-07-18 Olivier Guédon , Felix Krahmer , Christian Kümmerle , Shahar Mendelson , Holger Rauhut

Convex hulls are a fundamental geometric tool used in a number of algorithms. As a side-effect of exhaustive tests for an algorithm for which a convex hull computation was the first step, interesting experimental results were found and are…

Computational Geometry · Computer Science 2013-04-10 Jean Souviron

Let us consider the set of all joint probabilities generated by local binary measurements on two separated quantum systems of a given local dimension d. We address the question of whether the shape of this quantum body is convex or not. We…

Quantum Physics · Physics 2015-05-13 K. F. Pál , T. Vértesi

In this work, we find an explicit expression for the volume of the trace nonnegative polytope via a generalization of the Irwin-Hall distribution. This volume is an upper bound for the volume of all projected, normalized realizable spectra.…

Metric Geometry · Mathematics 2016-03-23 Pietro Paparella , Gregory K. Taylor

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

The block bootstrap approximates sampling distributions from dependent data by resampling data blocks. A fundamental problem is establishing its consistency for the distribution of a sample mean, as a prototypical statistic. We use a…

Statistics Theory · Mathematics 2017-06-23 Johannes Tewes , Daniel J. Nordman , Dimitris N. Politis

Many star bodies have convex subsets with approximately the same Gaussian measure (of the complement). Inspired by this phenomenon, and in connection with the randomized Dvoretzky theorem for Lorentz spaces, we derive bounds on the…

Functional Analysis · Mathematics 2022-06-22 Daniel J. Fresen

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…

Metric Geometry · Mathematics 2017-12-22 Balázs Csikós

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

We introduce a class of convex equivolume partitions. Expected $L_2-$discrepancy are discussed under these partitions. There are two main results. First, under this kind of partitions, we generate random point sets with smaller expected…

Statistics Theory · Mathematics 2022-04-20 Jun Xian , Xiaoda Xu

We consider convex hulls of random walks whose steps belong to the domain of attraction of a stable law in $\mathbb{R}^d$. We prove convergence of the convex hull in the space of all convex and compact subsets of $\mathbb{R}^d$, equipped…

Probability · Mathematics 2022-02-28 Wojciech Cygan , Nikola Sandrić , Stjepan Šebek

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 present a new random walk for uniformly sampling high-dimensional convex bodies. It achieves state-of-the-art runtime complexity with stronger guarantees on the output than previously known, namely in R\'enyi divergence (which implies…

Data Structures and Algorithms · Computer Science 2026-03-23 Yunbum Kook , Santosh S. Vempala , Matthew S. Zhang

Consider two half-spaces $H_1^+$ and $H_2^+$ in $\mathbb{R}^{d+1}$ whose bounding hyperplanes $H_1$ and $H_2$ are orthogonal and pass through the origin. The intersection $\mathbb{S}_{2,+}^d:=\mathbb{S}^d\cap H_1^+\cap H_2^+$ is a spherical…

An identity due to Efron dating from 1965 relates the expected volume of the convex hull of $n$ random points to the expected number of vertices of the convex hull of $n+1$ random points. Forty years later this identity was extended from…

Probability · Mathematics 2022-10-04 Christian Buchta
‹ Prev 1 4 5 6 7 8 10 Next ›