arXiv (All)
open access
Total Path Length in Power-Weight Recursive Trees: Martingale Limits and Global Fluctuations
We study total path length in recursive trees with positive deterministic attachment weights. Writing $W_n=\sum_{i=1}^n w_i$ and $p_n=w_n/W_n$, we obtain exact martingale-innovation identities and a variance recurrence. Under the condition $p_n=O(n^{-1})$, centered total path length divided by $n$ c
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
- Very sharp distance and range transitions for random walk bridges on Ramanujan graphs#1129810
- Extending Subsampling to Sequential Stopping#820732
- Exact Average Consensus under Noisy Communication Links: A Decentralized Gradient Perspective#1064626
- Extended shapes for the combinatorial design of RNA sequences#622710
- The recasting bound atlas on pair production of vector-like quarks#819597
Record · ID 1155549
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