Abstract:
The paper presents new versions of modularity measure for directed weighted graphs with overlapping communities. We consider several approaches to computing modularity and try to extend them. Taking into account computational complexity, we suggest two parallelized extensions which are scalable to large graphs (more than 104 nodes).
Keywords:
modularity, community detection, PageRank, LinkRank, belonging function, belonging coefficient.
Funding agency
This research was collaborated with and supported by Russian Research Center, Huawei Technologies.
Bibliographic databases:
Document Type:
Article
Language: English
Citation:
Mikhail Drobyshevskiy, Anton Korshunov, Denis Turdakov, “Parallel modularity computation for directed weighted graphs with overlapping communities”, Proceedings of ISP RAS, 28:6 (2016), 153–170