Gradient flow-based modularity maximization for community detection in multiplex networks

We propose two methods for the unsupervised detection of communities in undirected multiplex networks. These networks consist of multiple layers that record different relationships between the same entities or incorporate data from different sources. Both methods are formulated as gradient flows of...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Philosophical transactions of the Royal Society of London. Series A: Mathematical, physical, and engineering sciences Ročník 383; číslo 2298; s. 20240244
Hlavní autori: Bergermann, Kai, Stoll, Martin
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: England 05.06.2025
Predmet:
matrix exponential
modularity
total variation
multiplex networks
community detection
ISSN:1471-2962, 1471-2962
On-line prístup:Zistit podrobnosti o prístupe
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We propose two methods for the unsupervised detection of communities in undirected multiplex networks. These networks consist of multiple layers that record different relationships between the same entities or incorporate data from different sources. Both methods are formulated as gradient flows of suitable energy functionals: the first (MPBTV) builds on the minimization of a balanced total variation functional, which we show to be equivalent to multiplex modularity maximization, while the second (DGFM3) directly maximizes multiplex modularity. The resulting nonlinear matrix-valued ordinary differential equations (ODEs) are solved efficiently by a graph Merriman-Bence-Osher (MBO) scheme. Key to the efficiency is the approximate integration of the discrete linear differential operators by truncated eigendecompositions in the matrix exponential function. Numerical experiments on several real-world multiplex networks show that our methods are competitive with the state of the art with respect to various metrics. Their major benefit is a significant reduction of computational complexity leading to runtimes that are orders of magnitude faster for large multiplex networks.This article is part of the theme issue 'Partial differential equations in data science'.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1471-2962
1471-2962
DOI:10.1098/rsta.2024.0244