Detecting brain network communities: Considering the role of information flow and its different temporal scales

The identification of community structure in graphs continues to attract great interest in several fields. Network neuroscience is particularly concerned with this problem considering the key roles communities play in brain processes and functionality. Most methods used for community detection in brain graphs are based on the maximization of a parameter-dependent modularity function that often obscures the physical meaning and hierarchical organization of the partitions of network nodes. In this work, we present a new method able to detect communities at different scales in a natural, unrestricted way. First, to obtain an estimation of the information flow in the network we release random walkers to freely move over it. The activity of the walkers is separated into oscillatory modes by using empirical mode decomposition. After grouping nodes by their co-occurrence at each time scale, k-modes clustering returns the desired partitions. Our algorithm was first tested on benchmark graphs with favorable performance. Next, it was applied to real and simulated anatomical and/or functional connectomes in the macaque and human brains. We found a clear hierarchical repertoire of community structures in both the anatomical and the functional networks. The observed partitions range from the evident division in two hemispheres -in which all processes are managed globally- to specialized communities seemingly shaped by physical proximity and shared function. Additionally, the spatial scales of a network's community structure (characterized by a measure we term within-communities path length) appear inversely proportional to the oscillatory modes' average frequencies. The proportionality constant may constitute a network-specific propagation velocity for the information flow. Our results stimulate the research of hierarchical community organization in terms of temporal scales of information flow in the brain network.