Statistical Mechanics of the Minimum Dominating Set Problem

Abstract

The minimum dominating set problem has wide applications in network science and related fields. It consists of assembling a node set of global minimum size such that any node of the network is either in this set or is adjacent to at least one node of this set. Although this is a difficult optimization problem in general, we show it can be exactly solved by a generalized leaf-removal process if the network contains no core. If the network has an extensive core, we estimate the size of minimum dominating sets by a mean-field theory and implement a belief-propagation algorithm to obtain near-optimal solutions. Our algorithms also perform well on real-world network instances.

Extensively revised (final version to be published in Journal of Statistical Physics). 19 pages in total

References in corpus (8)

• Gibbs States and the Set of Solutions of Random Constraint Satisfaction Problems
• Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design
• Graph Evolution: Densification and Shrinking Diameters
• Robust network community detection using balanced propagation
• Network Observability Transitions
• Distance-d covering problems in scale-free networks with degree correlations
• Minimal contagious sets in random regular graphs
• Statistical physics of hard combinatorial optimization: The vertex cover problem