The effect of network topology on the stability of discrete state models of genetic control

Irreversibility in bacterial regulatory networks

Irreversibility, in which a transient perturbation leaves a system in a new state, is an emergent property in systems of interacting entities. This property has well-established implications in statistical physics but remains underexplored in biological networks, especially for bacteria and other prokaryotes whose regulation of gene expression occurs predominantly at the transcriptional level. Focusing on the reconstructed regulatory network of Escherichia coli, we examine network responses to transient single-gene perturbations. We predict irreversibility in numerous cases and find that the incidence of irreversibility increases with the proximity of the perturbed gene to positive circuits in the network. Comparison with experimental data suggests a connection between the predicted irreversibility to transient perturbations and the evolutionary response to permanent perturbations.

Quantifying cancer cell plasticity with gene regulatory networks and single-cell dynamics

Phenotypic plasticity of cancer cells can lead to complex cell state dynamics during tumor progression and acquired resistance. Highly plastic stem-like states may be inherently drug-resistant. Moreover, cell state dynamics in response to therapy allow a tumor to evade treatment. In both scenarios, quantifying plasticity is essential for identifying high-plasticity states or elucidating transition paths between states. Currently, methods to quantify plasticity tend to focus on 1) quantification of quasi-potential based on the underlying gene regulatory network dynamics of the system; or 2) inference of cell potency based on trajectory inference or lineage tracing in single-cell dynamics. Here, we explore both of these approaches and associated computational tools. We then discuss implications of each approach to plasticity metrics, and relevance to cancer treatment strategies.

Learning vector quantized representation for cancer subtypes identification

BACKGROUND AND OBJECTIVE

Defining and separating cancer subtypes is essential for facilitating personalized therapy modality and prognosis of patients. The definition of subtypes has been constantly recalibrated as a result of our deepened understanding. During this recalibration, researchers often rely on clustering of cancer data to provide an intuitive visual reference that could reveal the intrinsic characteristics of subtypes. The data being clustered are often omics data such as transcriptomics that have strong correlations to the underlying biological mechanism. However, while existing studies have shown promising results, they suffer from issues associated with omics data: sample scarcity and high dimensionality while they impose unrealistic assumptions to extract useful features from the data while avoiding overfitting to spurious correlations.

METHODS

This paper proposes to leverage a recent strong generative model, Vector-Quantized Variational AutoEncoder, to tackle the data issues and extract discrete representations that are crucial to the quality of subsequent clustering by retaining only information relevant to reconstructing the input.

RESULTS

Extensive experiments and medical analysis on multiple datasets comprising 10 distinct cancers demonstrate the proposed clustering results can significantly and robustly improve prognosis over prevalent subtyping systems.

CONCLUSION

Our proposal does not impose strict assumptions on data distribution; while, its latent features are better representations of the transcriptomic data in different cancer subtypes, capable of yielding superior clustering performance with any mainstream clustering method.

Failure of the simultaneous block diagonalization technique applied to complete and cluster synchronization of random networks

We discuss here the application of the simultaneous block diagonalization (SBD) of matrices to the study of the stability of both complete and cluster synchronization in random (generic) networks. For both problems, we define indices that measure success (or failure) of application of the SBD technique in decoupling the stability problem into problems of lower dimensionality. We then see that in the case of random networks the extent of the dimensionality reduction achievable is the same as that produced by application of a trivial transformation.

Aqueous outflow regulation - 21st century concepts

We propose an integrated model of aqueous outflow control that employs a pump-conduit system in this article. Our model exploits accepted physiologic regulatory mechanisms such as those of the arterial, venous, and lymphatic systems. Here, we also provide a framework for developing novel diagnostic and therapeutic strategies to improve glaucoma patient care. In the model, the trabecular meshwork distends and recoils in response to continuous physiologic IOP transients like the ocular pulse, blinking, and eye movement. The elasticity of the trabecular meshwork determines cyclic volume changes in Schlemm's canal (SC). Tube-like SC inlet valves provide aqueous entry into the canal, and outlet valve leaflets at collector channels control aqueous exit from SC. Connections between the pressure-sensing trabecular meshwork and the outlet valve leaflets dynamically control flow from SC. Normal function requires regulation of the trabecular meshwork properties that determine distention and recoil. The aqueous pump-conduit provides short-term pressure control by varying stroke volume in response to pressure changes. Modulating TM constituents that regulate stroke volume provides long-term control. The aqueous outflow pump fails in glaucoma due to the loss of trabecular tissue elastance, as well as alterations in ciliary body tension. These processes lead to SC wall apposition and loss of motion. Visible evidence of pump failure includes a lack of pulsatile aqueous discharge into aqueous veins and reduced ability to reflux blood into SC. These alterations in the functional properties are challenging to monitor clinically. Phase-sensitive OCT now permits noninvasive, quantitative measurement of pulse-dependent TM motion in humans. This proposed conceptual model and related techniques offer a novel framework for understanding mechanisms, improving management, and development of therapeutic options for glaucoma.

Phase transitions and assortativity in models of gene regulatory networks evolved under different selection processes

