Spin glass approach to the feedback vertex set problem

Abstract

A feedback vertex set (FVS) of an undirected graph is a set of vertices that contains at least one vertex of each cycle of the graph. The feedback vertex set problem consists of constructing a FVS of size less than a certain given value. This combinatorial optimization problem has many practical applications, but it is in the nondeterministic polynomial-complete class of worst-case computational complexity. In this paper we define a spin glass model for the FVS problem and then study this model on the ensemble of finite-connectivity random graphs. In our model the global cycle constraints are represented through the local constraints on all the edges of the graph, and they are then treated by distributed message-passing procedures such as belief propagation. Our belief propagation-guided decimation algorithm can construct nearly optimal feedback vertex sets for single random graph instances and regular lattices. We also design a spin glass model for the FVS problem on a directed graph. Our work will be very useful for identifying the set of vertices that contribute most significantly to the dynamical complexity of a large networked system.

9 pages, including 4 figures. Title slightly changed. Under consideration in EPJB

References in corpus (8)

• Ising formulations of many NP problems
• Finding undetected protein associations in cell signaling by belief propagation
• Statistical Mechanics of Steiner trees
• On the number of circuits in random graphs
• Algorithm for counting large directed loops
• Finding long cycles in graphs
• On the performance of a cavity method based algorithm for the Prize-Collecting Steiner Tree Problem on graphs
• Surface flux concentrations and spherical alpha-square dynamo

Cited by in corpus (32)

• Ising formulations of many NP problems
• Vital nodes identification in complex networks
• Network dismantling
• Generalized Network Dismantling
• Identifying optimal targets of network attack by belief propagation
• Fast and simple decycling and dismantling of networks
• Minimal contagious sets in random regular graphs
• A loop enhancement strategy for network robustness
• Underestimated cost of targeted attacks on complex networks
• Solving the undirected feedback vertex set problem by local search
• On Minimal Sets to Destroy the $k$-Core in Random Networks
• The characteristics of cycle-nodes-ratio and its application to network classification
• A new design principle of robust onion-like networks self-organized in growth
• Solving Statistical Mechanics on Sparse Graphs with Feedback Set Variational Autoregressive Networks
• Statistical physics of hard combinatorial optimization: The vertex cover problem
• Cycle-tree guided attack of random K-core: Spin glass model and efficient message-passing algorithm
• Minimum Long-Loop Feedback Vertex Set and Network Dismantling
• Minimal Dominating Set problem studied by simulated annealing and cavity method: Analytics and population dynamics
• Dismantling Efficiency and Network Fractality
• Spin glass phase transitions in the random feedback vertex set problem
• Optimal segmentation of directed graph and the minimum number of feedback arcs
• Hierarchical cycle-tree packing model for $K$-core attack problem
• Maximally flexible solutions of a random $K$-satisfiability formula
• A spin glass approach to the directed feedback vertex set problem
• Spin-glass model for the C-dismantling problem
• Effective Self-Healing Networks against Attacks or Disasters in Resource Allocation Control
• More Tolerant Reconstructed Networks by Self-Healing against Attacks in Saving Resource
• K-core attack, equilibrium K-core, and kinetically constrained spin system
• Lowest Degree Decomposition of Complex Networks
• Two-distance minimal dominating set problem studied by statistical mechanics and simulated annealing
• Ensemble approach for generalized network dismantling
• Fast convergence to an approximate solution by message-passing for complex optimizations