Neighborhood properties of complex networks

Investigating extradomiciliary transmission of tuberculosis: An exploratory approach using social network patterns of TB cases and controls and the genotyping of Mycobacterium tuberculosis

Extradomiciliary contacts have been overlooked in the study of TB transmission due to difficulties in identifying actual contacts in large populations. Complex network analysis provides a framework to model the structure of contacts, specially extradomiciliary ones. We conducted a study of incident sputum-positive TB cases and healthy controls occurring in a moderate TB burden city. Cases and controls were interviewed to obtain data regarding the usual locations of residence, work, study, and leisure. Mycobacterium tuberculosis isolated from sputum was genotyped. The collected data were used to build networks based on a framework of putative social interactions indicating possible TB transmission. A user-friendly open source environment (GraphTube) was setup to extract information from the collected data. Networks based on the likelihood of patient-patient, patient-healthy, and healthy-healthy contacts were setup, depending on a constraint of geographical distance of places attended by the volunteers. Using a threshold for the geographical distance of 300 m, the differences between TB cases and controls are revealed. Several clusters formed by social network nodes with high genotypic similarity were characterized. The developed framework provided consistent results and can be used to support the targeted search of potentially infected individuals and to help to understand the TB transmission.

Approach to the inverse problem of superdiffusion on finite systems based on time-dependent long-range navigation

This work addresses the superdiffusive motion of a random walker on a discrete finite-size substrate. It is shown that, with the inclusion of suitably tuned time-dependent probability of large distance jumps over the substrate, the mean square displacement (MSD) of the walker has a power-law dependence on time with a previously chosen exponent γ>1. The developed framework provides an exact solution to the inverse problem, i.e., an adequate jump probability function leading to a preestablished solution is evaluated. Using the Markov Chain (MC) formalism, an exact map for the time dependence of the probability function is derived, which depends on the topology of the substrate and on the chosen value of γ. While the formalism imposes no restriction on the substrate, being applicable from ordered Euclidean lattices to complex networks, results for the cycle graph and two-dimensional torus are highlighted. It is also shown that, based on the previously derived probability function, MSD values resulting from direct numerical simulations agree quite well with those solely obtained within the MC framework.

Higher-order clustering in networks

A fundamental property of complex networks is the tendency for edges to cluster. The extent of the clustering is typically quantified by the clustering coefficient, which is the probability that a length-2 path is closed, i.e., induces a triangle in the network. However, higher-order cliques beyond triangles are crucial to understanding complex networks, and the clustering behavior with respect to such higher-order network structures is not well understood. Here we introduce higher-order clustering coefficients that measure the closure probability of higher-order network cliques and provide a more comprehensive view of how the edges of complex networks cluster. Our higher-order clustering coefficients are a natural generalization of the traditional clustering coefficient. We derive several properties about higher-order clustering coefficients and analyze them under common random graph models. Finally, we use higher-order clustering coefficients to gain new insights into the structure of real-world networks from several domains.

Integrating Phylogenetic and Network Approaches to Study Gene Family Evolution: The Case of the AGAMOUS Family of Floral Genes

The study of gene family evolution has benefited from the use of phylogenetic tools, which can greatly inform studies of both relationships within gene families and functional divergence. Here, we propose the use of a network-based approach that in combination with phylogenetic methods can provide additional support for models of gene family evolution. We dissect the contributions of each method to the improved understanding of relationships and functions within the well-characterized family of AGAMOUS floral development genes. The results obtained with the two methods largely agreed with one another. In particular, we show how network approaches can provide improved interpretations of branches with low support in a conventional gene tree. The network approach used here may also better reflect known and suspected patterns of functional divergence relative to phylogenetic methods. Overall, we believe that the combined use of phylogenetic and network tools provide a more robust assessment of gene family evolution.

Comparison of complex networks and tree-based methods of phylogenetic analysis and proposal of a bootstrap method

Complex networks have been successfully applied to the characterization and modeling of complex systems in several distinct areas of Biological Sciences. Nevertheless, their utilization in phylogenetic analysis still needs to be widely tested, using different molecular data sets and taxonomic groups, and, also, by comparing complex networks approach to current methods in phylogenetic analysis. In this work, we compare all the four main methods of phylogenetic analysis (distance, maximum parsimony, maximum likelihood, and Bayesian) with a complex networks method that has been used to provide a phylogenetic classification based on a large number of protein sequences as those related to the chitin metabolic pathway and ATP-synthase subunits. In order to perform a close comparison to these methods, we selected Basidiomycota fungi as the taxonomic group and used a high-quality, manually curated and characterized database of chitin synthase sequences. This enzymatic protein plays a key role in the synthesis of one of the exclusive features of the fungal cell wall: the presence of chitin. The communities (modules) detected by the complex network method corresponded exactly to the groups retrieved by the phylogenetic inference methods. Additionally, we propose a bootstrap method for the complex network approach. The statistical results we have obtained with this method were also close to those obtained using traditional bootstrap methods.

