Prefer a chat interface with context about you and your work?
Counting the number of metastable states in the modularity landscape: Algorithmic detectability limit of greedy algorithms in community detection
Modularity maximization using greedy algorithms continues to be a popular approach toward community detection in graphs, even after various better forming algorithms have been proposed. Apart from its clear mechanism and ease of implementation, this approach is persistently popular because, presumably, its risk of algorithmic failure is not well understood. …