Finding overlapping communities in multiplex networks
arXiv:1602.03746
Abstract
We define an approach to identify overlapping communities in multiplex networks, extending the popular clique percolation method for simple graphs. The extension requires to rethink the basic concepts on which the clique percolation algorithm is based, including cliques and clique adjacency, to allow the presence of multiple types of edges.
References in corpus (5)
- Uncovering the overlapping community structure of complex networks in nature and society
- Line Graphs, Link Partitions and Overlapping Communities
- A sequential algorithm for fast clique percolation
- Detecting Communities in Networks by Merging Cliques
- Towards effective visual analytics on multiplex and multilayer networks