Gene expression in the social behavior network of the wire‐tailed manakin (Pipra filicauda) brain

The vertebrate basal forebrain and midbrain contain a set of interconnected nuclei that control social behavior. Conserved anatomical structures and functions of these nuclei have now been documented among fish, amphibians, reptiles, birds and mammals, and these brain regions have come to be known as the vertebrate social behavior network (SBN). While it is known that nuclei (nodes) of the SBN are rich in steroid and neuropeptide activity linked to behavior, simultaneous variation in the expression of neuroendocrine genes among several SBN nuclei has not yet been described in detail. In this study, we use RNA‐seq to profile gene expression across seven brain regions representing five nodes of the vertebrate SBN in a passerine bird, the wire‐tailed manakin Pipra filicauda. Using weighted gene co‐expression network analysis, we reconstructed sets of coregulated genes, showing striking patterns of variation in neuroendocrine gene expression across the SBN. We describe regional variation in gene networks comprising a broad set of hormone receptors, neuropeptides, steroidogenic enzymes, catecholamines and other neuroendocrine signaling molecules. Our findings show heterogeneous patterns of brain gene expression across nodes of the avian SBN and provide a foundation for future analyses of how the regulation of gene networks may mediate social behavior. These results highlight the importance of region‐specific sampling in studies of the mechanisms of behavior.     

Prediction of Cascading Failures in Spatial Networks

Cascading overload failures are widely found in large-scale parallel systems and remain a major threat to system reliability; therefore, they are of great concern to maintainers and managers of different systems. Accurate cascading failure prediction can provide useful information to help control networks. However, for a large, gradually growing network with increasing complexity, it is often impractical to explore the behavior of a single node from the perspective of failure propagation. Fortunately, overload failures that propagate through a network exhibit certain spatial-temporal correlations, which allows the study of a group of nodes that share common spatial and temporal characteristics. Therefore, in this study, we seek to predict the failure rates of nodes in a given group using machine-learning methods.We simulated overload failure propagations in a weighted lattice network that start with a center attack and predicted the failure percentages of different groups of nodes that are separated by a given distance. The experimental results of a feedforward neural network (FNN), a recurrent neural network (RNN) and support vector regression (SVR) all show that these different models can accurately predict the similar behavior of nodes in a given group during cascading overload propagation.     

Stochastic Boolean networks: An efficient approach to modeling gene regulatory networks

ABSTRACT: BACKGROUND: Various computational models have been of interest due to their use in the modelling of gene regulatory networks (GRNs). As a logical model, probabilistic Boolean networks (PBNs) consider molecular and genetic noise, so the study of PBNs provides significant insights into the understanding of the dynamics of GRNs. This will ultimately lead to advances in developing therapeutic methods that intervene in the process of disease development and progression. The applications of PBNs, however, are hindered by the complexities involved in the computation of the state transition matrix and the steady-state distribution of a PBN. For a PBN with n genes and N Boolean networks, the complexity to compute the state transition matrix is O(nN22n) or O(nN2n) for a sparse matrix. RESULTS: This paper presents a novel implementation of PBNs based on the notions of stochastic logic and stochastic computation. This stochastic implementation of a PBN is referred to as a stochastic Boolean network (SBN). An SBN provides an accurate and efficient simulation of a PBN without and with random gene perturbation. The state transition matrix is computed in an SBN with a complexity of O(nL2n), where L is a factor related to the stochastic sequence length. Since the minimum sequence length required for obtaining an evaluation accuracy approximately increases in a polynomial order with the number of genes, n, and the number of Boolean networks, N, usually increases exponentially with n, L is typically smaller than N, especially in a network with a large number of genes. Hence, the computational complexity of an SBN is primarily limited by the number of genes, but not directly by the total possible number of Boolean networks. Furthermore, a time-frame expanded SBN enables an efficient analysis of the steady-state distribution of a PBN. These findings are supported by the simulation results of a simplified p53 network, several randomly generated networks and a network inferred from a T cell immune response dataset. An SBN can also implement the function of an asynchronous PBN and is potentially useful in a hybrid approach in combination with a continuous or single-molecule level stochastic model. CONCLUSIONS: Stochastic Boolean networks (SBNs) are proposed as an efficient approach to modelling gene regulatory networks (GRNs). The SBN approach is able to recover biologically-proven regulatory behaviours, such as the oscillatory dynamics of the p53-Mdm2 network and the dynamic attractors in a T cell immune response network. The proposed approach can further predict the network dynamics when the genes are under perturbation, thus providing biologically meaningful insights for a better understanding of the dynamics of GRNs. The algorithms and methods described in this paper have been implemented in Matlab packages, which are attached as Additional files.     

