Local network evolution rules drive shortest path multiplicity
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913162283974656 |
|---|---|
| author | Vazquez, Alexei |
| author_facet | Vazquez, Alexei |
| contents | The shortest path multiplicity is an important metric of complex networks. The shortest path multiplicity of real networks is high and it correlates with their community structure. Since local network evolution induces network communities, it is possible that a high shortest path multiplicity is the natural expectation of local evolution rules. Here I demonstrate, by means of numerical simulations, that this is indeed the case. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_25237 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Local network evolution rules drive shortest path multiplicity Vazquez, Alexei Physics and Society Disordered Systems and Neural Networks Social and Information Networks Combinatorics The shortest path multiplicity is an important metric of complex networks. The shortest path multiplicity of real networks is high and it correlates with their community structure. Since local network evolution induces network communities, it is possible that a high shortest path multiplicity is the natural expectation of local evolution rules. Here I demonstrate, by means of numerical simulations, that this is indeed the case. |
| title | Local network evolution rules drive shortest path multiplicity |
| topic | Physics and Society Disordered Systems and Neural Networks Social and Information Networks Combinatorics |
| url | https://arxiv.org/abs/2605.25237 |