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...
Gespeichert in:
| Veröffentlicht in: | Philosophical transactions of the Royal Society of London. Series A: Mathematical, physical, and engineering sciences Jg. 383; H. 2298; S. 20240244 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
England
05.06.2025
|
| Schlagworte: | |
| ISSN: | 1471-2962, 1471-2962 |
| Online-Zugang: | Weitere Angaben |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | 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'. |
|---|---|
| AbstractList | 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'. 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'.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'. |
| Author | Bergermann, Kai Stoll, Martin |
| Author_xml | – sequence: 1 givenname: Kai orcidid: 0000-0002-2259-1839 surname: Bergermann fullname: Bergermann, Kai organization: TU Chemnitz, Chemnitz, Sachsen, Germany – sequence: 2 givenname: Martin orcidid: 0000-0003-0951-4756 surname: Stoll fullname: Stoll, Martin organization: TU Chemnitz, Chemnitz, Sachsen, Germany |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/40471031$$D View this record in MEDLINE/PubMed |
| BookMark | eNpNUD1PwzAUtFARbQMrI8rIkmK_fNUjqqAgVWKBgSmy4xfJENvFdtSWX0-AIjGc7nR3uuHmZGKdRUIuGV0wypc3PkSxAArFYkRxQmasqFkGvILJPz0l8xDeKGWsKuGMTAs6JjRnM_K69kJptDHterfLpAioUuPU0Auv4yE1Yq-N_hRRO5t2zqetM2aw35HCiO2Pr21qhj7qbY_71GLcOf8ezslpJ_qAF0dOyMv93fPqIds8rR9Xt5uszQsWs1oVNXbdkguGVU0xlxKBIa1BAS9aWcqy5LKrZZWj6mq6hHbsoQLaQplXAAm5_t3devcxYIiN0aHFvhcW3RCaHFjJOeXjDQm5OlYHaVA1W6-N8Ifm7w74Ag33Zd4 |
| CitedBy_id | crossref_primary_10_1098_rsta_2024_0244 |
| ContentType | Journal Article |
| DBID | NPM 7X8 |
| DOI | 10.1098/rsta.2024.0244 |
| DatabaseName | PubMed MEDLINE - Academic |
| DatabaseTitle | PubMed MEDLINE - Academic |
| DatabaseTitleList | PubMed MEDLINE - Academic |
| Database_xml | – sequence: 1 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 2 dbid: 7X8 name: MEDLINE - Academic url: https://search.proquest.com/medline sourceTypes: Aggregation Database |
| DeliveryMethod | no_fulltext_linktorsrc |
| Discipline | Engineering Mathematics Sciences (General) Physics |
| EISSN | 1471-2962 |
| ExternalDocumentID | 40471031 |
| Genre | Journal Article |
| GroupedDBID | --- -~X 0R~ 18M 4.4 5VS AACGO AANCE ABFAN ABPLY ABTLG ABYWD ACGFO ACIWK ACMTB ACNCT ACQIA ACTMH ADBBV AFVYC ALMA_UNASSIGNED_HOLDINGS ALMYZ BTFSW DIK EBS F5P H13 HZ~ JLS JSG KQ8 MRS MV1 NPM NSAHA O9- OK1 P2P RRY TN5 TR2 V1E XSW YNT ~02 7X8 |
| ID | FETCH-LOGICAL-c341t-7d47eff89a1e670e3bbe21e072d294cb5b559bf7b63edf7082ce67ed20c253622 |
| IEDL.DBID | 7X8 |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001507192800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1471-2962 |
| IngestDate | Thu Jun 05 17:40:32 EDT 2025 Fri Jun 06 04:25:24 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2298 |
| Keywords | matrix exponential modularity total variation multiplex networks community detection |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c341t-7d47eff89a1e670e3bbe21e072d294cb5b559bf7b63edf7082ce67ed20c253622 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| ORCID | 0000-0002-2259-1839 0000-0003-0951-4756 |
| PMID | 40471031 |
| PQID | 3215990996 |
| PQPubID | 23479 |
| ParticipantIDs | proquest_miscellaneous_3215990996 pubmed_primary_40471031 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-Jun-05 20250605 |
| PublicationDateYYYYMMDD | 2025-06-05 |
| PublicationDate_xml | – month: 06 year: 2025 text: 2025-Jun-05 day: 05 |
| PublicationDecade | 2020 |
| PublicationPlace | England |
| PublicationPlace_xml | – name: England |
| PublicationTitle | Philosophical transactions of the Royal Society of London. Series A: Mathematical, physical, and engineering sciences |
| PublicationTitleAlternate | Philos Trans A Math Phys Eng Sci |
| PublicationYear | 2025 |
| SSID | ssj0011652 |
| Score | 2.4600935 |
| Snippet | We propose two methods for the unsupervised detection of communities in undirected multiplex networks. These networks consist of multiple layers that record... |
| SourceID | proquest pubmed |
| SourceType | Aggregation Database Index Database |
| StartPage | 20240244 |
| Title | Gradient flow-based modularity maximization for community detection in multiplex networks |
| URI | https://www.ncbi.nlm.nih.gov/pubmed/40471031 https://www.proquest.com/docview/3215990996 |
| Volume | 383 |
| WOSCitedRecordID | wos001507192800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NS8MwFA_qFPSgbn7NLyJ40ENcm6ZNexIRp5eNHRTmqSRNAgPXzrXq_nxf2m7zIggeWlLaQkhe3vvlvV_eQ-hScsE4l5QERkvCQKaI9D1FlGEicoRxXFMVm-D9fjgcRoPa4ZbXtMq5TiwVtcoS6yPveGCbQHMCPL-dvBNbNcpGV-sSGquo4QGUsVLNh8soghuUFXdcUMCERgFdJG0MO_bYCOwOKbuBi_0OL0sz0935bwd30XYNMPFdJRFNtKLTFtr6kXYQnnqLXK15C22UJFDbatYLPcdXdTbq6z30-jgtWWEFNm_ZF7FWT-Fxpix9FRA8HovZaFwf5sSAgHFSHTmBV0oXJdErxaMUz5mLM5xWzPN8H710H57vn0hdj4EkYOsKwhXj2pgwEq4OuKM9KTV1tcOpohFLpC9heyINl4GnleEALhL4TivqJNQHQ0kP0FqapfoIYaFCyRX1jdI2YR2NoE21UUYHyqdCttHFfJBjkHcbxBCpzj7yeDnMbXRYzVQ8qRJzxMyBmQYtdfyHv0_QJrWlfK1DxT9FDQOrXZ-h9eSzGOXT81KQ4N4f9L4BVljVng |
| linkProvider | ProQuest |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Gradient+flow-based+modularity+maximization+for+community+detection+in+multiplex+networks&rft.jtitle=Philosophical+transactions+of+the+Royal+Society+of+London.+Series+A%3A+Mathematical%2C+physical%2C+and+engineering+sciences&rft.au=Bergermann%2C+Kai&rft.au=Stoll%2C+Martin&rft.date=2025-06-05&rft.issn=1471-2962&rft.eissn=1471-2962&rft.volume=383&rft.issue=2298&rft.spage=20240244&rft_id=info:doi/10.1098%2Frsta.2024.0244&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1471-2962&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1471-2962&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1471-2962&client=summon |