Cycle-tree guided attack of random K-core: Spin glass model and efficient message-passing algorithm
Abstract
The K-core of a graph is the maximal subgraph within which each vertex is connected to at least K other vertices. It is a fundamental network concept for understanding threshold cascading processes with a discontinuous percolation transition. A minimum attack set contains the smallest number of vertices whose removal induces complete collapse of the K-core. Here we tackle this prototypical optimal initial-condition problem from the spin-glass perspective of cycle-tree maximum packing and propose a cycle-tree guided attack (CTGA) message-passing algorithm. The good performance and time efficiency of CTGA are verified on the regular random and Erd\"os-R\'enyi random graph ensembles. Our central idea of transforming a long-range correlated dynamical process to static structural patterns may also be instructive to other hard optimization and control problems.
Cite
@article{arxiv.2110.05940,
title = {Cycle-tree guided attack of random K-core: Spin glass model and efficient message-passing algorithm},
author = {Hai-Jun Zhou},
journal= {arXiv preprint arXiv:2110.05940},
year = {2022}
}
Comments
A label in Figure 3(b) was corrected