Optimizing diffusion in multiplexes by maximizing layer dissimilarity

Diffusion in a multiplex depends on the specific link distribution between the nodes in each layer, but also on the set of the intralayer and interlayer diffusion coefficients. In this work we investigate, in a quantitative way, the efficiency of multiplex diffusion as a function of the topological similarity among multiplex layers. This similarity is measured by the distance between layers, taken among the pairs of layers. Results are presented for a simple two-layer multiplex, where one of the layers is held fixed, while the other one can be rewired in a controlled way in order to increase or decrease the interlayer distance. The results indicate that, for fixed values of all intra- and interlayer diffusion coefficients, a large interlayer distance generally enhances the global multiplex diffusion, providing a topological mechanism to control the global diffusive process. For some sets of networks, we develop an algorithm to identify the most sensitive nodes in the rewirable layer, so that changes in a small set of connections produce a drastic enhancement of the global diffusion of the whole multiplex system.

What are the Evolutionary Origins of Mitochondria? A Complex Network Approach

Mitochondria originated endosymbiotically from an Alphaproteobacteria-like ancestor. However, it is still uncertain which extant group of Alphaproteobacteria is phylogenetically closer to the mitochondrial ancestor. The proposed groups comprise the order Rickettsiales, the family Rhodospirillaceae, and the genus Rickettsia. In this study, we apply a new complex network approach to investigate the evolutionary origins of mitochondria, analyzing protein sequences modules in a critical network obtained through a critical similarity threshold between the studied sequences. The dataset included three ATP synthase subunits (4, 6, and 9) and its alphaproteobacterial homologs (b, a, and c). In all the subunits, the results gave no support to the hypothesis that Rickettsiales are closely related to the mitochondrial ancestor. Our findings support the hypothesis that mitochondria share a common ancestor with a clade containing all Alphaproteobacteria orders, except Rickettsiales.

Detecting network communities: an application to phylogenetic analysis

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.

Complex weighted networks have been applied to uncover organizing principles of complex biological, technological, and social systems. We propose herein a new method to identify communities in such structures and apply it to phylogenetic analysis. Recent studies using this theory in genomics and proteomics contributed to the understanding of the structure and dynamics of cellular complex interaction webs. Three main distinct molecular networks have been investigated based on transcriptional and metabolic activity, and on protein interaction. Here we consider the evolutionary relationship between proteins throughout phylogeny, employing the complex network approach to perform a comparative study of the enzymes related to the chitin metabolic pathway. We show how the similarity index of protein sequences can be used for network construction, and how the underlying structure is analyzed by the computational routines of our method to recover useful and sound information for phylogenetic studies. By focusing on the modular character of protein similarity networks, we were successful in matching the identified networks modules to main bacterial phyla, and even some bacterial classes. The network-based method reported here can be used as a new powerful tool for identifying communities in complex networks, retrieving useful information for phylogenetic studies.

Intrinsic properties of Boolean dynamics in complex networks

We study intrinsic properties of attractor in Boolean dynamics of complex networks with scale-free topology, comparing with those of the so-called Kauffman's random Boolean networks. We numerically study both frozen and relevant nodes in each attractor in the dynamics of relatively small networks (20<or=N<or=200). We investigate numerically robustness of an attractor to a perturbation. An attractor with cycle length of l(c) in a network of size N consists of l(c) states in the state space of 2(N) states; each attractor has the arrangement of N nodes, where the cycle of attractor sweeps l(c) states. We define a perturbation as a flip of the state on a single node in the attractor state at a given time step. We show that the rate between unfrozen and relevant nodes in the dynamics of a complex network with scale-free topology is larger than that in Kauffman's random Boolean network model. Furthermore, we find that in a complex scale-free network with fluctuation of the in-degree number, attractors are more sensitive to a state flip for a highly connected node (i.e. input-hub node) than to that for a less connected node. By some numerical examples, we show that the number of relevant nodes increases, when an input-hub node is coincident with and/or connected with an output-hub node (i.e. a node with large output-degree) one another.