Latent Geometry-Driven Network Automata for Complex Network Dismantling
Thomas Adler, Marco Grassia, Ziheng Liao, Giuseppe Mangioni, Carlo Vittorio Cannistraci
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
相关 Paper
- Learning Network Dismantling Without Handcrafted InputsHaozhe Tian, Pietro Ferraro, Robert N. Shorten, Mahdi Jalili 等AAAI 2026 · 被引用 1 次
- Encoding Node Diffusion Competence and Role Significance for Network DismantlingJiazheng Zhang, Bang WangWWW 2023 · 被引用 8 次
- Network Dismantling via Reverse Dismantling: Static and Dynamic AlgorithmsJinyu Duan, Sijin Wang, Fan Zhang, Xiang Zhao 等WWW 2026
- Demystifying Graph Sparsification Algorithms in Graph Properties PreservationYuhan Chen, Haojie Ye, Sanketh Vedula, Alex M. Bronstein 等VLDB 2024 · 被引用 29 次
- Spectral Basis Learning for Expressive Graph Neural Networks in Link PredictionNiloofar Azizi, Nils M. Kriege, Nicholas J. A. Harvey, Horst BischofAAAI 2026
