Computing communities in large networks using random walks (long version)

Details Computing communities in large networks using random walks (long version) Computing communities in large networks using random walks (long version)

2005-12-12

arxiv.org/abs/physics/0512106v1

Physics

Physics and Society

20 pages, 5 figures, long version

Scientific paper

Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expensive. We propose here a measure of similarities between vertices based on random walks which has several important advantages: it captures well the community structure in a network, it can be computed efficiently, and it can be used in an agglomerative algorithm to compute efficiently the community structure of a network. We propose such an algorithm, called Walktrap, which runs in time O(mn^2) and space O(n^2) in the worst case, and in time O(n^2log n) and space O(n^2) in most real-world cases (n and m are respectively the number of vertices and edges in the input graph). Extensive comparison tests show that our algorithm surpasses previously proposed ones concerning the quality of the obtained community structures and that it stands among the best ones concerning the running time.

Affiliated with

Also associated with

No associations

Rating

Computing communities in large networks using random walks (long version) 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 Computing communities in large networks using random walks (long version), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing communities in large networks using random walks (long version) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-36759