Format

Send to

Choose Destination
See comment in PubMed Commons below
J Stat Mech. 2006 Sep 1;9:p09014.

Finding mesoscopic communities in sparse networks.

Author information

1
Ariadne Genomics Inc., 9700 Great Seneca Highway, Suite 113, Rockville, MD 20850, USA, E-mail: iispolat@lauca.usach.cl , mazo@ariadnegenomics.com and ayuryev@ariadnegenomics.com.

Abstract

We suggest a fast method for finding possibly overlapping network communities of a desired size and link density. Our method is a natural generalization of the finite-T superparamagnetic Potts clustering introduced by Blatt et al (1996 Phys. Rev. Lett.76 3251) and the annealing of the Potts model with a global antiferromagnetic term recently suggested by Reichard and Bornholdt (2004 Phys. Rev. Lett.93 21870). Like in both cited works, the proposed generalization is based on ordering of the ferromagnetic Potts model; the novelty of the proposed approach lies in the adjustable dependence of the antiferromagnetic term on the population of each Potts state, which interpolates between the two previously considered cases. This adjustability allows one to empirically tune the algorithm to detect the maximum number of communities of the given size and link density. We illustrate the method by detecting protein complexes in high-throughput protein binding networks.

PubMed Commons home

PubMed Commons

0 comments
How to join PubMed Commons

    Supplemental Content

    Full text links

    Icon for PubMed Central
    Loading ...
    Support Center