arXiv (All)
open access
Local network evolution rules driving shortest path multiplicity
combinatoricsdisordered-systems-and-neural-networksphysics-and-societysocial-and-information-networks
The shortest path multiplicity, here denoted by $μ$, is an important metric of complex networks. For real networks $μ$ is high and it correlates with the network community structure. Since local network evolution induces network communities, it is possible that a high shortest path multiplicity is 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
- Stabilising effect of modularity in antagonistic networks depends on intraguild interactions#1149565
- Link Fraction Mixed Membership Reveals Community Diversity in Aggregated Social Networks#1248343
- Local Limits of Small World Networks#177031
- Predicting missing links in food webs using stacked models and species traits#1133989
- Representation-Aware Modularity with a Distance-Calibrated Null Model#1216463
Record · ID 1343585
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