Parallel modularity computation for directed weighted graphs with overlapping communities

Parallel modularity computation for directed weighted graphs with overlapping communities

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 l...

Full description

Bibliographic Details
Main Authors: Mikhail Drobyshevskiy, Anton Korshunov, Denis Turdakov
Format: Article
Language:English
Published: Ivannikov Institute for System Programming of the Russian Academy of Sciences 2018-10-01
Series:Труды Института системного программирования РАН
Subjects:
модулярность
поиск сообществ
пэйдж-ранк
линк-ранк
функция принадлежности
коэффициент принадлежности
Online Access:https://ispranproceedings.elpub.ru/jour/article/view/210

Similar Items

Similar Items