Finding communities in sparse networks

Cascading effects of habitat loss on ectoparasite-associated bacterial microbiomes

Suitable habitat fragment size, isolation, and distance from a source are important variables influencing community composition of plants and animals, but the role of these environmental factors in determining composition and variation of host-associated microbial communities is poorly known. In parasite-associated microbial communities, it is hypothesized that evolution and ecology of an arthropod parasite will influence its microbiome more than broader environmental factors, but this hypothesis has not been extensively tested. To examine the influence of the broader environment on the parasite microbiome, we applied high-throughput sequencing of the V4 region of 16S rRNA to characterize the microbiome of 222 obligate ectoparasitic bat flies (Streblidae and Nycteribiidae) collected from 155 bats (representing six species) from ten habitat fragments in the Atlantic Forest of Brazil. Parasite species identity is the strongest driver of microbiome composition. To a lesser extent, reduction in habitat fragment area, but not isolation, is associated with an increase in connectance and betweenness centrality of bacterial association networks driven by changes in the diversity of the parasite community. Controlling for the parasite community, bacterial network topology covaries with habitat patch area and exhibits parasite-species specific responses to environmental change. Taken together, habitat loss may have cascading consequences for communities of interacting macro- and microorgansims.

Scalable and accurate method for neuronal ensemble detection in spiking neural networks

We propose a novel, scalable, and accurate method for detecting neuronal ensembles from a population of spiking neurons. Our approach offers a simple yet powerful tool to study ensemble activity. It relies on clustering synchronous population activity (population vectors), allows the participation of neurons in different ensembles, has few parameters to tune and is computationally efficient. To validate the performance and generality of our method, we generated synthetic data, where we found that our method accurately detects neuronal ensembles for a wide range of simulation parameters. We found that our method outperforms current alternative methodologies. We used spike trains of retinal ganglion cells obtained from multi-electrode array recordings under a simple ON-OFF light stimulus to test our method. We found a consistent stimuli-evoked ensemble activity intermingled with spontaneously active ensembles and irregular activity. Our results suggest that the early visual system activity could be organized in distinguishable functional ensembles. We provide a Graphic User Interface, which facilitates the use of our method by the scientific community.

Spectral estimation for detecting low-dimensional structure in networks using arbitrary null models

Discovering low-dimensional structure in real-world networks requires a suitable null model that defines the absence of meaningful structure. Here we introduce a spectral approach for detecting a network’s low-dimensional structure, and the nodes that participate in it, using any null model. We use generative models to estimate the expected eigenvalue distribution under a specified null model, and then detect where the data network’s eigenspectra exceed the estimated bounds. On synthetic networks, this spectral estimation approach cleanly detects transitions between random and community structure, recovers the number and membership of communities, and removes noise nodes. On real networks spectral estimation finds either a significant fraction of noise nodes or no departure from a null model, in stark contrast to traditional community detection methods. Across all analyses, we find the choice of null model can strongly alter conclusions about the presence of network structure. Our spectral estimation approach is therefore a promising basis for detecting low-dimensional structure in real-world networks, or lack thereof.

Decoupling of timescales reveals sparse convergent CPG network in the adult spinal cord

During the generation of rhythmic movements, most spinal neurons receive an oscillatory synaptic drive. The neuronal architecture underlying this drive is unknown, and the corresponding network size and sparseness have not yet been addressed. If the input originates from a small central pattern generator (CPG) with dense divergent connectivity, it will induce correlated input to all receiving neurons, while sparse convergent wiring will induce a weak correlation, if any. Here, we use pairwise recordings of spinal neurons to measure synaptic correlations and thus infer the wiring architecture qualitatively. A strong correlation on a slow timescale implies functional relatedness and a common source, which will also cause correlation on fast timescale due to shared synaptic connections. However, we consistently find marginal coupling between slow and fast correlations regardless of neuronal identity. This suggests either sparse convergent connectivity or a CPG network with recurrent inhibition that actively decorrelates common input.

