Comparison of Communities Detection Algorithms for Multiplex

TL;DR

This paper reviews and compares various community detection algorithms designed for multiplex networks, which model multiple types of relationships between the same set of vertices.

Contribution

It provides a comprehensive literature review and a comparative analysis of existing community detection algorithms for multiplex networks.

Findings

Identifies key algorithms used for multiplex community detection

Highlights strengths and limitations of different approaches

Provides insights into the effectiveness of various algorithms

Abstract

Multiplex is a set of graphs on the same vertex set, i.e. $\{G(V,E_1),\ldots,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.