dorsal/arxiv
View SchemaCore-periphery organization of complex networks
| Authors | Petter Holme |
|---|---|
| Categories | |
| ArXiv ID | physics/0506035 |
| URL | https://arxiv.org/abs/physics/0506035 |
| DOI | 10.1103/PhysRevE.72.046111 |
| Journal | Phys. Rev. E 72, 046111 (2005) |
Abstract
Networks may, or may not, be wired to have a core that is both itself densely connected and central in terms of graph distance. In this study we propose a coefficient to measure if the network has such a clear-cut core-periphery dichotomy. We measure this coefficient for a number of real-world and model networks and find that different classes of networks have their characteristic values. For example do geographical networks have a strong core-periphery structure, while the core-periphery structure of social networks (despite their positive degree-degree correlations) is rather weak. We proceed to study radial statistics of the core, i.e. properties of the n-neighborhoods of the core vertices for increasing n. We find that almost all networks have unexpectedly many edges within n-neighborhoods at a certain distance from the core suggesting an effective radius for non-trivial network processes.
{
"annotation_id": "5d9d3700-3043-4adc-ad95-289fd9c9b2e3",
"date_created": "2026-03-02T18:01:00.580000Z",
"date_modified": "2026-03-02T18:01:00.580000Z",
"file_hash": "a800785b1bf8ffb331794c6f84ea803388f1bb369dae6d1b286eb487971dbac4",
"private": false,
"record": {
"abstract": "Networks may, or may not, be wired to have a core that is both itself densely\nconnected and central in terms of graph distance. In this study we propose a\ncoefficient to measure if the network has such a clear-cut core-periphery\ndichotomy. We measure this coefficient for a number of real-world and model\nnetworks and find that different classes of networks have their characteristic\nvalues. For example do geographical networks have a strong core-periphery\nstructure, while the core-periphery structure of social networks (despite their\npositive degree-degree correlations) is rather weak. We proceed to study radial\nstatistics of the core, i.e. properties of the n-neighborhoods of the core\nvertices for increasing n. We find that almost all networks have unexpectedly\nmany edges within n-neighborhoods at a certain distance from the core\nsuggesting an effective radius for non-trivial network processes.",
"arxiv_id": "physics/0506035",
"authors": [
"Petter Holme"
],
"categories": [
"physics.soc-ph"
],
"doi": "10.1103/PhysRevE.72.046111",
"journal_ref": "Phys. Rev. E 72, 046111 (2005)",
"title": "Core-periphery organization of complex networks",
"url": "https://arxiv.org/abs/physics/0506035"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "7d396c17-a917-41b1-a601-e3d65bb5d294",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}