Statistical mechanics of maximal independent sets

Abstract

The graph theoretic concept of maximal independent set arises in several practical problems in computer science as well as in game theory. A maximal independent set is defined by the set of occupied nodes that satisfy some packing and covering constraints. It is known that finding minimum-and maximum-density maximal independent sets are hard optimization problems. In this paper we use cavity method of statistical physics and Monte Carlo simulations to study the corresponding constraint satisfaction problem on random graphs. We obtain the entropy of maximal independent sets within the replica symmetric and one-step replica symmetry breaking frameworks, shedding light on the metric structure of the landscape of solutions and suggesting a class of possible algorithms. This is of particular relevance for the application to the study of strategic interactions in social and economic networks, where maximal independent sets correspond to pure Nash equilibria of a graphical game of public goods allocation.

Stochastic stability in best shot network games

“…It is an NP-hard problem to enumerate all the elements of N , 8 and to identify, among them, those that maximize and minimize the set C (x) of contributors. For extensive discussions on this point see Dall'Asta et al (2009) and. Here we provide two examples, the second one illustrates how even very homogeneous networks may display a large variability of contributors in different equilibria.…”

“…Most of these problems deal with discrete choices. Traffic is an intuitive and appealing example, 4 while others are given in the introduction of Dall'Asta et al (2011).…”

The Negativity‐to‐Violation Map between Wigner Function and Quantum Contextuality Inequality for a Single Qudit

“…[19] In other words, the independence number of graph α G plus the number of vertices in the minimum vertex cover will become the total number of vertices in the graph. There are two subsets of vertices V G related to our work.…”

“…By using Equation (19), Equation (20), and Equation (21), it is easy to find that projectors P t are orthogonal to [u,v] 1 , [u,v] 2 , and [u,v] 3 . By using Equation (19), Equation (20), and Equation (21), it is easy to find that projectors P t are orthogonal to [u,v] 1 , [u,v] 2 , and [u,v] 3 .…”

The Statistical Mechanics of Random Set Packing and a Generalization of the Karp-Sipser Algorithm

“…It has statistical properties with respect to the MSP problem quite different from those encountered in G , as we will readily show. The MSP problem on G ( , ) with = 2 is equivalent to the well known problem of maximum independent sets on Poissonian graphs [14,32]. The real parameter characterizing discrete support distributions of messages has to satisfy the fixed point (24) that reads * = (1…”