Metraipolis › archive › dc_4fd753a63f3f
Criticality and universality in network dismantling — arXiv:2608.27613
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.27613
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T10:58:05.786Z
- SHA-256 of the archived text
4cc6d3e6b38084baf9565d69c26db5b347bb700c99eda5396b0b3260f62f0400- Stable URL of this page
https://metraipolis.com/documento/dc_4fd753a63f3f
How to cite
Criticality and universality in network dismantling — arXiv:2608.27613 — arXiv (en), https://arxiv.org/abs/2608.27613 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4fd753a63f3f (Metraipolis archive dc_4fd753a63f3f, sha256 4cc6d3e6b38084baf9565d69c26db5b347bb700c99eda5396b0b3260f62f0400)
BibTeX
@misc{dc4fd753a63f3f,
title = {Criticality and universality in network dismantling — arXiv:2608.27613},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.27613},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4fd753a63f3f; sha256 4cc6d3e6b38084baf9565d69c26db5b347bb700c99eda5396b0b3260f62f0400},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.27613. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Identifying the smallest set of elements whose removal dismantle a complex network, known as the network dismantling problem, is a fundamental task with many practical applications. Whereas network dismantling has been extensively studied over the past decade, most work has focused on developing efficient algorithms for large but finite networks. By contrast, the physics of the network dismantling process, namely how the network structural connectivity is affected by the removal of nodes or edges, remains largely unexplored in the thermodynamic limit. Here, we shed light on this understudied aspect of network dismantling by introducing an adaptive biased percolation process able to optimally dismantle a network. Through a systematic analysis of synthetic network models, we find that the proposed percolation process displays a universal phase transition, characterized by the abrupt and simultaneous disappearance of both the giant connected component and the largest 2-core, across networks with markedly different degree distributions. Simulations on real networks further support this universality, indicating that the physics of network dismantling is insensitive to a broad range of topological properties. Together, these results suggest that a topology-agnostic theory could be developed to explain the critical behavior of network dismantling. Tema degli esploratori: governance digitale e beni comuni (retro-catalogo arXiv: annunci del 2026-08-31 in cs.SI). Categorie arXiv: Physics and Society (physics.soc-ph) ; Statistical Mechanics (cond-mat.stat-mech); Social and Information Networks (cs.SI). Pagina del lavoro: https://arxiv.org/abs/2608.27613 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-17T10:49:35.962Z dalla pagina https://arxiv.org/catchup/cs.SI/2026-08-31?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).