arXiv (OAI Expanded)
open access
Convergence and compactness of discrete aggregation trees
We study a class of random aggregation trees that generalizes the discrete stick-breaking construction of the uniform labelled tree (Aldous, 1991). To sample the tree of size $n$, vertices are added sequentially, with the $i$th vertex starting a new branch with a prescribed probability $f(n,i)$; oth
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
- First-Passage Percolation on Spread-out line graphs: Microscopic Regime#821967
- Competing bootstrap processes on the random graph $G(n,p)$#984796
- The interval posets of permutations seen from the decomposition tree perspective#156434
- The rank and layer distributions in random recursive trees#620415
- The rank and layer distributions in random recursive trees#618736
Record · ID 1070568
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