Detecting Network Communities: a new systematic and efficient algorithm

Details Detecting Network Communities: a new systematic and efficient algorithm Detecting Network Communities: a new systematic and efficient algorithm

2004-04-27

arxiv.org/abs/cond-mat/0404652v2

J. Stat. Mech. (2004) P10012

Physics

Condensed Matter

Statistical Mechanics

8 pages, 6 figures. minor changes and some references added, to be published in JSTAT

Scientific paper

10.1088/1742-5468/2004/10/P10012

An efficient and relatively fast algorithm for the detection of communities in complex networks is introduced. The method exploits spectral properties of the graph Laplacian-matrix combined with hierarchical-clustering techniques, and includes a procedure to maximize the ``modularity'' of the output. Its performance is compared with that of other existing methods, as applied to different well-known instances of complex networks with a community-structure: both computer-generated and from the real-world. Our results are in all the tested cases, at least, as good as the best ones obtained with any other methods, and faster in most of the cases than methods providing similar-quality results. This converts the algorithm in a valuable computational tool for detecting and analyzing communities and modular structures in complex networks.

Affiliated with

Also associated with

No associations

Rating

Detecting Network Communities: a new systematic and efficient algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Detecting Network Communities: a new systematic and efficient algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Detecting Network Communities: a new systematic and efficient algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-510992