On the Lower Bound of Modularity for Graph Fission

Among the tools available for analysis of manifold data in modern signal processing is the popular modularity method. Hugely successful, modularity is not without its degeneracies, specifically with regard to its ability to observe smaller community structure in larger contexts. A body of work has b...

Full description

Saved in:
Bibliographic Details
Published in2019 53rd Asilomar Conference on Signals, Systems, and Computers pp. 353 - 357
Main Author Roth, John D.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2019
Subjects
community structure
graph partitioning
modularity
Network theory
Online AccessGet full text

Cover

More Information
Summary:Among the tools available for analysis of manifold data in modern signal processing is the popular modularity method. Hugely successful, modularity is not without its degeneracies, specifically with regard to its ability to observe smaller community structure in larger contexts. A body of work has been built around this so-called resolution limit of modularity. However, the current analytical bounds do not describe the resolution limit in the context of single-cut graph fission. In this paper, we present a new resolution limit to this end and show its effect on both synthetic and real-world networks.
ISSN:2576-2303
DOI:10.1109/IEEECONF44664.2019.9048934