Resolution limit revisited: community detection using generalized modularity density
Various attempts have been made in recent years to solve the resolution limit (RL) problem in community detection by considering variants of modularity in the detection algorithms. These objective functions purportedly largely mitigate the RL problem and are preferable to modularity in many realisti...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IOP Publishing
2023-01-01
|
| Series: | Journal of Physics: Complexity |
| Subjects: | |
| Online Access: | https://doi.org/10.1088/2632-072X/acc4a4 |
| _version_ | 1797844606772051968 |
|---|---|
| author | Jiahao Guo Pramesh Singh Kevin E Bassler |
| author_facet | Jiahao Guo Pramesh Singh Kevin E Bassler |
| author_sort | Jiahao Guo |
| collection | DOAJ |
| description | Various attempts have been made in recent years to solve the resolution limit (RL) problem in community detection by considering variants of modularity in the detection algorithms. These objective functions purportedly largely mitigate the RL problem and are preferable to modularity in many realistic scenarios. However, they are not generally suitable for analyzing weighted networks or for detecting hierarchical community structure. RL problems can be complicated, though, and in particular it can be unclear when it should be considered as problem. In this paper, we introduce an objective function that we call generalized modularity density Q _g . Q _g has a tunable parameter χ that enables structure to be resolved at any desired scale. Rather than being a problem, the scale associated with the RL can be used as a tool for finding hierarchical structure by varying χ . The definition of Q _g is easily extended to study weighted networks. We also propose a benchmark test to quantify the RL problem, examine various modularity-like objective functions to show that Q _g performs best, and demonstrate that it can be used to identify modular structure in real-world and artificial networks that is otherwise hidden. |
| first_indexed | 2024-04-09T17:25:00Z |
| format | Article |
| id | doaj.art-732524ed77f14c25bea513a85312a72b |
| institution | Directory Open Access Journal |
| issn | 2632-072X |
| language | English |
| last_indexed | 2024-04-09T17:25:00Z |
| publishDate | 2023-01-01 |
| publisher | IOP Publishing |
| record_format | Article |
| series | Journal of Physics: Complexity |
| spelling | doaj.art-732524ed77f14c25bea513a85312a72b2023-04-18T13:52:28ZengIOP PublishingJournal of Physics: Complexity2632-072X2023-01-014202500110.1088/2632-072X/acc4a4Resolution limit revisited: community detection using generalized modularity densityJiahao Guo0Pramesh Singh1https://orcid.org/0000-0002-7236-2903Kevin E Bassler2https://orcid.org/0000-0001-7700-2037Department of Physics, University of Houston , Houston TX, United States of America; Texas Center for Superconductivity, University of Houston , Houston TX, United States of AmericaDepartment of Physics, University of Houston , Houston TX, United States of America; Texas Center for Superconductivity, University of Houston , Houston TX, United States of AmericaDepartment of Physics, University of Houston , Houston TX, United States of America; Texas Center for Superconductivity, University of Houston , Houston TX, United States of America; Department of Mathematics, University of Houston , Houston TX, United States of AmericaVarious attempts have been made in recent years to solve the resolution limit (RL) problem in community detection by considering variants of modularity in the detection algorithms. These objective functions purportedly largely mitigate the RL problem and are preferable to modularity in many realistic scenarios. However, they are not generally suitable for analyzing weighted networks or for detecting hierarchical community structure. RL problems can be complicated, though, and in particular it can be unclear when it should be considered as problem. In this paper, we introduce an objective function that we call generalized modularity density Q _g . Q _g has a tunable parameter χ that enables structure to be resolved at any desired scale. Rather than being a problem, the scale associated with the RL can be used as a tool for finding hierarchical structure by varying χ . The definition of Q _g is easily extended to study weighted networks. We also propose a benchmark test to quantify the RL problem, examine various modularity-like objective functions to show that Q _g performs best, and demonstrate that it can be used to identify modular structure in real-world and artificial networks that is otherwise hidden.https://doi.org/10.1088/2632-072X/acc4a4complex networkscommunity detectionalgorithms |
| spellingShingle | Jiahao Guo Pramesh Singh Kevin E Bassler Resolution limit revisited: community detection using generalized modularity density Journal of Physics: Complexity complex networks community detection algorithms |
| title | Resolution limit revisited: community detection using generalized modularity density |
| title_full | Resolution limit revisited: community detection using generalized modularity density |
| title_fullStr | Resolution limit revisited: community detection using generalized modularity density |
| title_full_unstemmed | Resolution limit revisited: community detection using generalized modularity density |
| title_short | Resolution limit revisited: community detection using generalized modularity density |
| title_sort | resolution limit revisited community detection using generalized modularity density |
| topic | complex networks community detection algorithms |
| url | https://doi.org/10.1088/2632-072X/acc4a4 |
| work_keys_str_mv | AT jiahaoguo resolutionlimitrevisitedcommunitydetectionusinggeneralizedmodularitydensity AT prameshsingh resolutionlimitrevisitedcommunitydetectionusinggeneralizedmodularitydensity AT kevinebassler resolutionlimitrevisitedcommunitydetectionusinggeneralizedmodularitydensity |