SearcharxivSearch

arXiv · 2609.10607

Gumbel convergence for maximal packing distances from uniform random samples

Abstract

Let $(X _n )_n$ be a sequence of i.i.d. $R^d$-valued random variables uniformly distributed on a compact subset $M$ of $R^d$ . In this work, we study the asymptotic behavior of maximal packings of this compact subset $M$. Under some assumptions on $M$ (in particular, that it is a smooth submanifold of $R^d$ without boundary), we establish a precise extreme value law (of Gumbel type) for the minimal distances from the sample $(X_1 , \cdots, X_ n)$ to the centers of maximal packings. This result leads to explicit asymptotic confidence bounds for this maximal packing and thus to the support $M$. A distinctive feature of our contribution is the explicit derivation of the scaling sequences in the Gumbel convergence, depending only on the geometry of the support M. These formulas provide interpretable confidence bounds for $M$, which represent a novel complement to previous approaches such as those by Fasy et al. (2014). Our approach bridges geometric and combinatorial probability arguments and relies on analytic tools such as the Lambert $W$ function. In addition, we provide examples of main sample spaces in directional and circular statistics (circle, sphere, torus), along with simulations that illustrate and support the theoretical findings.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sana Louhichi. 2026-09-08. Gumbel convergence for maximal packing distances from uniform random samples. https://arxiv.org/abs/2609.10607

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