Network dismantling deals with the removal of nodes or edges to disrupt the largest connected component of a network. In this work we introduce CoreGDM, a trainable algorithm for network dismantling via node-removal. The approach is based on Geometric Deep Learning and that merges the Graph Dismantling Machine (GDM) [19] framework with the CoreHD [40] algorithm, by attacking the 2-core of the network using a learnable score function in place of the degree-based one. Extensive experiments on fifteen real-world networks show that CoreGDM outperforms the original GDM formulation and the other state-of-the-art algorithms, while also being more computationally efficient.
CoreGDM: Geometric Deep Learning Network Decycling and Dismantling
Grassia M.;Mangioni G.
2023-01-01
Abstract
Network dismantling deals with the removal of nodes or edges to disrupt the largest connected component of a network. In this work we introduce CoreGDM, a trainable algorithm for network dismantling via node-removal. The approach is based on Geometric Deep Learning and that merges the Graph Dismantling Machine (GDM) [19] framework with the CoreHD [40] algorithm, by attacking the 2-core of the network using a learnable score function in place of the degree-based one. Extensive experiments on fifteen real-world networks show that CoreGDM outperforms the original GDM formulation and the other state-of-the-art algorithms, while also being more computationally efficient.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
