Quick search Find article
Quick search
Find article

Finding mesoscopic communities in sparse networks

I Ispolatov1, I Mazo and A Yuryev

Show affiliations


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 Reichardt and Bornholdt (2004 Phys. Rev. Lett. 93 218701). 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.


Keywords

random graphs, networks

molecular networks (experiment)

genomic and proteomic networks

 

E-print Number: q-bio.MN/0512038

Cited: by |

Refers: to

PACS

87.14.E- Proteins

87.15.B- Structure of biomolecules

87.15.M- Spectra of biomolecules

MSC

92D20 Protein sequences, DNA sequences

92C40 Biochemistry, molecular biology

Subjects

Biological physics

Dates

Issue 09 (September 2006)

Received 29 June 2006, accepted for publication 7 September 2006

Published 26 September 2006



  1. Finding mesoscopic communities in sparse networks

    I Ispolatov et al J. Stat. Mech. (2006) P09014

View by subject




Export








Please login to access our web services, or create an account if you don't yet have one.

You must have cookies enabled in your web browser to be able to login.

Username
Password

Forgotten your password? Get a new one here.