Detecting communities based on network topology.
Ontology highlight
ABSTRACT:
SUBMITTER: Liu W
PROVIDER: S-EPMC4102921 | biostudies-literature | 2014 Jul
REPOSITORIES: biostudies-literature
Publications
Detecting communities based on network topology.
Liu Wei W Pellegrini Matteo M Wang Xiaofan X
Scientific reports 20140718
Network methods have had profound influence in many domains and disciplines in the past decade. Community structure is a very important property of complex networks, but the accurate definition of a community remains an open problem. Here we defined community based on three properties, and then propose a simple and novel framework to detect communities based on network topology. We analyzed 16 different types of networks, and compared our partitions with Infomap, LPA, Fastgreedy and Walktrap, wh ...[more]
Similar Datasets
Project description:This paper proposes a new method to identify communities in generally weighted complex networks and apply it to phylogenetic analysis. In this case, weights correspond to the similarity indexes among protein sequences, which can be used for network construction so that the network structure can be analyzed to recover phylogenetically useful information from its properties. The analyses discussed here are mainly based on the modular character of protein similarity networks, explored through the Newman-Girvan algorithm, with the help of the neighborhood matrix . The most relevant networks are found when the network topology changes abruptly revealing distinct modules related to the sets of organisms to which the proteins belong. Sound biological information can be retrieved by the computational routines used in the network approach, without using biological assumptions other than those incorporated by BLAST. Usually, all the main bacterial phyla and, in some cases, also some bacterial classes corresponded totally (100%) or to a great extent (>70%) to the modules. We checked for internal consistency in the obtained results, and we scored close to 84% of matches for community pertinence when comparisons between the results were performed. To illustrate how to use the network-based method, we employed data for enzymes involved in the chitin metabolic pathway that are present in more than 100 organisms from an original data set containing 1,695 organisms, downloaded from GenBank on May 19, 2007. A preliminary comparison between the outcomes of the network-based method and the results of methods based on Bayesian, distance, likelihood, and parsimony criteria suggests that the former is as reliable as these commonly used methods. We conclude that the network-based method can be used as a powerful tool for retrieving modularity information from weighted networks, which is useful for phylogenetic analysis.
| S-EPMC3088654 | biostudies-literature
Project description:Emerging brain connectivity network studies suggest that interactions between various distributed neuronal populations may be characterized by an organized complex topological structure. Many neuropsychiatric disorders are associated with altered topological patterns of brain connectivity. Therefore, a key inquiry of connectivity analysis is to detect group-level differentially expressed connectome patterns from the massive neuroimaging data. Recently, statistical methods have been developed to detect differentially expressed connectivity features at a subnetwork level, extending more commonly applied edge level analysis. However, the graph topological structures in these methods are limited to community/cliques which may not effectively uncover the underlying complex and disease-related brain circuits/subnetworks. Building on these previous subnetwork detection methods, a new statistical approach is developed to automatically identify the latent differentially expressed brain connectivity subnetworks with k-partite graph topological structures from large brain connectivity matrices. In addition, statistical inferential techniques are provided to test the detected topological structure. The new methods are evaluated via extensive simulation studies and then applied to resting state fMRI data (24 cases and 18 controls) for Parkinson's disease research. A differentially expressed connectivity network with the k-partite graph topological structure is detected which reveals underlying neural features distinguishing Parkinson's disease patients from healthy control subjects.
| S-EPMC7442212 | biostudies-literature
Project description:BackgroundRepresentations of the relationships among data using networks are widely used in several research fields such as computational biology, medical informatics and social network mining. Recently, complex networks have been introduced to better capture the insights of the modelled scenarios. Among others, dual networks (DNs) consist of mapping information as pairs of networks containing the same set of nodes but with different edges: one, called physical network, has unweighted edges, while the other, called conceptual network, has weighted edges.ResultsWe focus on DNs and we propose a tool to find common subgraphs (aka communities) in DNs with particular properties. The tool, called Dual-Network-Analyser, is based on the identification of communities that induce optimal modular subgraphs in the conceptual network and connected subgraphs in the physical one. It includes the Louvain algorithm applied to the considered case. The Dual-Network-Analyser can be used to study DNs, to find common modular communities. We report results on using the tool to identify communities on synthetic DNs as well as real cases in social networks and biological data.ConclusionThe proposed method has been tested by using synthetic and biological networks. Results demonstrate that it is well able to detect meaningful information from DNs.
| S-EPMC8750846 | biostudies-literature
Project description:Ecological monitoring of streams has often focused on assessing the biotic integrity of individual benthic macroinvertebrate (BMI) communities through local measures of diversity, such as taxonomic or functional richness. However, as individual BMI communities are frequently linked by a variety of ecological processes at a regional scale, there is a need to assess biotic integrity of groups of communities at the scale of watersheds. Using 4,619 sampled communities of streambed BMIs, we investigate this question using co-occurrence networks generated from groups of communities selected within California watersheds under different levels of stress due to upstream land use. Building on a number of arguments in theoretical ecology and network theory, we propose a framework for the assessment of the biotic integrity of watershed-scale groupings of BMI communities using measures of their co-occurrence network topology. We found significant correlations between stress, as described by a mean measure of upstream land use within a watershed, and topological measures of co-occurrence networks such as network size (r = -.81, p < 10-4), connectance (r = .31, p < 10-4), mean co-occurrence strength (r = .25, p < 10-4), degree heterogeneity (r = -.10, p < 10-4), and modularity (r = .11, p < 10-4). Using these five topological measures, we constructed a linear model of biotic integrity, here a composite of taxonomic and functional diversity known as the California Stream Condition Index, of groups of BMI communities within a watershed. This model can account for 66% of among-watershed variation in the mean biotic integrity of communities. These observations imply a role for co-occurrence networks in assessing the current status of biotic integrity for BMI communities, as well as their potential use in assessing other ecological communities.
| S-EPMC6875672 | biostudies-literature
Project description:Modern bibliographic databases provide the basis for scientific research and its evaluation. While their content and structure differ substantially, there exist only informal notions on their reliability. Here we compare the topological consistency of citation networks extracted from six popular bibliographic databases including Web of Science, CiteSeer and arXiv.org. The networks are assessed through a rich set of local and global graph statistics. We first reveal statistically significant inconsistencies between some of the databases with respect to individual statistics. For example, the introduced field bow-tie decomposition of DBLP Computer Science Bibliography substantially differs from the rest due to the coverage of the database, while the citation information within arXiv.org is the most exhaustive. Finally, we compare the databases over multiple graph statistics using the critical difference diagram. The citation topology of DBLP Computer Science Bibliography is the least consistent with the rest, while, not surprisingly, Web of Science is significantly more reliable from the perspective of consistency. This work can serve either as a reference for scholars in bibliometrics and scientometrics or a scientific evaluation guideline for governments and research agencies.
| S-EPMC4178292 | biostudies-other
Project description:BackgroundUnderstanding protein structure and dynamics is essential for understanding their function. This is a challenging task due to the high complexity of the conformational landscapes of proteins and their rugged energy levels. In particular, it is important to detect highly populated regions which could correspond to intermediate structures or local minima.ResultsWe present a hierarchical clustering and algebraic topology based method that detects regions of interest in protein conformational space. The method is based on several techniques. We use coarse grained protein conformational search, efficient robust dimensionality reduction and topological analysis via persistent homology as the main tools. We use two dimensionality reduction methods as well, robust Principal Component Analysis (PCA) and Isomap, to generate a reduced representation of the data while preserving most of the variance in the data.ConclusionsOur hierarchical clustering method was able to produce compact, well separated clusters for all the tested examples.
| S-EPMC5731496 | biostudies-literature
Project description:How spiking activity reverberates through neuronal networks, how evoked and spontaneous activity interacts and blends, and how the combined activities represent external stimulation are pivotal questions in neuroscience. We simulated minimal models of unstructured spiking networks in silico, asking whether and how gentle external stimulation might be subsequently reflected in spontaneous activity fluctuations. Consistent with earlier findings in silico and in vitro, we observe a privileged subpopulation of 'pioneer neurons' that, by their firing order, reliably encode previous external stimulation. We also confirm that pioneer neurons are 'sensitive' in that they are recruited by small fluctuations of population activity. We show that order-based representations rely on a 'chain' of pioneer neurons with different degrees of sensitivity and thus constitute an emergent property of collective dynamics. The forming of such representations is greatly favoured by a broadly heterogeneous connection topology-a broad 'middle class' in degree of connectedness. In conclusion, we offer a minimal model for the representational role of pioneer neurons, as observed experimentally in vitro. In addition, we show that broadly heterogeneous connectivity enhances the representational capacity of unstructured networks.
| S-EPMC7062672 | biostudies-literature
Project description:Despite significant progress in our understanding of the brain at both microscopic and macroscopic scales, the mechanisms by which low-level neuronal behavior gives rise to high-level mental processes such as memory still remain unknown. In this paper, we assess the plausibility and quantify the performance of polychronization, a newly proposed mechanism of neuronal encoding, which has been suggested to underlie a wide range of cognitive phenomena. We then investigate the effect of network topology on the reliability with which input stimuli can be distinguished based on their encoding in the form of so-called polychronous groups or spatiotemporal patterns of spikes. We find that small-world networks perform an order of magnitude better than random ones, enabling reliable discrimination between inputs even when prompted by increasingly incomplete recall cues. Furthermore, we show that small-world architectures operate at significantly reduced energetic costs and that their memory capacity scales favorably with network size. Finally, we find that small-world topologies introduce biologically realistic constraints on the optimal input stimuli, favoring especially the topographic inputs known to exist in many cortical areas. Our results suggest that mammalian cortical networks, by virtue of being both small-world and topographically organized, seem particularly well-suited to information processing through polychronization. This article addresses the fundamental question of encoding in neuroscience. In particular, evidence is presented in support of an emerging model of neuronal encoding in the neocortex based on spatiotemporal patterns of spikes.
| S-EPMC2929633 | biostudies-other
Project description:BackgroundThe relationship between the regulatory design and the functionality of molecular networks is a key issue in biology. Modules and motifs have been associated to various cellular processes, thereby providing anecdotal evidence for performance based localization on molecular networks.ResultsTo quantify structure-function relationship we investigate similarities of proteins which are close in the regulatory network of the yeast Saccharomyces Cerevisiae. We find that the topology of the regulatory network only show weak remnants of its history of network reorganizations, but strong features of co-regulated proteins associated to similar tasks. These functional correlations decreases strongly when one consider proteins separated by more than two steps in the regulatory network. The network topology primarily reflects the processes that is orchestrated by each individual hub, whereas there is nearly no remnants of the history of protein duplications.ConclusionOur results suggests that local topological features of regulatory networks, including broad degree distributions, emerge as an implicit result of matching a number of needed processes to a finite toolbox of proteins.
| S-EPMC2292138 | biostudies-literature
Project description:Metastasis is the cause of over 90% of cancer-related deaths. Cancer cells undergoing metastasis can switch dynamically between different phenotypes, enabling them to adapt to harsh challenges, such as overcoming anoikis and evading immune response. This ability, known as phenotypic plasticity, is crucial for the survival of cancer cells during metastasis, as well as acquiring therapy resistance. Various biochemical networks have been identified to contribute to phenotypic plasticity, but how plasticity emerges from the dynamics of these networks remains elusive. Here, we investigated the dynamics of various regulatory networks implicated in Epithelial-mesenchymal plasticity (EMP)-an important arm of phenotypic plasticity-through two different mathematical modelling frameworks: a discrete, parameter-independent framework (Boolean) and a continuous, parameter-agnostic modelling framework (RACIPE). Results from either framework in terms of phenotypic distributions obtained from a given EMP network are qualitatively similar and suggest that these networks are multi-stable and can give rise to phenotypic plasticity. Neither method requires specific kinetic parameters, thus our results emphasize that EMP can emerge through these networks over a wide range of parameter sets, elucidating the importance of network topology in enabling phenotypic plasticity. Furthermore, we show that the ability to exhibit phenotypic plasticity correlates positively with the number of positive feedback loops in a given network. These results pave a way toward an unorthodox network topology-based approach to identify crucial links in a given EMP network that can reduce phenotypic plasticity and possibly inhibit metastasis-by reducing the number of positive feedback loops.
| S-EPMC7235229 | biostudies-literature