arXiv subjects

Matthias Reitzner

Publications and source records attributed to Matthias Reitzner.

At least 19 recordsLinked to original sources

arXiv2025

Central limit theorems for random boundary polytopes

The number of faces of the convex hull of $n$ independent and identically distributed random points chosen on the boundary of a smooth convex body in $\mathbb{R}^d$ is investigated. In dimensions two and three the number of $k$-faces is known to be constant almost surely and in dimension four and higher the variance is known to be non-zero if $k\ge 1$. We show that it is of order $n$. This is complemented by a central limit theorem with a Berry-Esseen bound which is of optimal order $n^{-1/2}$. We derive similar results for the Poissonized model, where additionally the number of random points is Poisson distributed. As a main tool, we develop a representation of the number of faces as a sum of exponentially stabilizing score functions.

math.PR↗

arXiv2024

Poisson-Delaunay approximation

For a Borel set $A$ and a stationary Poisson point process $\eta_t$ in $\mathbb R^d$ of intensity $t>0$, the Poisson-Delaunay approximation $ A_{\eta_t}$ of $A$ is the union of all Delaunay cells generated by $\eta_t$ with center in $A$. It is shown that $\lambda_d(A_{\eta_t})$ is an unbiased estimator for $\lambda_d(A)$, variance bounds and a quantitative central limit theorem are given. The asymptotic behaviour of the symmetric difference $\lambda_d(A\Delta A_{\eta_t})$ is derived as $t \to\infty$.

math.PR↗

arXiv2022

Covariance matrices of length power functionals of random geometric graphs -- an asymptotic analysis

Asymptotic properties of a vector of length power functionals of random geometric graphs are investigated. More precisely, its asymptotic covariance matrix is studied as the intensity of the underlying homogeneous Poisson point process increases. This includes a systematic discussion of matrix properties like rank, definiteness, determinant, eigenspaces or decompositions of interest. For the formulation of the results a case distinction is necessary. Indeed, in the three possible regimes the respective covariance matrix is of quite different nature which leads to different statements. Finally, stochastic consequences for random geometric graphs are derived.

math.PR↗

arXiv2022

Variance expansion and Berry-Esseen bound for the number of vertices of a random polygon in a polygon

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 variance expansion for the vertex number is determined up to the constant-order term, a result which can be considered as a second-order analogue of the classical expansion for the expectation of R\'enyi and Sulanke (1963). Moreover, a sharp Berry-Esseen bound is derived for the vertex number of the random polygon $P_n$, which is of the same order as the square-root of the variance. The main idea behind the proof of both results is a decomposition of the boundary of the random polygon $P_n$ into random convex chains and a careful merging of the variance expansions and Berry-Esseen bounds for the vertex numbers of the individual chains.

math.PR↗

arXiv2022

Spherical convex hull of random points on a wedge

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 convex subset of the $d$-dimensional unit sphere $\mathbb{S}^d$, which contains a great subsphere of dimension $d-2$ and is called a spherical wedge. Choose $n$ independent random points uniformly at random on $\mathbb{S}_{2,+}^d$ and consider the expected facet number of the spherical convex hull of these points. It is shown that, up to terms of lower order, this expectation grows like a constant multiple of $\log n$. A similar behaviour is obtained for the expected facet number of a homogeneous Poisson point process on $\mathbb{S}_{2,+}^d$. The result is compared to the corresponding behaviour of classical Euclidean random polytopes and of spherical random polytopes on a half-sphere.

math.PR↗

arXiv2020

Expected mean width of the randomized integer convex hull

Let $K \in \R^d$ be a convex body, and assume that $L$ is a randomly rotated and shifted integer lattice. Let $K_L$ be the convex hull of the (random) points $K \cap L$. The mean width $W(K_L)$ of $K_L$ is investigated. The asymptotic order of the mean width difference $W(\l K)-W((\l K)_L)$ is maximized by the order obtained by polytopes and minimized by the order for smooth convex sets as $\l \to \infty$.

math.MG↗

arXiv2019

Asymptotic normality for random simplices and convex bodies in high dimensions

Central limit theorems for the log-volume of a class of random convex bodies in $\mathbb{R}^n$ are obtained in the high-dimensional regime, that is, as $n\to\infty$. In particular, the case of random simplices pinned at the origin and simplices where all vertices are generated at random is investigated. The coordinates of the generating vectors are assumed to be independent and identically distributed with subexponential tails. In addition, asymptotic normality is established also for random convex bodies (including random simplices pinned at the origin) when the spanning vectors are distributed according to a radially symmetric probability measure on the $n$-dimensional $\ell_p$-ball. In particular, this includes the cone and the uniform probability measure.

math.MG↗

arXiv2018

Stars of Empty Simplices

Let $X=\{x_1,\ldots,x_n\} \subset \mathbb R^d$ be an $n$-element point set in general position. For a $k$-element subset $\{x_{i_1},\ldots,x_{i_k}\} \subset X$ let the degree ${\rm deg}_k(x_{i_1},\ldots,x_{i_k})$ be the number of empty simplices $\{x_{i_1},\ldots,x_{i_{d+1}}\} \subset X$ containing no other point of $X$. The $k$-degree of the set $X$, denoted ${\rm deg}_k(X)$, is defined as the maximum degree over all $k$-element subset of $X$. We show that if $X$ is a random point set consisting of $n$ independently and uniformly chosen points from a compact set $K$ then ${\rm deg}_d(X)=\Theta(n)$, improving results previously obtained by B\'ar\'any, Marckert and Reitzner [Many empty triangles have a common edge, Discrete Comput. Geom., 2013] and Temesvari [Moments of the maximal number of empty simplices of a random point set, Discrete Comput. Geom., 2018] and giving the correct order of magnitude with a significantly simpler proof. Furthermore, we investigate ${\rm deg}_k(X)$. In the case $k=1$ we prove that ${\rm deg}_1(X)=\Theta(n^{d-1})$.