Percolation on Networks with Conditional Dependence Group

Recently, the dependence group has been proposed to study the robustness of networks with interdependent nodes. A dependence group means that a failed node in the group can lead to the failures of the whole group. Considering the situation of real networks that one failed node may not always break the functionality of a dependence group, we study a cascading failure model that a dependence group fails only when more than a fraction β of nodes of the group fail. We find that the network becomes more robust with the increasing of the parameter β. However, the type of percolation transition is always first order unless the model reduces to the classical network percolation model, which is independent of the degree distribution of the network. Furthermore, we find that a larger dependence group size does not always make the networks more fragile. We also present exact solutions to the size of the giant component and the critical point, which are in agreement with the simulations well.     

Labeling Nodes Using Three Degrees of Propagation

The properties (or labels) of nodes in networks can often be predicted based on their proximity and their connections to other labeled nodes. So-called “label propagation algorithms” predict the labels of unlabeled nodes by propagating information about local label density iteratively through the network. These algorithms are fast, simple and scale to large networks but nonetheless regularly perform better than slower and much more complex algorithms on benchmark problems. We show here, however, that these algorithms have an intrinsic limitation that prevents them from adapting to some common patterns of network node labeling; we introduce a new algorithm, 3Prop, that retains all their advantages but is much more adaptive. As we show, 3Prop performs very well on node labeling problems ill-suited to label propagation, including predicting gene function in protein and genetic interaction networks and gender in friendship networks, and also performs slightly better on problems already well-suited to label propagation such as labeling blogs and patents based on their citation networks. 3Prop gains its adaptability by assigning separate weights to label information from different steps of the propagation. Surprisingly, we found that for many networks, the third iteration of label propagation receives a negative weight.

Availability

The code is available from the authors by request.     

Identification of Important Nodes in Directed Biological Networks: A Network Motif Approach

Identification of important nodes in complex networks has attracted an increasing attention over the last decade. Various measures have been proposed to characterize the importance of nodes in complex networks, such as the degree, betweenness and PageRank. Different measures consider different aspects of complex networks. Although there are numerous results reported on undirected complex networks, few results have been reported on directed biological networks. Based on network motifs and principal component analysis (PCA), this paper aims at introducing a new measure to characterize node importance in directed biological networks. Investigations on five real-world biological networks indicate that the proposed method can robustly identify actually important nodes in different networks, such as finding command interneurons, global regulators and non-hub but evolutionary conserved actually important nodes in biological networks. Receiver Operating Characteristic (ROC) curves for the five networks indicate remarkable prediction accuracy of the proposed measure. The proposed index provides an alternative complex network metric. Potential implications of the related investigations include identifying network control and regulation targets, biological networks modeling and analysis, as well as networked medicine.     

Reverse Engineering of Gene Regulatory Networks: A Comparative Study

Reverse engineering of gene regulatory networks has been an intensively studied topic in bioinformatics since it constitutes an intermediate step from explorative to causative gene expression analysis. Many methods have been proposed through recent years leading to a wide range of mathematical approaches. In practice, different mathematical approaches will generate different resulting network structures, thus, it is very important for users to assess the performance of these algorithms. We have conducted a comparative study with six different reverse engineering methods, including relevance networks, neural networks, and Bayesian networks. Our approach consists of the generation of defined benchmark data, the analysis of these data with the different methods, and the assessment of algorithmic performances by statistical analyses. Performance was judged by network size and noise levels. The results of the comparative study highlight the neural network approach as best performing method among those under study.     

Cascading Failures in Spatially-Embedded Random Networks

Cascading failures constitute an important vulnerability of interconnected systems. Here we focus on the study of such failures on networks in which the connectivity of nodes is constrained by geographical distance. Specifically, we use random geometric graphs as representative examples of such spatial networks, and study the properties of cascading failures on them in the presence of distributed flow. The key finding of this study is that the process of cascading failures is non-self-averaging on spatial networks, and thus, aggregate inferences made from analyzing an ensemble of such networks lead to incorrect conclusions when applied to a single network, no matter how large the network is. We demonstrate that this lack of self-averaging disappears with the introduction of a small fraction of long-range links into the network. We simulate the well studied preemptive node removal strategy for cascade mitigation and show that it is largely ineffective in the case of spatial networks. We introduce an altruistic strategy designed to limit the loss of network nodes in the event of a cascade triggering failure and show that it performs better than the preemptive strategy. Finally, we consider a real-world spatial network viz. a European power transmission network and validate that our findings from the study of random geometric graphs are also borne out by simulations of cascading failures on the empirical network.     

