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 (11)
- Finding and evaluating community structure in networks
- Community detection in graphs
- Uncovering the overlapping community structure of complex networks in nature and society
- Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
- Link communities reveal multiscale complexity in networks
- Line Graphs, Link Partitions and Overlapping Communities
- Fuzzy communities and the concept of bridgeness in complex networks
- A sequential algorithm for fast clique percolation
- Exposing Multi-Relational Networks to Single-Relational Network Analysis Algorithms
- Detecting Communities in Networks by Merging Cliques
- Towards effective visual analytics on multiplex and multilayer networks