Network dismantling on factor graphs: break long loops and spare local structures

Abstract

A new solution framework for the task of network dismantling is recently developed, based on a two-scale bipartite factor-graph representation of the original graph where local structures are abstracted as factor nodes. This technique leads to advancement of extant dismantling algorithms, among which the belief-propagation decimation (BPD) algorithm has an efficient counterpart (factor BPD, i.e., FBPD) on the factor graph, building upon a mean-field spin-glass theory developed for the underlying long-loop feedback vertex set (FVS) problem. In this paper, I (1) demonstrate the advantage as well as disadvantage of the new factor-graph approach, and investigate the varying choice of factors, (2) show that the method can be supported by an alternative microscopic picture, and the two distinct spin-glass theories derive equivalent outcomes, whose analytical results serve as lower bounds for the FVS size on random regular factor graphs, besides (3) an extra mathematical lower bound from the result on random regular (original) graphs. Performances of graph/factor-graph algorithms are compared on various real networks. It shows empirically and analytically that the factor-graph approach does not interfere with what we could achieve without applying this technique; the new approach does a good job where traditional algorithms may perform poorly.