Fast Fragmentation of Networks Using Module-Based Attacks

In the multidisciplinary field of Network Science, optimization of procedures for efficiently breaking complex networks is attracting much attention from a practical point of view. In this contribution, we present a module-based method to efficiently fragment complex networks. The procedure firstly identifies topological communities through which the network can be represented using a well established heuristic algorithm of community finding. Then only the nodes that participate of inter-community links are removed in descending order of their betweenness centrality. We illustrate the method by applying it to a variety of examples in the social, infrastructure, and biological fields. It is shown that the module-based approach always outperforms targeted attacks to vertices based on node degree or betweenness centrality rankings, with gains in efficiency strongly related to the modularity of the network. Remarkably, in the US power grid case, by deleting 3% of the nodes, the proposed method breaks the original network in fragments which are twenty times smaller in size than the fragments left by betweenness-based attack.     

A Service Approach for Architecting Application Independent Wireless Sensor Networks

The current sensor networks are assumed to be designed for specific applications, having data communication protocols strongly coupled to applications. The future sensor networks are envisioned as comprising heterogeneous devices assisting to a large range of applications. To achieve this goal, a new architecture approach is needed, having application specific features separated from the data communication protocol, while influencing its behavior. We propose a Web Services approach for the design of sensor network, in which sensor nodes are service providers and applications are clients of such services. Our main goal is to enable a flexible architecture in which sensor networks data can be accessed by users spread all over the world.     

动态分子网络的构建与分析

分子网络研究是从全局角度揭示生物系统的结构和功能的重要手段,现有的网络分析大部分是基于静态网络.实际上,在不同的环境条件、组织类型和疾病状态以及生长和分化的过程中,分子网络时刻都在发生变化.经过研究人员的努力,人们已经提出了一些可用于分析分子网络动态的生物信息学方法,如节点的动态性分类、动态蛋白质复合物的预测、条件特异子网的构建以及网络动态行为的模拟等.本文综述了动态分子网络的构建与分析方法.可以预见,动态网络分析将成为未来网络研究的标准模式.     

Structure of Protein Interaction Networks and Their Implications on Drug Design

Protein-protein interaction networks (PINs) are rich sources of information that enable the network properties of biological systems to be understood. A study of the topological and statistical properties of budding yeast and human PINs revealed that they are scale-rich and configured as highly optimized tolerance (HOT) networks that are similar to the router-level topology of the Internet. This is different from claims that such networks are scale-free and configured through simple preferential-attachment processes. Further analysis revealed that there are extensive interconnections among middle-degree nodes that form the backbone of the networks. Degree distributions of essential genes, synthetic lethal genes, synthetic sick genes, and human drug-target genes indicate that there are advantageous drug targets among nodes with middle- to low-degree nodes. Such network properties provide the rationale for combinatorial drugs that target less prominent nodes to increase synergetic efficacy and create fewer side effects.     

General Relationship of Global Topology,Local Dynamics,and Directionality in Large-Scale Brain Networks

The balance of global integration and functional specialization is a critical feature of efficient brain networks, but the relationship of global topology, local node dynamics and information flow across networks has yet to be identified. One critical step in elucidating this relationship is the identification of governing principles underlying the directionality of interactions between nodes. Here, we demonstrate such principles through analytical solutions based on the phase lead/lag relationships of general oscillator models in networks. We confirm analytical results with computational simulations using general model networks and anatomical brain networks, as well as high-density electroencephalography collected from humans in the conscious and anesthetized states. Analytical, computational, and empirical results demonstrate that network nodes with more connections (i.e., higher degrees) have larger amplitudes and are directional targets (phase lag) rather than sources (phase lead). The relationship of node degree and directionality therefore appears to be a fundamental property of networks, with direct applicability to brain function. These results provide a foundation for a principled understanding of information transfer across networks and also demonstrate that changes in directionality patterns across states of human consciousness are driven by alterations of brain network topology.     

Multilayer network analyses as a toolkit for measuring social structure

The formalization of multilayer networks allows for new ways to measure sociality in complex social systems,including groups of animals.The same mathematical representation and methods are widely applicable across fields and study systems,and a network can represent drastically different types of data.As such,in order to apply analyses and interpret the results in a meaningful way the researcher must have a deep understanding of what their network is representing and what parts of it are being measured by a given analysis.Multilayer social networks can represent social structure with more detail than is often present in single layer networks,including multiple"types"of individuals,interactions,or relationships,and the extent to which these types are interdependent.Multilayer networks can also encompass a wider range of social scales,which can help overcome complications that are inherent to measuring sociality.In this paper,I dissect multilayer networks into the parts that correspond to different components of social structures.I then discuss common pitfalls to avoid across different stages of multilayer network analyses-some novel and some that always exist in social network analysis but are magnified in multi-layer representations.This paper serves as a primer for building a customized toolkit of multilayer network analyses,to probe components of social structure in animal social systems.     