We study a simplified model of gene regulatory network evolution in which links (regulatory interactions) are added via various selection rules that are based on the structural and dynamical features of the network nodes (genes). Similar to well-studied models of 'explosive' percolation, in our approach, links are selectively added so as to delay the transition to large-scale damage propagation, i.e. to make the network robust to small perturbations of gene states. We find that when selection depends only on structure, evolved networks are resistant to widespread damage propagation, even without knowledge of individual gene propensities for becoming 'damaged'. We also observe that networks evolved to avoid damage propagation tend towards disassortativity (i.e. directed links preferentially connect high degree 'source' genes to low degree 'target' genes and vice versa). We compare our simulations to reconstructed gene regulatory networks for several different species, with genes and links added over evolutionary time, and we find a similar bias towards disassortativity in the reconstructed networks.

Interplay between degree and Boolean rules in the stability of Boolean networks

Empirical evidence has revealed that biological regulatory systems are controlled by high-level coordination between topology and Boolean rules. In this study, we look at the joint effects of degree and Boolean functions on the stability of Boolean networks. To elucidate these effects, we focus on (1) the correlation between the sensitivity of Boolean variables and the degree and (2) the coupling between canalizing inputs and degree. We find that negatively correlated sensitivity with respect to local degree enhances the stability of Boolean networks against external perturbations. We also demonstrate that the effects of canalizing inputs can be amplified when they coordinate with high in-degree nodes. Numerical simulations confirm the accuracy of our analytical predictions at both the node and network levels.

Correlations between communicability sequence entropy and transport performance in spatially embedded networks

We investigate electric current transport performances in spatially embedded networks with total cost restriction introduced by Li et al. [Phys. Rev. Lett. 104, 018701 (2010)10.1103/PhysRevLett.104.018701]. Precisely, the network is built from a d-dimensional regular lattice to be improved by adding long-range connections with probability P_{ij}∼r_{ij}^{-α}, where r_{ij} is the Manhattan distance between sites i and j, and α is a variable exponent, the total length of the long-range connections is restricted. In addition, each link has a local conductance given by g_{ij}∼r_{ij}^{-C}, where the exponent C is to measure the impact of long-range connections on network flow. By calculating mean effective conductance of the network for different exponent α, we find that the optimal electric current transport conditions are obtained with α_{opt}=d+1 for all C. Interestingly, the optimal transportation condition is identical to the one obtained for optimal navigation in spatially embedded networks with total cost constraint. In addition, the phenomenon can be possibly explained by the communicability sequence entropy; we find that when α=d+1, the spatial network with total cost constraint can obtain the maximum communicability sequence entropy. The results show that the transport performance is strongly correlated with the communicability sequence entropy, which can provide an effective strategy for designing a power network with high transmission efficiency, that is, the transport performance can be optimized by improving the communicability sequence entropy of the network.

How single neuron properties shape chaotic dynamics and signal transmission in random neural networks

While most models of randomly connected neural networks assume single-neuron models with simple dynamics, neurons in the brain exhibit complex intrinsic dynamics over multiple timescales. We analyze how the dynamical properties of single neurons and recurrent connections interact to shape the effective dynamics in large randomly connected networks. A novel dynamical mean-field theory for strongly connected networks of multi-dimensional rate neurons shows that the power spectrum of the network activity in the chaotic phase emerges from a nonlinear sharpening of the frequency response function of single neurons. For the case of two-dimensional rate neurons with strong adaptation, we find that the network exhibits a state of "resonant chaos", characterized by robust, narrow-band stochastic oscillations. The coherence of stochastic oscillations is maximal at the onset of chaos and their correlation time scales with the adaptation timescale of single units. Surprisingly, the resonance frequency can be predicted from the properties of isolated neurons, even in the presence of heterogeneity in the adaptation parameters. In the presence of these internally-generated chaotic fluctuations, the transmission of weak, low-frequency signals is strongly enhanced by adaptation, whereas signal transmission is not influenced by adaptation in the non-chaotic regime. Our theoretical framework can be applied to other mechanisms at the level of single neurons, such as synaptic filtering, refractoriness or spike synchronization. These results advance our understanding of the interaction between the dynamics of single units and recurrent connectivity, which is a fundamental step toward the description of biologically realistic neural networks.

On the stability of multilayer Boolean networks under targeted immunization

In this paper, we study targeted immunization in a multilayer Boolean network model for genetic regulatory networks. Given a specific set of nodes immune to perturbations, we find that the stability of a multilayer Boolean network is determined by the largest eigenvalue of the weighted non-backtracking matrix of corresponding aggregated network. Aimed to minimize this largest eigenvalue, we developed the metric of multilayer collective influence (MCI) to quantify the impact of immunizing individual nodes on the stability of the system. Compared with other competing heuristics, immunizing nodes with high MCI scores can stabilize an unstable multilayer network with higher efficiency on both synthetic and real-world networks. Moreover, despite that coupling nodes can exert direct influence across multiple layers, they are found to exhibit less importance as measured by the MCI score. Our work reveals the mechanism of maintaining the stability of multilayer Boolean networks and provides an efficient targeted immunization strategy, which can be potentially applied to the location of pathogenesis of diseases and the development of targeted therapy.

Optimal stabilization of Boolean networks through collective influence

