arXiv (All)
open access
Universal Exponent-Two Degree Laws in Range-Renewal Networks
Let an infinite sequence of independent and identically distributed random variables over a countable alphabet generate a graph by joining consecutive symbols and suppressing repeated edges. We determine the exact tail and local asymptotics of the limiting degree distributions of this range-renewal
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
- Tight Lower Bounds for Differentially Private Continual Counting#1034780
- Graphlet- and motif-based link prediction in large networks.#371453
- Global Complete Synchronization in Networks of Identical Stuart--Landau Oscillators#1130500
- Equitable Partition Realizability for Dynamics-preserving and Privacy-aware Network Reconstruction#1122764
- The Spectral Region of Two-Layer Renewal Stochastic Matrices#1115724
Record · ID 972226
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