Common and Unique Network Dynamics in Football Games

The sport of football is played between two teams of eleven players each using a spherical ball. Each team strives to score by driving the ball into the opposing goal as the result of skillful interactions among players. Football can be regarded from the network perspective as a competitive relationship between two cooperative networks with a dynamic network topology and dynamic network node. Many complex large-scale networks have been shown to have topological properties in common, based on a small-world network and scale-free network models. However, the human dynamic movement pattern of this network has never been investigated in a real-world setting. Here, we show that the power law in degree distribution emerged in the passing behavior in the 2006 FIFA World Cup Final and an international “A” match in Japan, by describing players as vertices connected by links representing passes. The exponent values are similar to the typical values that occur in many real-world networks, which are in the range of , and are larger than that of a gene transcription network, . Furthermore, we reveal the stochastically switched dynamics of the hub player throughout the game as a unique feature in football games. It suggests that this feature could result not only in securing vulnerability against intentional attack, but also in a power law for self-organization. Our results suggest common and unique network dynamics of two competitive networks, compared with the large-scale networks that have previously been investigated in numerous works. Our findings may lead to improved resilience and survivability not only in biological networks, but also in communication networks

Investigating the validity of current network analysis on static conglomerate networks by protein network stratification

<p>Abstract</p> <p>Background</p> <p>A molecular network perspective forms the foundation of systems biology. A common practice in analyzing protein-protein interaction (PPI) networks is to perform network analysis on a conglomerate network that is an assembly of all available binary interactions in a given organism from diverse data sources. Recent studies on network dynamics suggested that this approach might have ignored the dynamic nature of context-dependent molecular systems.</p> <p>Results</p> <p>In this study, we employed a network stratification strategy to investigate the validity of the current network analysis on conglomerate PPI networks. Using the genome-scale tissue- and condition-specific proteomics data in <it>Arabidopsis thaliana</it>, we present here the first systematic investigation into this question. We stratified a conglomerate <it>A. thaliana </it>PPI network into three levels of context-dependent subnetworks. We then focused on three types of most commonly conducted network analyses, i.e., topological, functional and modular analyses, and compared the results from these network analyses on the conglomerate network and five stratified context-dependent subnetworks corresponding to specific tissues.</p> <p>Conclusions</p> <p>We found that the results based on the conglomerate PPI network are often significantly different from those of context-dependent subnetworks corresponding to specific tissues or conditions. This conclusion depends neither on relatively arbitrary cutoffs (such as those defining network hubs or bottlenecks), nor on specific network clustering algorithms for module extraction, nor on the possible high false positive rates of binary interactions in PPI networks. We also found that our conclusions are likely to be valid in human PPI networks. Furthermore, network stratification may help resolve many controversies in current research of systems biology.</p

Inferring the role of transcription factors in regulatory networks

<p>Abstract</p> <p>Background</p> <p>Expression profiles obtained from multiple perturbation experiments are increasingly used to reconstruct transcriptional regulatory networks, from well studied, simple organisms up to higher eukaryotes. Admittedly, a key ingredient in developing a reconstruction method is its ability to integrate heterogeneous sources of information, as well as to comply with practical observability issues: measurements can be scarce or noisy. In this work, we show how to combine a network of genetic regulations with a set of expression profiles, in order to infer the functional effect of the regulations, as inducer or repressor. Our approach is based on a consistency rule between a network and the signs of variation given by expression arrays.</p> <p>Results</p> <p>We evaluate our approach in several settings of increasing complexity. First, we generate artificial expression data on a transcriptional network of <it>E. coli </it>extracted from the literature (1529 nodes and 3802 edges), and we estimate that 30% of the regulations can be annotated with about 30 profiles. We additionally prove that at most 40.8% of the network can be inferred using our approach. Second, we use this network in order to validate the predictions obtained with a compendium of real expression profiles. We describe a filtering algorithm that generates particularly reliable predictions. Finally, we apply our inference approach to <it>S. cerevisiae </it>transcriptional network (2419 nodes and 4344 interactions), by combining ChIP-chip data and 15 expression profiles. We are able to detect and isolate inconsistencies between the expression profiles and a significant portion of the model (15% of all the interactions). In addition, we report predictions for 14.5% of all interactions.</p> <p>Conclusion</p> <p>Our approach does not require accurate expression levels nor times series. Nevertheless, we show on both data, real and artificial, that a relatively small number of perturbation experiments are enough to determine a significant portion of regulatory effects. This is a key practical asset compared to statistical methods for network reconstruction. We demonstrate that our approach is able to provide accurate predictions, even when the network is incomplete and the data is noisy.</p

Analysis of Combinatorial Regulation: Scaling of Partnerships between Regulators with the Number of Governed Targets

