SearcharxivSearch

arXiv · 2410.05868

Limit theory for the first layers of the random convex hull peeling in a simple polytope

Abstract

The convex hull peeling of a point set consists in taking the convex hull, then removing the extreme points and iterating that procedure until no point remains. The boundary of each hull is called a layer. Following on from [15], we study the first layers generated by the peeling procedure when the point set is chosen as a homogeneous Poisson point process inside a polytope when the intensity goes to infinity. We focus on some specific functionals, namely the number of k-dimensional faces and the outer defect volume. Since the early works of R{\'e}nyi and Sulanke, it is well known that both the techniques and the rates are completely different for the convex hull when the underlying convex body has a smooth boundary or when it is itself a polytope. We expect such dichotomy to extend to the further layers of the peeling. More precisely we provide asymptotic limits for their expectation and variance as well as a central limit theorem. In particular, as in the unit ball, the growth rates do not depend on the layer. The method builds upon previous constructions for the convex hull contained in [9] and [18] and requires the assumption that the underlying polytope is simple.

Explore related subjects

Keep this discovery

BibTeXRIS

Pierre Calka, Gauthier Quilan. 2024-10-08. Limit theory for the first layers of the random convex hull peeling in a simple polytope. https://arxiv.org/abs/2410.05868

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