Boolean networks have attracted much attention due to their wide applications in describing dynamics of biological systems. During past decades, much effort has been invested in unveiling how network structure and update rules affect the stability of Boolean networks. In this paper, we aim to identify and control a minimal set of influential nodes that is capable of stabilizing an unstable Boolean network. For locally treelike Boolean networks with biased truth tables, we propose a greedy algorithm to identify influential nodes in Boolean networks by minimizing the largest eigenvalue of a modified nonbacktracking matrix. We test the performance of the proposed collective influence algorithm on four different networks. Results show that the collective influence algorithm can stabilize each network with a smaller set of nodes compared with other heuristic algorithms. Our work provides a new insight into the mechanism that determines the stability of Boolean networks, which may find applications in identifying virulence genes that lead to serious diseases.

Single-cell systems biology: probing the basic unit of information flow

Gene expression varies across cells in a population or a tissue. This heterogeneity has come into sharp focus in recent years through developments in new imaging and sequencing technologies. However, our ability to measure variation has outpaced our ability to interpret it. Much of the variability may arise from random effects occurring in the processes of gene expression (transcription, RNA processing and decay, translation). The molecular basis of these effects is largely unknown. Likewise, a functional role of this variability in growth, differentiation and disease has only been elucidated in a few cases. In this review, we highlight recent experimental and theoretical advances for measuring and analyzing stochastic variation.

Expected Number of Fixed Points in Boolean Networks with Arbitrary Topology

Boolean network models describe genetic, neural, and social dynamics in complex networks, where the dynamics depend generally on network topology. Fixed points in a genetic regulatory network are typically considered to correspond to cell types in an organism. We prove that the expected number of fixed points in a Boolean network, with Boolean functions drawn from probability distributions that are not required to be uniform or identical, is one, and is independent of network topology if only a feedback arc set satisfies a stochastic neutrality condition. We also demonstrate that the expected number is increased by the predominance of positive feedback in a cycle.

Compensatory interactions to stabilize multiple steady states or mitigate the effects of multiple deregulations in biological networks

Complex diseases can be modeled as damage to intracellular networks that results in abnormal cell behaviors. Network-based dynamic models such as Boolean models have been employed to model a variety of biological systems including those corresponding to disease. Previous work designed compensatory interactions to stabilize an attractor of a Boolean network after single node damage. We generalize this method to a multinode damage scenario and to the simultaneous stabilization of multiple steady state attractors. We classify the emergent situations, with a special focus on combinatorial effects, and characterize each class through simulation. We explore how the structural and functional properties of the network affect its resilience and its possible repair scenarios. We demonstrate the method's applicability to two intracellular network models relevant to cancer. This work has implications in designing prevention strategies for complex disease.

Feedback control stabilization of critical dynamics via resource transport on multilayer networks: How glia enable learning dynamics in the brain

Learning and memory are acquired through long-lasting changes in synapses. In the simplest models, such synaptic potentiation typically leads to runaway excitation, but in reality there must exist processes that robustly preserve overall stability of the neural system dynamics. How is this accomplished? Various approaches to this basic question have been considered. Here we propose a particularly compelling and natural mechanism for preserving stability of learning neural systems. This mechanism is based on the global processes by which metabolic resources are distributed to the neurons by glial cells. Specifically, we introduce and study a model composed of two interacting networks: a model neural network interconnected by synapses that undergo spike-timing-dependent plasticity; and a model glial network interconnected by gap junctions that diffusively transport metabolic resources among the glia and, ultimately, to neural synapses where they are consumed. Our main result is that the biophysical constraints imposed by diffusive transport of metabolic resources through the glial network can prevent runaway growth of synaptic strength, both during ongoing activity and during learning. Our findings suggest a previously unappreciated role for glial transport of metabolites in the feedback control stabilization of neural network dynamics during learning.

Modularity and the spread of perturbations in complex dynamical systems

We propose a method to decompose dynamical systems based on the idea that modules constrain the spread of perturbations. We find partitions of system variables that maximize "perturbation modularity," defined as the autocovariance of coarse-grained perturbed trajectories. The measure effectively separates the fast intramodular from the slow intermodular dynamics of perturbation spreading (in this respect, it is a generalization of the "Markov stability" method of network community detection). Our approach captures variation of modular organization across different system states, time scales, and in response to different kinds of perturbations: aspects of modularity which are all relevant to real-world dynamical systems. It offers a principled alternative to detecting communities in networks of statistical dependencies between system variables (e.g., "relevance networks" or "functional networks"). Using coupled logistic maps, we demonstrate that the method uncovers hierarchical modular organization planted in a system's coupling matrix. Additionally, in homogeneously coupled map lattices, it identifies the presence of self-organized modularity that depends on the initial state, dynamical parameters, and type of perturbations. Our approach offers a powerful tool for exploring the modular organization of complex dynamical systems.

Integrated network model provides new insights into castration-resistant prostate cancer

Castration-resistant prostate cancer (CRPC) is the main challenge for prostate cancer treatment. Recent studies have indicated that extending the treatments to simultaneously targeting different pathways could provide better approaches. To better understand the regulatory functions of different pathways, a system-wide study of CRPC regulation is necessary. For this purpose, we constructed a comprehensive CRPC regulatory network by integrating multiple pathways such as the MEK/ERK and the PI3K/AKT pathways. We studied the feedback loops of this network and found that AKT was involved in all detected negative feedback loops. We translated the network into a predictive Boolean model and analyzed the stable states and the control effects of genes using novel methods. We found that the stable states naturally divide into two obvious groups characterizing PC3 and DU145 cells respectively. Stable state analysis further revealed that several critical genes, such as PTEN, AKT, RAF, and CDKN2A, had distinct expression behaviors in different clusters. Our model predicted the control effects of many genes. We used several public datasets as well as FHL2 overexpression to verify our finding. The results of this study can help in identifying potential therapeutic targets, especially simultaneous targets of multiple pathways, for CRPC.

