Metraipolis › archive › dc_7bf148ac3468
Packing and covering random trees — arXiv:2610.40150
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.40150
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:34:26.241Z
- SHA-256 of the archived text
af1919bf5265a95a79e40d4e92e7b74ef23a9248545a3019ac05a5f3518b2c22- Stable URL of this page
https://metraipolis.com/documento/dc_7bf148ac3468
How to cite
Packing and covering random trees — arXiv:2610.40150 — arXiv (en), https://arxiv.org/abs/2610.40150 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7bf148ac3468 (Metraipolis archive dc_7bf148ac3468, sha256 af1919bf5265a95a79e40d4e92e7b74ef23a9248545a3019ac05a5f3518b2c22)
BibTeX
@misc{dc7bf148ac3468,
title = {Packing and covering random trees — arXiv:2610.40150},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.40150},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7bf148ac3468; sha256 af1919bf5265a95a79e40d4e92e7b74ef23a9248545a3019ac05a5f3518b2c22},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40150. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study the sizes of optimal packings and coverings of conditioned branching processes by balls with growing radii. We find a universal limiting constant, and thereby establish universality of packing and covering numbers across different scales and different offspring distributions. To be precise, for $\mu$ an offspring distribution with mean $1$ and finite variance $\sigma^2$ we let $T_n$ be a Bienaymé tree with offspring distribution $\mu$ conditioned to have size $n$. We prove that the packing number (resp. covering number) of $T_n$ with balls of radii $1\ll \gamma_n \ll n^{1/2}$ is asymptotically equivalent to $\mathfrak{C} n /(\sigma^2 \gamma_n^2)$ (resp. $\mathfrak{C} n /(4\sigma^2 \gamma_n^2)$), for a universal constant $\mathfrak{C}$. We also show that the order of limits can be exchanged and that the same limit occurs when we first consider the limiting covering number of $T_n$ by balls of fixed radius $R$, and thereafter let $R$ tend to $\infty$. We then extend these results to the Brownian continuum random tree conditioned to have mass $1$. For this model, we prove that the packing (resp. covering) number with balls of radii $\varepsilon$ are asymptotically equivalent to $\mathfrak{C}/\varepsilon^2$ (resp. $\mathfrak{C}/(4\varepsilon^2)$), for the same constant $\mathfrak{C}$, in contrast with a conjecture by Aldous. Finally, our results answer a question by Devroye, Eide and Pralat on the asymptotic burning number of mean $1$ finite variance Bienaymé trees of size $n$, by showing that it lies between $(c+o(1)) n^{1/3}$ and $(2c+o(1))n^{1/3}$ with high probability, for a constant $c$ that only depends on the offspring variance.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Probability (math.PR) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.40150 — 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-11-01T02:14:58.651Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).