math.PR↗

arXiv2018

Crossing Numbers and Stress of Random Graphs

Consider a random geometric graph over a random point process in $\mathbb{R}^d$. Two points are connected by an edge if and only if their distance is bounded by a prescribed distance parameter. We show that projecting the graph onto a two dimensional plane is expected to yield a constant-factor crossing number (and rectilinear crossing number) approximation. We also show that the crossing number is positively correlated to the stress of the graph's projection.

cs.DM↗

arXiv2018

Facets of high-dimensional Gaussian polytopes

We study the number of facets of the convex hull of n independent standard Gaussian points in d-dimensional Euclidean space. In particular, we are interested in the expected number of facets when the dimension is allowed to grow with the sample size. We establish an explicit asymptotic formula that is valid whenever d/n tends to zero. We also obtain the asymptotic value when d is close to n.

math.PR↗

arXiv2017

Gigantic random simplicial complexes

We provide a random simplicial complex by applying standard constructions to a Poisson point process in Euclidean space. It is gigantic in the sense that - up to homotopy equivalence - it almost surely contains infinitely many copies of every compact topological manifold, both in isolation and in percolation.

math.CO↗

arXiv2017

Monotonicity of functionals of random polytopes

The convex hull $P_{n}$ of a Gaussian sample $X_{1},...,X_{n}$ in $R^{d}$ is a Gaussian polytope. We prove that the expected number of facets $E f_{d-1} (P_n)$ is monotonically increasing in $n$. Furthermore we prove this for random polytopes generated by uniformly distributed points in a $d$-dimensional ball.

math.PR↗

arXiv2016

Monotonicity of the Sample Range of 3-D Data: Moments of Volumes of Random Tetrahedra

The sample range of uniform random points $X_1, \dots , X_n$ chosen in a given convex set is the convex hull ${\rm conv}[X_1, \dots, X_n]$. It is shown that in dimension three the expected volume of the sample range is not monotone with respect to set inclusion. This answers a question by Meckes in the negative. The given counterexample is the three-dimensional tetrahedron together with an infinitesimal variation of it. As side result we obtain an explicit formula for all even moments of the volume of a random simplex which is the convex hull of three uniform random points in the tetrahedron and the center of one facet.

math.PR↗

arXiv2016

On the cells in a stationary Poisson hyperplane mosaic

Let $X$ be the mosaic generated by a stationary Poisson hyperplane process $\hat X$ in ${\mathbb R}^d$. Under some mild conditions on the spherical directional distribution of $\hat X$ (which are satisfied, for example, if the process is isotropic), we show that with probability one the set of cells ($d$-polytopes) of $X$ has the following properties. The translates of the cells are dense in the space of convex bodies. Every combinatorial type of simple $d$-polytopes is realized infinitely often by the cells of $X$. A further result concerns the distribution of the typical cell.

math.MG↗

arXiv2016

Cells with many facets in a Poisson hyperplane tessellation

Let $Z$ be the typical cell of a stationary Poisson hyperplane tessellation in $\mathbb{R}^d$. The distribution of the number of facets $f(Z)$ of the typical cell is investigated. It is shown, that under a well-spread condition on the directional distribution, the quantity $n^{\frac{2}{d-1}}\sqrt[n]{\mathbb{P}(f(Z)=n)}$ is bounded from above and from below. When $f(Z)$ is large, the isoperimetric ratio of $Z$ is bounded away from zero with high probability. These results rely on one hand on the Complementary Theorem which provides a precise decomposition of the distribution of $Z$ and on the other hand on several geometric estimates related to the approximation of polytopes by polytopes with fewer facets. From the asymptotics of the distribution of $f(Z)$, tail estimates for the so-called $\Phi$ content of $Z$ are derived as well as results on the conditional distribution of $Z$ when its $\Phi$ content is large.

math.PR↗

arXiv2016

Expected Sizes of Poisson-Delaunay Mosaics and Their Discrete Morse Functions

Mapping every simplex in the Delaunay mosaic of a discrete point set to the radius of the smallest empty circumsphere gives a generalized discrete Morse function. Choosing the points from an n-dimensional Poisson point process, we study the expected number of simplices in the Delaunay mosaic as well as the expected number of critical simplices and non-singular intervals in the corresponding generalized discrete gradient. Observing connections with other probabilistic models, we obtain precise expressions for the expected numbers in low dimensions. In particular, we get the expected numbers of simplices in the Poisson-Delaunay mosaic in dimensions up to 4.

math.PR↗

arXiv2016

On the monotonicity of the moments of volumes of random simplices

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 volume of a random simplex in $K$ is smaller than the expected volume of a random simplex in $L$. Continuing work of Rademacher, it is shown that moments of the volume of random simplices are in general not monotone under set inclusion.

math.MG↗

arXiv2015

Affine invariant valuations on polytopes

A classification of SL$(n)$ invariant valuations on the space of convex polytopes in $R^n$ without any continuity assumptions is established. A corresponding result is obtained on the space of convex polytopes in $R^n$ that contain the origin.

math.MG↗