arXiv (OAI Expanded)
open access
Limits of descent-biased trees
We investigate scaling and local limits of random trees biased according to their number of descents. A descent in a rooted labeled tree $t$ is a parent-child pair such that the label of the parent is greater than the label of the child, and the total number of descents is denoted by $\mathrm{des}(t
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
- A Note on Diameter Certification in Trees#363231
- Riesz transform on eventually Gaussian local trees#1119404
- Statistics of multivariate extremes under random censoring#1142210
- Large deviations for the CRT#1070272
- A Central Limit Theorem for Coprime Pair Counts in Randomly Translated Disks#1083682
Record · ID 1109458
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