Consistent community identification in complex networks

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...

Full description

Saved in:
Bibliographic Details
Main Authors: KWAK, Haewoon, EOM, Young-Ho, CHOI, Yoonchan, JEONG, Hawoong
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2011
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/5325
https://ink.library.smu.edu.sg/context/sis_research/article/6329/viewcontent/consistent_comm___PV.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
Description
Summary: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.