SearcharxivSearch

arXiv · 1909.13335

Angles of Random Simplices and Face Numbers of Random Polytopes

Abstract

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 expected number of faces of their convex hull? We answer these and some related questions of stochastic geometry. To this end, we compute expected internal angles of random simplices whose vertices are independent random points sampled from one of the following $d$-dimensional distributions: (i) the beta distribution with the density proportional to $(1-\|x\|^2)^{\beta}$, where $x$ is belongs to the unit ball in $\mathbb R^d$; (ii) the beta' distribution with the density proportional to $(1+\|x\|^2)^{-\beta}$, where $x\in\mathbb{R}^{d}$. These results imply explicit formulae for the expected face numbers of the following random polytopes: (a) the typical Poisson-Voronoi cell; (b) the zero cell of the Poisson hyperplane tessellation; (c) beta and beta' polytopes defined as convex hulls of i.i.d. samples from the corresponding distributions.

Explore related subjects

Keep this discovery

BibTeXRIS

Zakhar Kabluchko. 2019-09-29. Angles of Random Simplices and Face Numbers of Random Polytopes. https://arxiv.org/abs/1909.13335

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR