Finding overlapping communities in multiplex networks
classification
💻 cs.SI
physics.soc-ph
keywords
cliquecommunitiesmultiplexnetworksoverlappingpercolationadjacencyalgorithm
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.