SearcharxivSearch

arXiv · 2411.19163

Random polytopes in convex bodies: Bridging the gap between extremal containers

Abstract

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 Euclidean balls of varying dimensions as a key example. As $n\to\infty$, we establish explicit growth rates for the expected number of facets, which depend in a subtle way on the the underlying model parameters. For the case of the uniform distribution, we further examine the expected number of faces of arbitrary dimensions as well as the volume difference. Our findings reveal that the family of random polytopes we introduce exhibits novel interpolative properties, bridging the gap between the classical extremal cases observed in the behavior of random polytopes within smooth versus polytopal convex containers.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Florian Besau, Anna Gusakova, Christoph Thäle. 2024-11-28. Random polytopes in convex bodies: Bridging the gap between extremal containers. https://arxiv.org/abs/2411.19163

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