A Method to Find Community Structures Based on Information Centrality

Details A Method to Find Community Structures Based on Information Centrality A Method to Find Community Structures Based on Information Centrality

2004-02-20

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

Physics

Condensed Matter

Statistical Mechanics

13 pages, 13 figures. Final version accepted for publication in Physical Review E

Scientific paper

10.1103/PhysRevE.70.056104

Community structures are an important feature of many social, biological and technological networks. Here we study a variation on the method for detecting such communities proposed by Girvan and Newman and based on the idea of using centrality measures to define the community boundaries (M. Girvan and M. E. J. Newman, Community structure in social and biological networks Proc. Natl. Acad. Sci. USA 99, 7821-7826 (2002)). We develop an algorithm of hierarchical clustering that consists in finding and removing iteratively the edge with the highest information centrality. We test the algorithm on computer generated and real-world networks whose community structure is already known or has been studied by means of other methods. We show that our algorithm, although it runs to completion in a time O(n^4), is very effective especially when the communities are very mixed and hardly detectable by the other methods.

Affiliated with

Also associated with

No associations

Rating

A Method to Find Community Structures Based on Information Centrality 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 A Method to Find Community Structures Based on Information Centrality, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Method to Find Community Structures Based on Information Centrality will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-709159