Forced synchronization of autonomous dynamical Boolean networks

We present the design of an autonomous time-delay Boolean network realized with readily available electronic components. Through simulations and experiments that account for the detailed nonlinear response of each circuit element, we demonstrate that a network with five Boolean nodes displays complex behavior. Furthermore, we show that the dynamics of two identical networks display near-instantaneous synchronization to a periodic state when forced by a common periodic Boolean signal. A theoretical analysis of the network reveals the conditions under which complex behavior is expected in an individual network and the occurrence of synchronization in the forced networks. This research will enable future experiments on autonomous time-delay networks using readily available electronic components with dynamics on a slow enough time-scale so that inexpensive data collection systems can faithfully record the dynamics.

Structural determinants of criticality in biological networks

Many adaptive evolutionary systems display spatial and temporal features, such as long-range correlations, typically associated with the critical point of a phase transition in statistical physics. Empirical and theoretical studies suggest that operating near criticality enhances the functionality of biological networks, such as brain and gene networks, in terms for instance of information processing, robustness, and evolvability. While previous studies have explained criticality with specific system features, we still lack a general theory of critical behavior in biological systems. Here we look at this problem from the complex systems perspective, since in principle all critical biological circuits have in common the fact that their internal organization can be described as a complex network. An important question is how self-similar structure influences self-similar dynamics. Modularity and heterogeneity, for instance, affect the location of critical points and can be used to tune the system toward criticality. We review and discuss recent studies on the criticality of neuronal and genetic networks, and discuss the implications of network theory when assessing the evolutionary features of criticality.

Impact of imperfect information on network attack

This paper explores the effectiveness of network attack when the attacker has imperfect information about the network. For Erdős-Rényi networks, we observe that dynamical importance and betweenness centrality-based attacks are surprisingly robust to the presence of a moderate amount of imperfect information and are more effective compared with simpler degree-based attacks even at moderate levels of network information error. In contrast, for scale-free networks the effectiveness of attack is much less degraded by a moderate level of information error. Furthermore, in the Erdős-Rényi case the effectiveness of network attack is much more degraded by missing links as compared with the same number of false links.

Transition to chaos in random networks with cell-type-specific connectivity

In neural circuits, statistical connectivity rules strongly depend on cell-type identity. We study dynamics of neural networks with cell-type-specific connectivity by extending the dynamic mean-field method and find that these networks exhibit a phase transition between silent and chaotic activity. By analyzing the locus of this transition, we derive a new result in random matrix theory: the spectral radius of a random connectivity matrix with block-structured variances. We apply our results to show how a small group of hyperexcitable neurons within the network can significantly increase the network's computational capacity by bringing it into the chaotic regime.

Phenotypic robustness and the assortativity signature of human transcription factor networks

Many developmental, physiological, and behavioral processes depend on the precise expression of genes in space and time. Such spatiotemporal gene expression phenotypes arise from the binding of sequence-specific transcription factors (TFs) to DNA, and from the regulation of nearby genes that such binding causes. These nearby genes may themselves encode TFs, giving rise to a transcription factor network (TFN), wherein nodes represent TFs and directed edges denote regulatory interactions between TFs. Computational studies have linked several topological properties of TFNs — such as their degree distribution — with the robustness of a TFN's gene expression phenotype to genetic and environmental perturbation. Another important topological property is assortativity, which measures the tendency of nodes with similar numbers of edges to connect. In directed networks, assortativity comprises four distinct components that collectively form an assortativity signature. We know very little about how a TFN's assortativity signature affects the robustness of its gene expression phenotype to perturbation. While recent theoretical results suggest that increasing one specific component of a TFN's assortativity signature leads to increased phenotypic robustness, the biological context of this finding is currently limited because the assortativity signatures of real-world TFNs have not been characterized. It is therefore unclear whether these earlier theoretical findings are biologically relevant. Moreover, it is not known how the other three components of the assortativity signature contribute to the phenotypic robustness of TFNs. Here, we use publicly available DNaseI-seq data to measure the assortativity signatures of genome-wide TFNs in 41 distinct human cell and tissue types. We find that all TFNs share a common assortativity signature and that this signature confers phenotypic robustness to model TFNs. Lastly, we determine the extent to which each of the four components of the assortativity signature contributes to this robustness.

The cells of living organisms do not concurrently express their entire complement of genes. Instead, they regulate their gene expression, and one consequence of this is the potential for different cells to adopt different stable gene expression patterns. For example, the development of an embryo necessitates that cells alter their gene expression patterns in order to differentiate. These gene expression phenotypes are largely robust to genetic mutation, and one source of this robustness may reside in the network structure of interacting molecules that underlie genetic regulation. Theoretical studies of regulatory networks have linked network structure to robustness; however, it is also necessary to more extensively characterize real-world regulatory networks in order to understand which structural properties may be biologically meaningful. We recently used theoretical models to show that a particular structural property, degree assortativity, is linked to robustness. Here, we measure the assortativity of human regulatory networks in 41 distinct cell and tissue types. We then develop a theoretical framework to explore how this structural property affects robustness, and we find that the gene expression phenotypes of human regulatory networks are more robust than expected by chance alone.

