Publication Type
Journal Article
Version
publishedVersion
Publication Date
11-2011
Abstract
We have found that known community identification algorithms produce inconsistent communities when the node ordering changes at input. We use the pairwise membership probability and consistency to quantify the level of consistency across multiple runs of an algorithm. Based on these two metrics, we address the consistency problem without compromising the modularity. The key insight of the algorithm is to use pairwise membership probabilities as link weights. It offers a new tool in the study of community structures and their evolutions.
Keywords
Complex networks, Community structure, Modularity
Discipline
Databases and Information Systems | OS and Networks
Research Areas
Data Science and Engineering
Publication
Journal of the Korean Physical Society
Volume
59
Issue
5
First Page
3128
Last Page
3132
ISSN
0374-4884
Identifier
10.3938/jkps.59.3128
Publisher
Han'guk Mulli Hakhoe,Korean Physical Society
Citation
1
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.3938/jkps.59.3128