arXiv (All)
open access
Largest connected component in duplication-divergence growing graphs with symmetric coupled divergence
The largest connected component in duplication-divergence growing graphs with symmetric coupled divergence is studied. Finite-size scaling reveals a phase transition occurring at a divergence rate $δ_c$. The $δ_c$ found is close to the locus of zero in Euler characteristic of finite-size graphs know
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
- On the Expressive Power of Implicit Line-Graph Higher-Order Weisfeiler--Leman#1110772
- Percolation in the Stochastic Block Model#1063352
- HERALD: High-Fidelity Exemplar Retrieval with Adaptive Landmark Distillation for Heterophily-Aware Graph Condensation#998676
- Collective drift and pinning in active rotator networks with Kuramoto coupling and mixed-sign feedback disorder#999809
- Spectral Gap of Down-Up Walks via Trickle-Down: A Simplified and Sharpened Analysis#1014108
Record · ID 1049739
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