English
Related papers

Related papers: Limit theorems for random polytopes with vertices …

200 papers

Let K be a compact convex body in Rd, let Kn be the convex hull of n points chosen uniformly and independently in K, and let fi(Kn) denote the number of i-dimensional faces of Kn. We show that for planar convex sets, E(f0(Kn)) is increasing…

Computational Geometry · Computer Science 2012-11-30 Olivier Devillers , Marc Glisse , Xavier Goaoc , Guillaume Moroz , Matthias Reitzner

The convex hull generated by the restriction to the unit ball of a stationary Poisson point process in the $d$-dimensional Euclidean space is considered. By establishing sharp bounds on cumulants, exponential estimates for large deviation…

Probability · Mathematics 2015-12-15 Julian Grote , Christoph Thaele

We study approximations of polytopes in the standard model for computing polytopes using Minkowski sums and (convex hulls of) unions. Specifically, we study the ability to approximate a target polytope by polytopes of a given depth. Our…

Metric Geometry · Mathematics 2025-07-11 Egor Bakaev , Florestan Brunck , Amir Yehudayoff

In this paper we present several results on the expected complexity of a convex hull of $n$ points chosen uniformly and independently from a convex shape. (i) We show that the expected number of vertices of the convex hull of $n$ points,…

Computational Geometry · Computer Science 2011-11-24 Sariel Har-Peled

In this paper we prove asymptotic upper bounds on the variance of the number of vertices and missed area of inscribed random disc-polygons in smooth convex discs whose boundary is $C^2_+$. We also consider a circumscribed variant of this…

Metric Geometry · Mathematics 2019-07-10 Ferenc Fodor , Viktor Vígh

The central limit theorem for convex bodies says that with high probability the marginal of an isotropic log-concave distribution along a random direction is close to a Gaussian, with the quantitative difference determined asymptotically by…

Functional Analysis · Mathematics 2019-10-01 Haotian Jiang , Yin Tat Lee , Santosh S. Vempala

Stationary and isotropic iteration stable random tessellations are considered, which can be constructed by a random process of cell division. The collection of maximal polytopes at a fixed time $t$ within a convex window $W\subset{\Bbb…

Probability · Mathematics 2011-04-05 Tomasz Schreiber , Christoph Thaele

We approximate boundaries of convex polytopes by smooth hypersurfaces $Y=Y_\varepsilon$ with {\it positive mean curvatures} and, by using basic geometric relations between the scalar curvatures of Riemannin manifolds and the mean curvatures…

Differential Geometry · Mathematics 2023-03-24 Misha Gromov

Coverings of convex bodies have emerged as a central component in the design of efficient solutions to approximation problems involving convex bodies. Intuitively, given a convex body $K$ and $\epsilon> 0$, a covering is a collection of…

Computational Geometry · Computer Science 2023-03-16 Sunil Arya , Guilherme D. da Fonseca , David M. Mount

Let $X_1,\ldots,X_n$ be i.i.d.\ random points in the $d$-dimensional Euclidean space sampled according to one of the following probability densities: $$ f_{d,\beta} (x) = \text{const} \cdot (1-\|x\|^2)^{\beta}, \quad \|x\|\leq 1, \quad…

Metric Geometry · Mathematics 2017-12-22 Zakhar Kabluchko , Daniel Temesvari , Christoph Thaele

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

In a $d$-dimensional convex body $K$ random points $X_0, \dots, X_d$ are chosen. Their convex hull is a random simplex. The expected volume of a random simplex is monotone under set inclusion, if $K \subset L$ implies that the expected…

Metric Geometry · Mathematics 2016-06-08 Benjamin Reichenwallner , Matthias Reitzner

The cut polytope ${\rm CUT}(n)$ is the convex hull of the cut vectors in a complete graph with vertex set $\{1,\ldots,n\}$. It is well known in the area of combinatorial optimization and recently has also been studied in a direct relation…

Discrete Mathematics · Computer Science 2018-12-11 Nevena Maric

Schreiber and Yukich [Ann. Probab. 36 (2008) 363-396] establish an asymptotic representation for random convex polytope geometry in the unit ball $\mathbb{B}^d, d\geq2$, in terms of the general theory of stabilizing functionals of Poisson…

Probability · Mathematics 2013-04-03 Pierre Calka , Tomasz Schreiber , J. E. Yukich

Two models of random cones in high dimensions are considered, together with their duals. The Donoho-Tanner random cone $D_{n,d}$ can be defined as the positive hull of $n$ independent $d$-dimensional Gaussian random vectors. The Cover-Efron…

Probability · Mathematics 2022-06-30 Thomas Godland , Zakhar Kabluchko , Christoph Thaele

The point selection theorem says that the convex hull of any finite point set contains a point that lies in a positive proportion of the simplices determined by that set. This paper proves several new volumetric versions of this theorem…

Metric Geometry · Mathematics 2025-08-26 Travis Dillon

The $K$-hull of a compact set $A\subset\mathbb{R}^d$, where $K\subset \mathbb{R}^d$ is a fixed compact convex body, is the intersection of all translates of $K$ that contain $A$. A set is called $K$-strongly convex if it coincides with its…

Metric Geometry · Mathematics 2021-10-06 Alexander Marynych , Ilya Molchanov

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

Let $K_n$ be the convex hull of i.i.d. random variables distributed according to the standard normal distribution on $\R^d$. We establish variance asymptotics as $n \to \infty$ for the re-scaled intrinsic volumes and $k$-face functionals of…

Probability · Mathematics 2014-09-30 Pierre Calka , J. E. Yukich

Let $X_1,X_2, \ldots $ be independent random uniform points in a bounded domain $A \subset \mathbb{R}^d$ with smooth boundary. Define the coverage threshold $R_n$ to be the smallest $r$ such that $A$ is covered by the balls of radius $r$…

Probability · Mathematics 2022-01-12 Mathew D. Penrose
‹ Prev 1 4 5 6 7 8 10 Next ›