arXiv (All)
open access
Packing and covering random trees
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 precis
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
- Limits of descent-biased trees#1109458
- Gaussian and non-Gaussian limits for the total edge-length of random directional nearest-neighbour graphs#1491748
- Common Problems and Uncommon Solutions in the Law of TORT: A Comparative Study#208503
- Endpoint Covering of Axis-Parallel Segments:Bichromatic and Monochromatic One-Center#1077748
- Log canonical thresholds of high multiplicity reduced plane curves#821647
Record · ID 1491758
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