Detecting the optimal number of communities in complex networks

Details Detecting the optimal number of communities in complex networks Detecting the optimal number of communities in complex networks

2011-03-30

arxiv.org/abs/1103.5946v1

Physics

Physics and Society

8 pages, 6 figs

Scientific paper

To obtain the optimal number of communities is an important problem in detecting community structure. In this paper, we extend the measurement of community detecting algorithms to find the optimal community number. Based on the normalized mutual information index, which has been used as a measure for similarity of communities, a statistic $\Omega(c)$ is proposed to detect the optimal number of communities. In general, when $\Omega(c)$ reaches its local maximum, especially the first one, the corresponding number of communities \emph{c} is likely to be optimal in community detection. Moreover, the statistic $\Omega(c)$ can also measure the significance of community structures in complex networks, which has been paid more attention recently. Numerical and empirical results show that the index $\Omega(c)$ is effective in both artificial and real world networks.

Affiliated with

Also associated with

No associations

Rating

Detecting the optimal number of communities in complex 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 Detecting the optimal number of communities in complex networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Detecting the optimal number of communities in complex networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-568721