Through combinatorial regulation, regulators partner with each other to control common targets and this allows a small number of regulators to govern many targets. One interesting question is that given this combinatorial regulation, how does the number of regulators scale with the number of targets? Here, we address this question by building and analyzing co-regulation (co-transcription and co-phosphorylation) networks that describe partnerships between regulators controlling common genes. We carry out analyses across five diverse species: Escherichia coli to human. These reveal many properties of partnership networks, such as the absence of a classical power-law degree distribution despite the existence of nodes with many partners. We also find that the number of co-regulatory partnerships follows an exponential saturation curve in relation to the number of targets. (For E. coli and Bacillus subtilis, only the beginning linear part of this curve is evident due to arrangement of genes into operons.) To gain intuition into the saturation process, we relate the biological regulation to more commonplace social contexts where a small number of individuals can form an intricate web of connections on the internet. Indeed, we find that the size of partnership networks saturates even as the complexity of their output increases. We also present a variety of models to account for the saturation phenomenon. In particular, we develop a simple analytical model to show how new partnerships are acquired with an increasing number of target genes; with certain assumptions, it reproduces the observed saturation. Then, we build a more general simulation of network growth and find agreement with a wide range of real networks. Finally, we perform various down-sampling calculations on the observed data to illustrate the robustness of our conclusions

Towards the prediction of essential genes by integration of network topology, cellular localization and biological process information

<p>Abstract</p> <p>Background</p> <p>The identification of essential genes is important for the understanding of the minimal requirements for cellular life and for practical purposes, such as drug design. However, the experimental techniques for essential genes discovery are labor-intensive and time-consuming. Considering these experimental constraints, a computational approach capable of accurately predicting essential genes would be of great value. We therefore present here a machine learning-based computational approach relying on network topological features, cellular localization and biological process information for prediction of essential genes.</p> <p>Results</p> <p>We constructed a decision tree-based meta-classifier and trained it on datasets with individual and grouped attributes-network topological features, cellular compartments and biological processes-to generate various predictors of essential genes. We showed that the predictors with better performances are those generated by datasets with integrated attributes. Using the predictor with all attributes, i.e., network topological features, cellular compartments and biological processes, we obtained the best predictor of essential genes that was then used to classify yeast genes with unknown essentiality status. Finally, we generated decision trees by training the J48 algorithm on datasets with all network topological features, cellular localization and biological process information to discover cellular rules for essentiality. We found that the number of protein physical interactions, the nuclear localization of proteins and the number of regulating transcription factors are the most important factors determining gene essentiality.</p> <p>Conclusion</p> <p>We were able to demonstrate that network topological features, cellular localization and biological process information are reliable predictors of essential genes. Moreover, by constructing decision trees based on these data, we could discover cellular rules governing essentiality.</p

Uncovering packaging features of co-regulated modules based on human protein interaction and transcriptional regulatory networks

<p>Abstract</p> <p>Background</p> <p>Network co-regulated modules are believed to have the functionality of packaging multiple biological entities, and can thus be assumed to coordinate many biological functions in their network neighbouring regions.</p> <p>Results</p> <p>Here, we weighted edges of a human protein interaction network and a transcriptional regulatory network to construct an integrated network, and introduce a probabilistic model and a bipartite graph framework to exploit human co-regulated modules and uncover their specific features in packaging different biological entities (genes, protein complexes or metabolic pathways). Finally, we identified 96 human co-regulated modules based on this method, and evaluate its effectiveness by comparing it with four other methods.</p> <p>Conclusions</p> <p>Dysfunctions in co-regulated interactions often occur in the development of cancer. Therefore, we focussed on an example co-regulated module and found that it could integrate a number of cancer-related genes. This was extended to causal dysfunctions of some complexes maintained by several physically interacting proteins, thus coordinating several metabolic pathways that directly underlie cancer.</p

Modelling a Historic Oil-Tank Fire Allows an Estimation of the Sensitivity of the Infrared Receptors in Pyrophilous Melanophila Beetles

Pyrophilous jewel beetles of the genus Melanophila approach forest fires and there is considerable evidence that these beetles can detect fires from great distances of more than 60 km. Because Melanophila beetles are equipped with infrared receptors and are also attracted by hot surfaces it can be concluded that these infrared receptors are used for fire detection

Inherent directionality explains the lack of feedback loops in empirical networks

We explore the hypothesis that the relative abundance of feedback loops in many empirical complex networks is severely reduced owing to the presence of an inherent global directionality. Aimed at quantifying this idea, we propose a simple probabilistic model in which a free parameter γ controls the degree of inherent directionality. Upon strengthening such directionality, the model predicts a drastic reduction in the fraction of loops which are also feedback loops. To test this prediction, we extensively enumerated loops and feedback loops in many empirical biological, ecological and socio-technological directed networks. We show that, in almost all cases, empirical networks have a much smaller fraction of feedback loops than network randomizations. Quite remarkably, this empirical finding is quantitatively reproduced, for all loop lengths, by our model by fitting its only parameter γ. Moreover, the fitted value of γ correlates quite well with another direct measurement of network directionality, performed by means of a novel algorithm. We conclude that the existence of an inherent network directionality provides a parsimonious quantitative explanation for the observed lack of feedback loops in empirical networks