Stability of Boolean networks: the joint effects of topology and update rules

We study the stability of orbits in large Boolean networks. We treat the case in which the network has a given complex topology, and we do not assume a specific form for the update rules, which may be correlated with local topological properties of the network. While recent past work has addressed the separate effects of complex network topology and certain classes of update rules on stability, only crude results exist about how these effects interact. We present a widely applicable solution to this problem. Numerical simulations confirm our theory and show that local correlations between topology and update rules can have profound effects on the qualitative behavior of these systems.

Robustness of network measures to link errors

In various applications involving complex networks, network measures are employed to assess the relative importance of network nodes. However, the robustness of such measures in the presence of link inaccuracies has not been well characterized. Here we present two simple stochastic models of false and missing links and study the effect of link errors on three commonly used node centrality measures: degree centrality, betweenness centrality, and dynamical importance. We perform numerical simulations to assess robustness of these three centrality measures. We also develop an analytical theory, which we compare with our simulations, obtaining very good agreement.

Generative model selection using a scalable and size-independent complex network classifier

Real networks exhibit nontrivial topological features, such as heavy-tailed degree distribution, high clustering, and small-worldness. Researchers have developed several generative models for synthesizing artificial networks that are structurally similar to real networks. An important research problem is to identify the generative model that best fits to a target network. In this paper, we investigate this problem and our goal is to select the model that is able to generate graphs similar to a given network instance. By the means of generating synthetic networks with seven outstanding generative models, we have utilized machine learning methods to develop a decision tree for model selection. Our proposed method, which is named "Generative Model Selection for Complex Networks," outperforms existing methods with respect to accuracy, scalability, and size-independence.

The influence of assortativity on the robustness and evolvability of gene regulatory networks upon gene birth

Gene regulatory networks (GRNs) represent the interactions between genes and gene products, which drive the gene expression patterns that produce cellular phenotypes. GRNs display a number of characteristics that are beneficial for the development and evolution of organisms. For example, they are often robust to genetic perturbation, such as mutations in regulatory regions or loss of gene function. Simultaneously, GRNs are often evolvable as these genetic perturbations are occasionally exploited to innovate novel regulatory programs. Several topological properties, such as degree distribution, are known to influence the robustness and evolvability of GRNs. Assortativity, which measures the propensity of nodes of similar connectivity to connect to one another, is a separate topological property that has recently been shown to influence the robustness of GRNs to point mutations in cis-regulatory regions. However, it remains to be seen how assortativity may influence the robustness and evolvability of GRNs to other forms of genetic perturbation, such as gene birth via duplication or de novo origination. Here, we employ a computational model of genetic regulation to investigate whether the assortativity of a GRN influences its robustness and evolvability upon gene birth. We find that the robustness of a GRN generally increases with increasing assortativity, while its evolvability generally decreases. However, the rate of change in robustness outpaces that of evolvability, resulting in an increased proportion of assortative GRNs that are simultaneously robust and evolvable. By providing a mechanistic explanation for these observations, this work extends our understanding of how the assortativity of a GRN influences its robustness and evolvability upon gene birth.

Experiments on autonomous Boolean networks

We realize autonomous Boolean networks by using logic gates in their autonomous mode of operation on a field-programmable gate array. This allows us to implement time-continuous systems with complex dynamical behaviors that can be conveniently interconnected into large-scale networks with flexible topologies that consist of time-delay links and a large number of nodes. We demonstrate how we realize networks with periodic, chaotic, and excitable dynamics and study their properties. Field-programmable gate arrays define a new experimental paradigm that holds great potential to test a large body of theoretical results on the dynamics of complex networks, which has been beyond reach of traditional experimental approaches.

Ultrafast physical generation of random numbers using hybrid Boolean networks

We describe a high-speed physical random number generator based on a hybrid Boolean network with autonomous and clocked logic gates, realized on a reconfigurable chip. The autonomous logic gates are arranged in a bidirectional ring topology and generate broadband chaos. The clocked logic gates receive input from the autonomous logic gates so that random numbers are generated physically that pass standard randomness tests without further postprocessing. The large number of logic gates on reconfigurable chips allows for parallel generation of random numbers, as demonstrated by our implementation of 128 physical random number generators that achieve a real-time bit rate of 12.8Gbits/s.

Effects of community structure on the dynamics of random threshold networks

Random threshold networks (RTNs) have been widely used as models of neural or genetic regulatory networks. Network topology plays a central role in the dynamics of these networks. Recently it has been shown that many social and biological networks are scale-free and also exhibit community structure, in which autonomous modules are wired together to perform relatively independent functions. In this study we use both synchronous and asynchronous models of RTNs to systematically investigate how community structure affects the dynamics of RTNs with scale-free topology. Extensive simulation experiments show that RTNs with high modularity have more attractors than those RTNs with low modularity, and RTNs with smaller communities tend to have more attractors. Damage resulting from perturbation of initial conditions spreads less effectively in RTNs with higher modularity and RTNs with smaller communities. In addition, RTNs with high modularity can coordinate their internal dynamics better than RTNs with low modularity under the synchronous update scheme, and it is the other way around under the asynchronous update. This study shows that community structure has a strong effect on the dynamics of RTNs.

