Community Detection in Graphs

Community Detection in Graphs

Complexity and Graph Theory: A Brief Note

Santo Fortunato has published an interesting and densly rich article, Community Detection in Graphs, in  Complexity (Inter-Wiley). This article is over 100 pages long, it is relatively complete, with numerous references and excellent figures.

It is a bit surprising, however, that this extensive discussion misses one of the things that would seem to be most important in discussing graphs, and particularly, clusters within graphs: the stability of these clusters. That is; the theoretical basis for cluster stability.

Yedidia et al., in Understanding Belief Propagation, makes the point that there is a close connection between Belief Propagation (BP) and the Bethe approximation of statistical physics. This suggests there is a way to construct new message-passing algorithms. In particular, more general approaches to the work undertaken by Bethe’s approximation, namely  the Cluster Variation Method (CVM) introduced by Kikuchi and later by Kikuchi and Brush, generalize the Bethe approximation. In essence, the free energy is minimized across not only distribution between simple “on” and “off” states, but also across the distribution of physical clusters. This expansion of the entropy concept into cluster distribution (across the available types of clusters) is important.

Free energy minimization provides a natural and intuitive means for determining “equilibrium,” or at least, “reasonably stationary” system states. These would correspond to natural evolutions of communities which can be interpreted as clusters.

Pelizzola, in Cluster Variation Method in Statistical Physics and Probabilistic Graphical Models points out that graph theory subsumes CVM and other approximation methods. This makes graph theory the nexus at which the CVM methods, belief inference, and community-formation “connect.” Or perhaps, they form an interesting “graph community.”

References:

Leave a Reply

Your email address will not be published. Required fields are marked *