Exploring the solution landscape enables more reliable network community detection

Abstract

To understand how a complex system is organized and functions, researchers often identify communities in the system's network of interactions. Because it is practically impossible to explore all solutions to guarantee the best one, many community-detection algorithms rely on multiple stochastic searches. But for a given combination of network and stochastic algorithm, how many searches are sufficient to find a solution that is good enough? The standard approach is to pick a reasonably large number of searches and select the network partition with the highest quality or derive a consensus solution based on all network partitions. However, if different partitions have similar qualities such that the solution landscape is degenerate, the single best partition may miss relevant information, and a consensus solution may blur complementary communities. Here we address this degeneracy problem with coarse-grained descriptions of the solution landscape. We cluster network partitions based on their similarity and suggest an approach to determine the minimum number of searches required to describe the solution landscape adequately. To make good use of all partitions, we also propose different ways to explore the solution landscape, including a significance clustering procedure. We test these approaches on synthetic networks and a real-world network using two contrasting community-detection algorithms: The algorithm that can identify more general structures requires more searches and networks with clearer community structures require fewer searches. We also find that exploring the coarse-grained solution landscape can reveal complementary solutions and enable more reliable community detection.

Identifying flow modules in ecological networks using Infomap

“…flow modules, Infomap is highly relevant for analysing ecological networks (Edler et al, 2017;Calatayud et al, 2019;Pilosof et al, 2019). The incentives, guidelines and examples presented in this application paper, provide a springboard to take maximum advantage of empirical work in network ecology.…”

A multiscale view of the Phanerozoic fossil record reveals the three major biotic transitions

“…S6). This procedure for estimating module significance is described in (39), which includes a case study on biogeographic networks of modern vertebrates. hierarchical structure of the assembled network suggest that geographic structure underlies the evolutionary faunas.…”

“…The average probability (median) of belonging to a supermodule for nodes of the same layer was calculated according to (39). It shows the instability of the modular structure in the assembled network after the Earth's largest mass extinction event (6,24).…”

Ocean Surface Connectivity in the Arctic: Capabilities and Caveats of Community Detection in Lagrangian Flow Networks

“…This includes a discussion of the physical interpretation of communities found by the community detection algorithm Infomap (Rosvall et al., 2009), which may also be relevant to other community detection methods in flow networks. Moreover, community detection algorithms in complex networks have been shown to be sensitive to degenerate solutions, meaning that many good solutions may exist, while their topology may significantly differ (Calatayud et al., 2019; Good et al., 2010). We therefore, assess which structures are persistently found across different solutions.…”