Synchronization of dynamical hypernetworks: dimensionality reduction through simultaneous block-diagonalization of matrices

We present a general framework to study stability of the synchronous solution for a hypernetwork of coupled dynamical systems. We are able to reduce the dimensionality of the problem by using simultaneous block diagonalization of matrices. We obtain necessary and sufficient conditions for stability of the synchronous solution in terms of a set of lower-dimensional problems and test the predictions of our low-dimensional analysis through numerical simulations. Under certain conditions, this technique may yield a substantial reduction of the dimensionality of the problem. For example, for a class of dynamical hypernetworks analyzed in the paper, we discover that arbitrarily large networks can be reduced to a collection of subsystems of dimensionality no more than 2. We apply our reduction technique to a number of different examples, including the class of undirected unweighted hypermotifs with 3 nodes.

Stability of Boolean multilevel networks

The study of the interplay between the structure and dynamics of complex multilevel systems is a pressing challenge nowadays. In this paper, we use a semiannealed approximation to study the stability properties of random Boolean networks in multiplex (multilayered) graphs. Our main finding is that the multilevel structure provides a mechanism for the stabilization of the dynamics of the whole system even when individual layers work on the chaotic regime, therefore identifying new ways of feedback between the structure and the dynamics of these systems. Our results point out the need for a conceptual transition from the physics of single-layered networks to the physics of multiplex networks. Finally, the fact that the coupling modifies the phase diagram and the critical conditions of the isolated layers suggests that interdependency can be used as a control mechanism.

Social climber attachment in forming networks produces a phase transition in a measure of connectivity

The formation and fragmentation of networks are typically studied using percolation theory, but most previous research has been restricted to studying a phase transition in cluster size, examining the emergence of a giant component. This approach does not study the effects of evolving network structure on dynamics that occur at the nodes, such as the synchronization of oscillators and the spread of information, epidemics, and neuronal excitations. We introduce and analyze an alternative link-formation rule, called social climber (SC) attachment, that may be combined with arbitrary percolation models to produce a phase transition using the largest eigenvalue of the network adjacency matrix as the order parameter. This eigenvalue is significant in the analyses of many network-coupled dynamical systems in which it measures the quality of global coupling and is hence a natural measure of connectivity. We highlight the important self-organized properties of SC attachment and discuss implications for controlling dynamics on networks.

Dynamical instability in Boolean networks as a percolation problem

Boolean networks, widely used to model gene regulation, exhibit a phase transition between regimes in which small perturbations either die out or grow exponentially. We show and numerically verify that this phase transition in the dynamics can be mapped onto a static percolation problem which predicts the long-time average Hamming distance between perturbed and unperturbed orbits.

Statistical properties of avalanches in networks

We characterize the distributions of size and duration of avalanches propagating in complex networks. By an avalanche we mean the sequence of events initiated by the externally stimulated excitation of a network node, which may, with some probability, then stimulate subsequent excitations of the nodes to which it is connected, resulting in a cascade of excitations. This type of process is relevant to a wide variety of situations, including neuroscience, cascading failures on electrical power grids, and epidemiology. We find that the statistics of avalanches can be characterized in terms of the largest eigenvalue and corresponding eigenvector of an appropriate adjacency matrix that encodes the structure of the network. By using mean-field analyses, previous studies of avalanches in networks have not considered the effect of network structure on the distribution of size and duration of avalanches. Our results apply to individual networks (rather than network ensembles) and provide expressions for the distributions of size and duration of avalanches starting at particular nodes in the network. These findings might find application in the analysis of branching processes in networks, such as cascading power grid failures and critical brain dynamics. In particular, our results show that some experimental signatures of critical brain dynamics (i.e., power-law distributions of size and duration of neuronal avalanches) are robust to complex underlying network topologies.

Integrated systems view on networking by hormones in Arabidopsis immunity reveals multiple crosstalk for cytokinin

Phytohormones signal and combine to maintain the physiological equilibrium in the plant. Pathogens enhance host susceptibility by modulating the hormonal balance of the plant cell. Unlike other plant hormones, the detailed role of cytokinin in plant immunity remains to be fully elucidated. Here, extensive data mining, including of pathogenicity factors, host regulatory proteins, enzymes of hormone biosynthesis, and signaling components, established an integrated signaling network of 105 nodes and 163 edges. Dynamic modeling and system analysis identified multiple cytokinin-mediated regulatory interactions in plant disease networks. This includes specific synergism between cytokinin and salicylic acid pathways and previously undiscovered aspects of antagonism between cytokinin and auxin in plant immunity. Predicted interactions and hormonal effects on plant immunity are confirmed in subsequent experiments with Pseudomonas syringae pv tomato DC3000 and Arabidopsis thaliana. Our dynamic simulation is instrumental in predicting system effects of individual components in complex hormone disease networks and synergism or antagonism between pathways.

Stability of Boolean networks with generalized canalizing rules

Boolean networks are discrete dynamical systems in which the state (0 or 1) of each node is updated at each time t to a state determined by the states at time t-1 of those nodes that have links to it. When these systems are used to model genetic control, the case of canalizing update rules is of particular interest. A canalizing rule is one for which a node state at time t is determined by the state at time t-1 of a single one of its inputs when that inputting node is in its canalizing state. Previous work on the order-disorder transition in Boolean networks considered complex, nonrandom network topology. In the current paper we extend this previous work to account for canalizing behavior.

