Fast algorithm for detecting community structure in networks

Details Fast algorithm for detecting community structure in networks Fast algorithm for detecting community structure in networks

2003-09-22

arxiv.org/abs/cond-mat/0309508v1

Phys. Rev. E 69, 066133 (2004)

Physics

Condensed Matter

Statistical Mechanics

5 pages, 4 figures

Scientific paper

10.1103/PhysRevE.69.066133

It has been found that many networks display community structure -- groups of vertices within which connections are dense but between which they are sparser -- and highly sensitive computer algorithms have in recent years been developed for detecting such structure. These algorithms however are computationally demanding, which limits their application to small networks. Here we describe a new algorithm which gives excellent results when tested on both computer-generated and real-world networks and is much faster, typically thousands of times faster than previous algorithms. We give several example applications, including one to a collaboration network of more than 50000 physicists.

Affiliated with

Also associated with

No associations

Rating

Fast algorithm for detecting community structure in networks 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 Fast algorithm for detecting community structure in networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast algorithm for detecting community structure in networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-161016