Community Structure and Role Analysis in Biological Networks

Abstract

Complex network analysis has received increasing interest in recent years, which provides a remarkable tool to describe complex systems of interacting entities, particular for biological systems. In this paper, we propose a methodology for identifying the significant nodes of the networks, including core nodes, bridge nodes and high-influential nodes, based on the idea of community and two new ranking measures, InterRank and IntraRank. The results show the significant nodes form a small number in biological networks, and uncover the relative small number of which has advantage for reducing the dimensions of the network and possibly help to define new biological targets.     

Rich-Cores in Networks

A core comprises of a group of central and densely connected nodes which governs the overall behaviour of a network. It is recognised as one of the key meso-scale structures in complex networks. Profiling this meso-scale structure currently relies on a limited number of methods which are often complex and parameter dependent or require a null model. As a result, scalability issues are likely to arise when dealing with very large networks together with the need for subjective adjustment of parameters. The notion of a rich-club describes nodes which are essentially the hub of a network, as they play a dominating role in structural and functional properties. The definition of a rich-club naturally emphasises high degree nodes and divides a network into two subgroups. Here, we develop a method to characterise a rich-core in networks by theoretically coupling the underlying principle of a rich-club with the escape time of a random walker. The method is fast, scalable to large networks and completely parameter free. In particular, we show that the evolution of the core in World Trade and C. elegans networks correspond to responses to historical events and key stages in their physical development, respectively.     

Efficient Reconstruction of Heterogeneous Networks from Time Series via Compressed Sensing

Recent years have witnessed a rapid development of network reconstruction approaches, especially for a series of methods based on compressed sensing. Although compressed-sensing based methods require much less data than conventional approaches, the compressed sensing for reconstructing heterogeneous networks has not been fully exploited because of hubs. Hub neighbors require much more data to be inferred than small-degree nodes, inducing a cask effect for the reconstruction of heterogeneous networks. Here, a conflict-based method is proposed to overcome the cast effect to considerably reduce data amounts for achieving accurate reconstruction. Moreover, an element elimination method is presented to use the partially available structural information to reduce data requirements. The integration of both methods can further improve the reconstruction performance than separately using each technique. These methods are validated by exploring two evolutionary games taking place in scale-free networks, where individual information is accessible and an attempt to decode the network structure from measurable data is made. The results demonstrate that for all of the cases, much data are saved compared to that in the absence of these two methods. Due to the prevalence of heterogeneous networks in nature and society and the high cost of data acquisition in large-scale networks, these approaches have wide applications in many fields and are valuable for understanding and controlling the collective dynamics of a variety of heterogeneous networked systems.     

Multiplex Networks of Cortical and Hippocampal Neurons Revealed at Different Timescales

Recent studies have emphasized the importance of multiplex networks – interdependent networks with shared nodes and different types of connections – in systems primarily outside of neuroscience. Though the multiplex properties of networks are frequently not considered, most networks are actually multiplex networks and the multiplex specific features of networks can greatly affect network behavior (e.g. fault tolerance). Thus, the study of networks of neurons could potentially be greatly enhanced using a multiplex perspective. Given the wide range of temporally dependent rhythms and phenomena present in neural systems, we chose to examine multiplex networks of individual neurons with time scale dependent connections. To study these networks, we used transfer entropy – an information theoretic quantity that can be used to measure linear and nonlinear interactions – to systematically measure the connectivity between individual neurons at different time scales in cortical and hippocampal slice cultures. We recorded the spiking activity of almost 12,000 neurons across 60 tissue samples using a 512-electrode array with 60 micrometer inter-electrode spacing and 50 microsecond temporal resolution. To the best of our knowledge, this preparation and recording method represents a superior combination of number of recorded neurons and temporal and spatial recording resolutions to any currently available in vivo system. We found that highly connected neurons (“hubs”) were localized to certain time scales, which, we hypothesize, increases the fault tolerance of the network. Conversely, a large proportion of non-hub neurons were not localized to certain time scales. In addition, we found that long and short time scale connectivity was uncorrelated. Finally, we found that long time scale networks were significantly less modular and more disassortative than short time scale networks in both tissue types. As far as we are aware, this analysis represents the first systematic study of temporally dependent multiplex networks among individual neurons.