Voting Simulation based Agglomerative Hierarchical Method for Network Community Detection

Community detection has been paid much attention in many fields in recent years, and a great deal of community-detection methods have been proposed. But the time consumption of some of them is heavy, limiting them from being applied to large-scale networks. On the contrary, there exist some lower-time-complexity methods. But most of them are non-deterministic, meaning that running the same method many times may yield different results from the same network, which reduces their practical utility greatly in real-world applications. To solve these problems, we propose a community-detection method in this paper, which takes both the quality of the results and the efficiency of the detecting procedure into account. Moreover, it is a deterministic method which can extract definite community structures from networks. The proposed method is inspired by the voting behaviours in election activities in the social society, in which we first simulate the voting procedure on the network. Every vertex votes for the nominated candidates following the proposed voting principles, densely connected groups of vertices can quickly reach a consensus on their candidates. At the end of this procedure, candidates and their own voters form a group of clusters. Then, we take the clusters as initial communities, and agglomerate some of them into larger ones with high efficiency to obtain the resulting community structures. We conducted extensive experiments on some artificial networks and real-world networks, the experimental results show that our proposed method can efficiently extract high-quality community structures from networks, and outperform the comparison algorithms significantly.

Community detection in dynamic networks via adaptive label propagation

An adaptive label propagation algorithm (ALPA) is proposed to detect and monitor communities in dynamic networks. Unlike the traditional methods by re-computing the whole community decomposition after each modification of the network, ALPA takes into account the information of historical communities and updates its solution according to the network modifications via a local label propagation process, which generally affects only a small portion of the network. This makes it respond to network changes at low computational cost. The effectiveness of ALPA has been tested on both synthetic and real-world networks, which shows that it can successfully identify and track dynamic communities. Moreover, ALPA could detect communities with high quality and accuracy compared to other methods. Therefore, being low-complexity and parameter-free, ALPA is a scalable and promising solution for some real-world applications of community detection in dynamic networks.

Childhood maltreatment is associated with alteration in global network fiber-tract architecture independent of history of depression and anxiety

Childhood maltreatment is a major risk factor for psychopathology. It is also associated with alterations in the network architecture of the brain, which we hypothesized may play a significant role in the development of psychopathology. In this study, we analyzed the global network architecture of physically healthy unmedicated 18-25 year old subjects (n=262) using diffusion tensor imaging (DTI) MRI and tractography. Anatomical networks were constructed from fiber streams interconnecting 90 cortical or subcortical regions for subjects with no-to-low (n=122) versus moderate-to-high (n=140) exposure to maltreatment. Graph theory analysis revealed lower degree, strength, global efficiency, and maximum Laplacian spectra, higher pathlength, small-worldness and Laplacian skewness, and less deviation from artificial networks in subjects with moderate-to-high exposure to maltreatment. On balance, local clustering was similar in both groups, but the different clusters were more strongly interconnected in the no-to-low exposure group. History of major depression, anxiety and attention deficit hyperactivity disorder did not have a significant impact on global network measures over and above the effect of maltreatment. Maltreatment is an important factor that needs to be taken into account in studies examining the relationship between network differences and psychopathology.

Multi-resolution community detection in massive networks

Aiming at improving the efficiency and accuracy of community detection in complex networks, we proposed a new algorithm, which is based on the idea that communities could be detected from subnetworks by comparing the internal and external cohesion of each subnetwork. In our method, similar nodes are firstly gathered into meta-communities, which are then decided to be retained or merged through a multilevel label propagation process, until all of them meet our community criterion. Our algorithm requires neither any priori information of communities nor optimization of any objective function. Experimental results on both synthetic and real-world networks show that, our algorithm performs quite well and runs extremely fast, compared with several other popular algorithms. By tuning a resolution parameter, we can also observe communities at different scales, so this could reveal the hierarchical structure of the network. To further explore the effectiveness of our method, we applied it to the E-Coli transcriptional regulatory network, and found that all the identified modules have strong structural and functional coherence.