Emergence of robustness against noise: A structural phase transition in evolved models of gene regulatory networks

We investigate the evolution of Boolean networks subject to a selective pressure which favors robustness against noise, as a model of evolved genetic regulatory systems. By mapping the evolutionary process into a statistical ensemble and minimizing its associated free energy, we find the structural properties which emerge as the selective pressure is increased and identify a phase transition from a random topology to a "segregated-core" structure, where a smaller and more densely connected subset of the nodes is responsible for most of the regulation in the network. This segregated structure is very similar qualitatively to what is found in gene regulatory networks, where only a much smaller subset of genes--those responsible for transcription factors-is responsible for global regulation. We obtain the full phase diagram of the evolutionary process as a function of selective pressure and the average number of inputs per node. We compare the theoretical predictions with Monte Carlo simulations of evolved networks and with empirical data for Saccharomyces cerevisiae and Escherichia coli.

The influence of assortativity on the robustness of signal-integration logic in gene regulatory networks

Gene regulatory networks (GRNs) drive the cellular processes that sustain life. To do so reliably, GRNs must be robust to perturbations, such as gene deletion and the addition or removal of regulatory interactions. GRNs must also be robust to genetic changes in regulatory regions that define the logic of signal-integration, as these changes can affect how specific combinations of regulatory signals are mapped to particular gene expression states. Previous theoretical analyses have demonstrated that the robustness of a GRN is influenced by its underlying topological properties, such as degree distribution and modularity. Another important topological property is assortativity, which measures the propensity with which nodes of similar connectivity are connected to one another. How assortativity influences the robustness of the signal-integration logic of GRNs remains an open question. Here, we use computational models of GRNs to investigate this relationship. We separately consider each of the three dynamical regimes of this model for a variety of degree distributions. We find that in the chaotic regime, robustness exhibits a pronounced increase as assortativity becomes more positive, while in the critical and ordered regimes, robustness is generally less sensitive to changes in assortativity. We attribute the increased robustness to a decrease in the duration of the gene expression pattern, which is caused by a reduction in the average size of a GRN's in-components. This study provides the first direct evidence that assortativity influences the robustness of the signal-integration logic of computational models of GRNs, illuminates a mechanistic explanation for this influence, and furthers our understanding of the relationship between topology and robustness in complex biological systems.

Network extreme eigenvalue: from mutimodal to scale-free networks

The extreme eigenvalues of adjacency matrices are important indicators on the influence of topological structures to the collective dynamical behavior of complex networks. Recent findings on the ensemble averageability of the extreme eigenvalue have further authenticated its applicability to the study of network dynamics. However, the ensemble average of extreme eigenvalue has only been solved analytically up to the second order correction. Here, we determine the ensemble average of the extreme eigenvalue and characterize its deviation across the ensemble through the discrete form of random scale-free network. Remarkably, the analytical approximation derived from the discrete form shows significant improvement over previous results, which implies a more accurate prediction of the epidemic threshold. In addition, we show that bimodal networks, which are more robust against both random and targeted removal of nodes, are more vulnerable to the spreading of diseases.

Mutational robustness of gene regulatory networks

Mutational robustness of gene regulatory networks refers to their ability to generate constant biological output upon mutations that change network structure. Such networks contain regulatory interactions (transcription factor – target gene interactions) but often also protein-protein interactions between transcription factors. Using computational modeling, we study factors that influence robustness and we infer several network properties governing it. These include the type of mutation, i.e. whether a regulatory interaction or a protein-protein interaction is mutated, and in the case of mutation of a regulatory interaction, the sign of the interaction (activating vs. repressive). In addition, we analyze the effect of combinations of mutations and we compare networks containing monomeric with those containing dimeric transcription factors. Our results are consistent with available data on biological networks, for example based on evolutionary conservation of network features. As a novel and remarkable property, we predict that networks are more robust against mutations in monomer than in dimer transcription factors, a prediction for which analysis of conservation of DNA binding residues in monomeric vs. dimeric transcription factors provides indirect evidence.

Algorithms in nature: the convergence of systems biology and computational thinking

Biologists rely on computational methods to analyze and integrate large data sets, while several computational methods were inspired by the high-level design principles of biological systems. This Perspectives discusses the recent convergence of these two ways of thinking.

Computer science and biology have enjoyed a long and fruitful relationship for decades. Biologists rely on computational methods to analyze and integrate large data sets, while several computational methods were inspired by the high-level design principles of biological systems. Recently, these two directions have been converging. In this review, we argue that thinking computationally about biological processes may lead to more accurate models, which in turn can be used to improve the design of algorithms. We discuss the similar mechanisms and requirements shared by computational and biological processes and then present several recent studies that apply this joint analysis strategy to problems related to coordination, network analysis, and tracking and vision. We also discuss additional biological processes that can be studied in a similar manner and link them to potential computational problems. With the rapid accumulation of data detailing the inner workings of biological systems, we expect this direction of coupling biological and computational studies to greatly expand in the future.

Stability of Boolean and continuous dynamics

