arXiv (All)
open access
Distances in $m$-ary recursive trees
We introduce the $m$-ary recursive tree, a tree structure that starts with a single node. At each step of the growth process, a random node, called the recruiter, is selected, and $m$ new nodes are attached to this recruiter. The main objective is an asymptotic analysis of distances in this struct
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
- Asymptotic behavior of large combinatorial structures#634927
- Maximal Minimal Spacing for Random Points#926067
- Improved bounds for lines and $1$-separated sets in Euclidean Ramsey theory#819399
- Improved bounds for lines and $1$-separated sets in Euclidean Ramsey theory#809406
- A Note on Sphere Packing Bounds for Tuple Lattice Sieving#985566
Record · ID 1118709
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