Comparison of Communities Detection Algorithms for Multiplex

Abstract

Multiplex is a set of graphs on the same vertex set, i.e. $\{G(V,E_1),\dots ,G(V,E_m)\}$. It is a generalized graph to model multiple relationships with parallel edges between vertices. This paper is a literature review of existing communities detection algorithms for multiplex and a comparative analysis of them.

References in corpus (7)

• Modularity and community structure in networks
• The structure and dynamics of multilayer networks
• Multirelational Organization of Large-scale Social Networks in an Online World
• Emergence of network features from multiplexity
• Stability of Boolean Multilevel Networks
• Node-Context Network Clustering using PARAFAC Tensor Decomposition
• An Introduction to Community Detection in Multi-layered Social Network

Cited by in corpus (1)

• Stochastic Block Models for Multiplex networks: an application to networks of researchers