Regulatory dynamics in biology is often described by continuous rate equations for continuously varying chemical concentrations. Binary discretization of state space and time leads to Boolean dynamics. In the latter, the dynamics has been called unstable if flip perturbations lead to damage spreading. Here, we find that this stability classification strongly differs from the stability properties of the original continuous dynamics under small perturbations of the state vector. In particular, random networks of nodes with large sensitivity yield stable dynamics under small perturbations.

Stability of strategies in payoff-driven evolutionary games on networks

We consider a network of coupled agents playing the Prisoner's Dilemma game, in which players are allowed to pick a strategy in the interval [0, 1], with 0 corresponding to defection, 1 to cooperation, and intermediate values representing mixed strategies in which each player may act as a cooperator or a defector over a large number of interactions with a certain probability. Our model is payoff-driven, i.e., we assume that the level of accumulated payoff at each node is a relevant parameter in the selection of strategies. Also, we consider that each player chooses his∕her strategy in a context of limited information. We present a deterministic nonlinear model for the evolution of strategies. We show that the final strategies depend on the network structure and on the choice of the parameters of the game. We find that polarized strategies (pure cooperator∕defector states) typically emerge when (i) the network connections are sparse, (ii) the network degree distribution is heterogeneous, (iii) the network is assortative, and surprisingly, (iv) the benefit of cooperation is high.

Network connectivity during mergers and growth: optimizing the addition of a module

The principal eigenvalue λ of a network's adjacency matrix often determines dynamics on the network (e.g., in synchronization and spreading processes) and some of its structural properties (e.g., robustness against failure or attack) and is therefore a good indicator for how "strongly" a network is connected. We study how λ is modified by the addition of a module, or community, which has broad applications, ranging from those involving a single modification (e.g., introduction of a drug into a biological process) to those involving repeated additions (e.g., power-grid and transit development). We describe how to optimally connect the module to the network to either maximize or minimize the shift in λ, noting several applications of directing dynamics on networks.

Effects of network topology, transmission delays, and refractoriness on the response of coupled excitable systems to a stochastic stimulus

We study the effects of network topology on the response of networks of coupled discrete excitable systems to an external stochastic stimulus. We extend recent results that characterize the response in terms of spectral properties of the adjacency matrix by allowing distributions in the transmission delays and in the number of refractory states and by developing a nonperturbative approximation to the steady state network response. We confirm our theoretical results with numerical simulations. We find that the steady state response amplitude is inversely proportional to the duration of refractoriness, which reduces the maximum attainable dynamic range. We also find that transmission delays alter the time required to reach steady state. Importantly, neither delays nor refractoriness impact the general prediction that criticality and maximum dynamic range occur when the largest eigenvalue of the adjacency matrix is unity.

A systems biology perspective on plant-microbe interactions: biochemical and structural targets of pathogen effectors

Plants have biochemical defences against stresses from predators, parasites and pathogens. In this review we discuss the interaction of plant defences with microbial pathogens such as bacteria, fungi and oomycetes, and viruses. We examine principles of complex dynamic networks that allow identification of network components that are differentially and predictably sensitive to perturbation, thus making them likely effector targets. We relate these principles to recent developments in our understanding of known effector targets in plant-pathogen systems, and propose a systems-level framework for the interpretation and modelling of host-microbe interactions mediated by effectors. We describe this framework briefly, and conclude by discussing useful experimental approaches for populating this framework.

Predicting criticality and dynamic range in complex networks: effects of topology

The collective dynamics of a network of coupled excitable systems in response to an external stimulus depends on the topology of the connections in the network. Here we develop a general theoretical approach to study the effects of network topology on dynamic range, which quantifies the range of stimulus intensities resulting in distinguishable network responses. We find that the largest eigenvalue of the weighted network adjacency matrix governs the network dynamic range. When the largest eigenvalue is exactly one, the system is in a critical state and its dynamic range is maximized. Further, we examine higher order behavior of the steady state system, which predicts that networks with more homogeneous degree distributions should have higher dynamic range. Our analysis, confirmed by numerical simulations, generalizes previous studies in terms of the largest eigenvalue of the adjacency matrix.

Modeling cardiac β-adrenergic signaling with normalized-Hill differential equations: comparison with a biochemical model

Background

New approaches are needed for large-scale predictive modeling of cellular signaling networks. While mass action and enzyme kinetic approaches require extensive biochemical data, current logic-based approaches are used primarily for qualitative predictions and have lacked direct quantitative comparison with biochemical models.

Results

We developed a logic-based differential equation modeling approach for cell signaling networks based on normalized Hill activation/inhibition functions controlled by logical AND and OR operators to characterize signaling crosstalk. Using this approach, we modeled the cardiac β₁-adrenergic signaling network, including 36 reactions and 25 species. Direct comparison of this model to an extensively characterized and validated biochemical model of the same network revealed that the new model gave reasonably accurate predictions of key network properties, even with default parameters. Normalized Hill functions improved quantitative predictions of global functional relationships compared with prior logic-based approaches. Comprehensive sensitivity analysis revealed the significant role of PKA negative feedback on upstream signaling and the importance of phosphodiesterases as key negative regulators of the network. The model was then extended to incorporate recently identified protein interaction data involving integrin-mediated mechanotransduction.

Conclusions

The normalized-Hill differential equation modeling approach allows quantitative prediction of network functional relationships and dynamics, even in systems with limited biochemical data.