Consistent Community Identification in Complex Networks

Cited 6 time in webofscience Cited 0 time in scopus
  • Hit : 535
  • Download : 250
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.
Publisher
KOREAN PHYSICAL SOC
Issue Date
2011-11
Language
English
Article Type
Article
Citation

JOURNAL OF THE KOREAN PHYSICAL SOCIETY, v.59, no.5, pp.3128 - 3132

ISSN
0374-4884
DOI
10.3938/jkps.59.3128
URI
http://hdl.handle.net/10203/93373
Appears in Collection
CS-Journal Papers(저널논문)PH-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 6 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0