Random field Ising model and community structure in complex networks

Abstract

We propose a method to find out the community structure of a complex network. In this method the ground state problem of a ferromagnetic random field Ising model is considered on the network with the magnetic field $B_s=+\infty$, $B_t=-\infty$, and $B_{i\ne s,t}=0$ for a node pair $s$ and $t$. The ground state problem is equivalent to the so-called maximum flow problem, which can be solved exactly numerically with the help of a combinatorial optimization algorithm. The community structure is then identified from the ground state Ising spin domains for all pairs of $s$ and $t$. Our method provides a criterion for the existence of the community structure, and is applicable to unweighted and weighted networks equally well. We demonstrate the performance of the method by applying it to the Barabási-Albert network, Zachary karate club network, the scientific collaboration network, and the stock price correlation network.

7 pages, 4 figures

References in corpus (1)

• Subnetwork hierarchies of biochemical pathways

Cited by in corpus (5)

• Robust network community detection using balanced propagation
• Majority Model on a network with communities
• Accuracy and Precision of Methods for Community Identification in Weighted Networks
• Broad lifetime distributions for ordering dynamics in complex networks
• Random field Ising model on networks with inhomogeneous connections