English
Related papers

Related papers: On random disc-polygons in a disc-polygon

200 papers

A highly accurate and efficient method to compute the expected values of the count, sum, and squared norm of the sum of the centre vectors of a random maximal sized collection of non-overlapping unit diameter disks touching a fixed…

Numerical Analysis · Mathematics 2023-11-29 Markus Hegland , Conrad J. Burden , Zbigniew Stachurski

In this paper we consider the convex hull of a spherically symmetric sample in $R^d$. Our main contributions are some new asymptotic results for the expectation of the number of vertices, number of facets, area and the volume of the convex…

Probability · Mathematics 2014-12-30 Enkelejd Hashorva

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

We study the expected volume of random polytopes generated by taking the convex hull of independent identically distributed points from a given distribution. We show that for log-concave distributions supported on convex bodies, we need at…

Metric Geometry · Mathematics 2021-11-16 Debsoumya Chakraborti , Tomasz Tkocz , Beatrice-Helen Vritsiou

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…

Probability · Mathematics 2020-03-04 Zakhar Kabluchko

Inspired by the works of Dewar, Murty and Kot\v{e}\v{s}ovec, we establish some useful theorems for asymptotic formulas. As an application, we obtain asymptotic formulas for the numbers of skew plane partitions and cylindric partitions. We…

Combinatorics · Mathematics 2018-01-24 Guo-Niu Han , Huan Xiong

Let $X_1,\ldots,X_n$ be a standard normal sample in $\mathbb R^d$. We compute exactly the expected volume of the Gaussian polytope $\mathrm{conv}[X_1,\ldots,X_n]$, the symmetric Gaussian polytope $\mathrm{conv}[\pm X_1,\ldots,\pm X_n]$, and…

Probability · Mathematics 2017-06-27 Zakhar Kabluchko , Dmitry Zaporozhets

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

For two families of random polytopes we compute explicitly the expected sums of the conic intrinsic volumes and the Grassmann angles at all faces of any given dimension of the polytope under consideration. As special cases, we compute the…

Probability · Mathematics 2020-07-16 Thomas Godland , Zakhar Kabluchko , Dmitry Zaporozhets

In this paper, we generalize the result on the average volume of random polytopes with vertices following beta distributionsto the case of non-identically distributed vectors. Specifically,we consider the convex hull of independent random…

Probability · Mathematics 2024-07-16 Tatiana Moseeva

We consider the moments of the volume of the symmetric convex hull of independent random points in an $n$-dimensional symmetric convex body. We calculate explicitly the second and fourth moments for $n$ points when the given body is $B_q^n$…

Metric Geometry · Mathematics 2007-05-23 Mark W. Meckes

Let K be a convex body in $R^d$. A random polytope is the convex hull $[x_1,...,x_n]$ of finitely many points chosen at random in K. $\Bbb E(K,n)$ is the expectation of the volume of a random polytope of n randomly chosen points. I.…

Metric Geometry · Mathematics 2016-09-06 Carsten Schütt

While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…

Probability · Mathematics 2021-03-03 Steven D. Hoehner , Carsten Schuett , Elisabeth M. Werner

This paper studies the convex hull of $d$-dimensional samples i.i.d. generated from spherically symmetric distributions. Specifically, we derive a complete integration formula for the expected facet number of the convex hull. This formula…

Probability · Mathematics 2024-02-16 Feng Zhao , Xinyi Tong , Shao-Lun Huang

Large deviation estimates are by now a standard tool inthe Asymptotic Convex Geometry, contrary to small deviationresults. In this note we present a novel application of a smalldeviations inequality to a problem related to the diameters of…

Functional Analysis · Mathematics 2016-12-23 Bo'az Klartag , Roman Vershynin

How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a notion of dispersion and connect it to asymptotic convex…

Computational Complexity · Computer Science 2008-06-17 Luis Rademacher , Santosh Vempala

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

Fix a container polygon $P$ in the plane and consider the convex hull $P_n$ of $n\geq 3$ independent and uniformly distributed in $P$ random points. In the focus of this paper is the vertex number of the random polygon $P_n$. The precise…

Probability · Mathematics 2022-04-26 Anna Gusakova , Matthias Reitzner , Christoph Thäle

In this survey, we discuss volumetric and combinatorial results concerning (mostly finite) intersections or unions of balls (mostly of equal radii) in the $d$-dimensional real vector space, mostly equipped with the Euclidean norm. Our first…

Metric Geometry · Mathematics 2025-12-30 Károly Bezdek , Zsolt Lángi , Márton Naszódi

In this paper, we consider the problem of covering a plane region with unit discs. We present an improved upper bound and the first nontrivial lower bound on the number of discs needed for such a covering, depending on the area and…

Computational Geometry · Computer Science 2021-08-03 Shai Gul , Reuven Cohen , Simi Haber