Metraipolis › archive › dc_307991caa789
A Universal Law of Large Numbers for Extreme Cycles in Random Čech Complexes — arXiv:2609.19474
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.19474
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T04:23:35.202Z
- SHA-256 of the archived text
c2fdbe395f020d14b374d69af6549944dbdccf0fea8f99d13e376d4ba22eeea7- Stable URL of this page
https://metraipolis.com/documento/dc_307991caa789
How to cite
A Universal Law of Large Numbers for Extreme Cycles in Random Čech Complexes — arXiv:2609.19474 — arXiv (en), https://arxiv.org/abs/2609.19474 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_307991caa789 (Metraipolis archive dc_307991caa789, sha256 c2fdbe395f020d14b374d69af6549944dbdccf0fea8f99d13e376d4ba22eeea7)
BibTeX
@misc{dc307991caa789,
title = {A Universal Law of Large Numbers for Extreme Cycles in Random Čech Complexes — arXiv:2609.19474},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.19474},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_307991caa789; sha256 c2fdbe395f020d14b374d69af6549944dbdccf0fea8f99d13e376d4ba22eeea7},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.19474. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study the maximal multiplicative persistence of $k$-cycles in random Čech complexes. Let $f:\mathbb{R}^d\to\mathbb{R}$ be a probability density function, let ${P}_n$ be a Poisson process with intensity $nf$, and let $\Pi_{k,n}$ denote the largest death-to-birth ratio among all non-essential $k$-cycles ($1\le k \le d-1$). For the uniform distribution in the unit hypercube, it was proved in [9] that $\Pi_{k,n} = \Theta\left( \left(\frac{\log n}{\log\log n}\right)^{1/k}\right)$. In this paper we sharpen and extend this result to a law of large numbers, for a broad class of distributions. Most significantly, we show that the limiting constant depends only on $d$ and $k$, and not on the probability density $f$. Thus the extreme value of multiplicative persistence exhibits a universality phenomenon. We show that the limiting constant is determined by the asymptotic covering density of the $k$-dimensional sphere. Our proof identifies the geometric mechanism underlying maximal cycles, a persistent isoperimetric inequality, which gives sharp bounds on the number of points needed to generate a highly persistent cycle. By combining covering-density estimates with isoperimetric inequalities, we show that this minimum is asymptotically attained by efficient coverings of a $k$-sphere. A key ingredient is a geometric measure theory argument that uses compactness to relate discrete covering counts to the volume of a limiting cycle.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-18 in math.PR).
Categorie arXiv: Probability (math.PR) ; Algebraic Topology (math.AT); Metric Geometry (math.MG).
Pagina del lavoro: https://arxiv.org/abs/2609.19474 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-10T04:09:58.340Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).