Comparison of communities detection algorithms for multiplex

Chuan Wen Loe and Henrik Jeldtoft Jensen

Physica A: Statistical Mechanics and its Applications, 2015, vol. 431, issue C, 29-45

Abstract: Multiplex is a set of graphs on the same vertex set, i.e. {G(V,E1),…,G(V,Em)}. It is a type of generalized graph to model the multiple relationships in a system with parallel edges between vertices. An important application in Network Science is to capture community structures in multiplex as a way to modularize the system. This paper is a literature review and comparative analysis on the existing communities detection algorithms for multiplex. The conclusion is that many of the algorithms deviate in the concept of multi-relational communities and the wrong choice of algorithm can deviate one from his intended concept.

Keywords: Multiplex; Communities detection (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437115002125
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:431:y:2015:i:c:p:29-45

DOI: 10.1016/j.physa.2015.02.089

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().