arXiv (All)
open access
Gumbel convergence for maximal packing distances from uniform random samples
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Stochastic dominance of first return times for nearest-neighbor random walks on $\mathbb{Z}^d$#1131929
- Rate of convergence for non-Hermitian random matrices and their products#779237
- Algorithmic threshold for high-dimensional projection pursuit I: general theory#794206
- Algorithmic threshold for high-dimensional projection pursuit I: general theory#790187
- Revisiting Toeplitz and Hankel random matrices via $*$-convergence of circulant-type matrices#1014702
Record · ID 997609
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive