Latent Geometry-Driven Network Automata for Complex Network Dismantling
Thomas Adler, Marco Grassia, Ziheng Liao, Giuseppe Mangioni, Carlo Vittorio Cannistraci
Abstract
Complex networks model the structure and function of critical technological, biological, and communication systems. Network dismantling, the targeted removal of nodes to fragment a network, is essential for analyzing and improving system robustness. Existing dismantling methods suffer from key limitations: they depend on global structural knowledge, exhibit slow running times on large networks, and overlook the network’s latent geometry, a key feature known to govern the dynamics of complex systems. Motivated by these findings, we introduce Latent Geometry-Driven Network Automata (LGD-NA), a novel framework that leverages local network automata rules to approximate effective link distances between interacting nodes. LGD-NA is able to identify critical nodes and capture latent manifold information of a network for effective and efficient dismantling. We show that this latent geometry-driven approach outperforms all existing dismantling algorithms, including spectral Laplacian-based methods and machine learning ones such as graph neural networks and . We also find that a simple common-neighbor-based network automata rule achieves near state-of-the-art performance, highlighting the effectiveness of minimal local information for dismantling. LGD-NA is extensively validated on the largest and most diverse collection of real-world networks to date (1,475 real-world networks across 32 complex systems domains) and scales efficiently to large networks via GPU acceleration. Finally, we leverage the explainability of our common-neighbor approach to engineer network robustness, substantially increasing the resilience of real-world networks. We validate LGD-NA's practical utility on domain-specific functional metrics, spanning neuronal firing rates in the Drosophila Connectome, transport efficiency in flight maps, outbreak sizes in contact networks, and communication pathways in terrorist cells. Our results confirm latent geometry as a fundamental principle for understanding the robustness of real-world systems, adding dismantling to the growing set of processes that network geometry can explain.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Related papers
- Learning Network Dismantling Without Handcrafted InputsHaozhe Tian, Pietro Ferraro, Robert N. Shorten, Mahdi Jalili et al.AAAI 2026 · 1 citation
- Encoding Node Diffusion Competence and Role Significance for Network DismantlingJiazheng Zhang, Bang WangWWW 2023 · 8 citations
- Network Dismantling via Reverse Dismantling: Static and Dynamic AlgorithmsJinyu Duan, Sijin Wang, Fan Zhang, Xiang Zhao et al.WWW 2026
- Demystifying Graph Sparsification Algorithms in Graph Properties PreservationYuhan Chen, Haojie Ye, Sanketh Vedula, Alex M. Bronstein et al.VLDB 2024 · 29 citations
- Spectral Basis Learning for Expressive Graph Neural Networks in Link PredictionNiloofar Azizi, Nils M. Kriege, Nicholas J. A. Harvey, Horst BischofAAAI 2026
