Random Networks of Catalytic Biochemical Reactions

Formulae for the probabilities of cycles and components are obtained for large random networks by combinatorical considerations and computer experiments. Formulae for the occurrence and distribution of cycles and of components of certain number and size are received for random networks.     

The dynamics of sparse random networks

Recurrent neural networks with full symmetric connectivity have been extensively studied as associative memories and pattern recognition devices. However, there is considerable evidence that sparse, asymmetrically connected, mainly excitatory networks with broadly directed inhibition are more consistent with biological reality. In this paper, we use the technique of return maps to study the dynamics of random networks with sparse, asymmetric connectivity and nonspecific inhibition. These networks show three qualitatively different kinds of behavior: fixed points, cycles of low period, and extremely long cycles verging on aperiodicity. Using statistical arguments, we relate these behaviors to network parameters and present empirical evidence for the accuracy of this statistical model. The model, in turn, leads to methods for controlling the level of activity in networks. Studying random, untrained networks provides an understanding of the intrinsic dynamics of these systems. Such dynamics could provide a substrate for the much more complex behavior shown when synaptic modification is allowed.     

Failure tolerance of motif structure in biological networks

Complex networks serve as generic models for many biological systems that have been shown to share a number of common structural properties such as power-law degree distribution and small-worldness. Real-world networks are composed of building blocks called motifs that are indeed specific subgraphs of (usually) small number of nodes. Network motifs are important in the functionality of complex networks, and the role of some motifs such as feed-forward loop in many biological networks has been heavily studied. On the other hand, many biological networks have shown some degrees of robustness in terms of their efficiency and connectedness against failures in their components. In this paper we investigated how random and systematic failures in the edges of biological networks influenced their motif structure. We considered two biological networks, namely, protein structure network and human brain functional network. Furthermore, we considered random failures as well as systematic failures based on different strategies for choosing candidate edges for removal. Failure in the edges tipping to high degree nodes had the most destructive role in the motif structure of the networks by decreasing their significance level, while removing edges that were connected to nodes with high values of betweenness centrality had the least effect on the significance profiles. In some cases, the latter caused increase in the significance levels of the motifs.     

Nonrandom spatial distribution by mammalian cells in culture

Quadrat analysis was used to investigate the spatial distribution of seven mammalian cell lines in culture. The number of cells in replicate unit areas of the culture was determined, and the variance to mean ratio used as an index of random and nonrandom spatial distribution. Only mouse SV3T3 cells distributed themselves randomly throughout the entire culture growth cycle. The remaining six lines all assumed a nonrandom distribution at some point in their growth cycles. Mouse L929 cells displayed avoidance behavior, and spaced themselves at regular intervals in a uniform spatial distribution. The five remaining lines (mouse S180, rat C6, hamster CHO, canine MDCK, and human BeWo) formed multicellular clusters, and were distributed aggregatively rather than randomly. Random walk migration can account for the random distribution of SV3T3 cells. Random walk combined with contact inhibition of movement provides a satisfactory explanation for the uniform distribution of L929 cells. Random walk and contact inhibition are incompatible with cell clustering, however. Thus other mechanisms of motility or adhesiveness must contribute to cell clustering. It is possible that random walk and contact inhibition may be less common components of cell movement than generally assumed.     

Restricted BLUP for Mixed Linear Models

A new estimation procedure for mixed regression models is introduced. It is a development of Henderson's best linear unbiased prediction procedure which uses the joint distribution of the observed dependent random variables and the unknown realisations of the random components of the model. It is proposed to replace the likelihood of the observations given the random components by the asymptotic likelihood of the maximum likelihood estimators and the prior distribution of the random components by a restricted prior distribution which is consistent with the usual restrictions placed on the random components when they are considered conditionally fixed.     

Study of synaptic plasticity via random graphs

The dynamical random graphs associated with a certain class of biological neural networks are introduced and studied. We describe the phase diagram revealing the parameters of a single neuron and of the synaptic strengths which allow formation of the stable strongly connected large groups of neurons. It is shown that the cycles are the most stable structures when the Hebb rule is implemented into the dynamics of the network of excitatory neurons. We discuss the role of cycles for the synchronization of the neuronal activity.     

The small world inside large metabolic networks

The metabolic network of the catabolic, energy and biosynthetic metabolism of Escherichia coli is a paradigmatic case for the large genetic and metabolic networks that functional genomics efforts are beginning to elucidate. To analyse the structure of previously unknown networks involving hundreds or thousands of components by simple visual inspection is impossible, and quantitative approaches are needed to analyse them. We have undertaken a graph theoretical analysis of the E. coli metabolic network and find that this network is a small-world graph, a type of graph distinct from both regular and random networks and observed in a variety of seemingly unrelated areas, such as friendship networks in sociology, the structure of electrical power grids, and the nervous system of Caenorhabditis elegans. Moreover, the connectivity of the metabolites follows a power law, another unusual but by no means rare statistical distribution. This provides an objective criterion for the centrality of the tricarboxylic acid cycle to metabolism. The small-world architecture may serve to minimize transition times between metabolic states, and contains evidence about the evolutionary history of metabolism.     

Biologically meaningful update rules increase the critical connectivity of generalized Kauffman networks

We generalize random Boolean networks by softening the hard binary discretization into multiple discrete states. These multistate networks are generic models of gene regulatory networks, where each gene is known to assume a finite number of functionally different expression levels. We analytically determine the critical connectivity that separates the biologically unfavorable frozen and chaotic regimes. This connectivity is inversely proportional to a parameter which measures the heterogeneity of the update rules. Interestingly, the latter does not necessarily increase with the mean number of discrete states per node. Still, allowing for multiple states decreases the critical connectivity as compared to random Boolean networks, and thus leads to biologically unrealistic situations.Therefore, we study two approaches to increase the critical connectivity. First, we demonstrate that each network can be kept in its frozen regime by sufficiently biasing the update rules. Second, we restrict the randomly chosen update rules to a subclass of biologically more meaningful functions. These functions are characterized based on a thermodynamic model of gene regulation. We analytically show that their usage indeed increases the critical connectivity. From a general point of view, our thermodynamic considerations link discrete and continuous models of gene regulatory networks.     

Exploring biological network structure using exponential random graph models

MOTIVATION: The functioning of biological networks depends in large part on their complex underlying structure. When studying their systemic nature many modeling approaches focus on identifying simple, but prominent, structural components, as such components are easier to understand, and, once identified, can be used as building blocks to succinctly describe the network. RESULTS: In recent social network studies, exponential random graph models have been used extensively to model global social network structure as a function of their 'local features'. Starting from those studies, we describe the exponential random graph models and demonstrate their utility in modeling the architecture of biological networks as a function of the prominence of local features. We argue that the flexibility, in terms of the number of available local feature choices, and scalability, in terms of the network sizes, make this approach ideal for statistical modeling of biological networks. We illustrate the modeling on both genetic and metabolic networks and provide a novel way of classifying biological networks based on the prevalence of their local features.     

Cycle distributions in random nets

Characteristics of random nets are derived from assumptions concerning the distribution of connections. The single aggregate of neurons with random connections without branching and two parallel chains with normal distribution of connections are considered. The cycle saturation is derived for each type of net, that is, the fraction of neurons which are members of cycles. It is shown that in the single aggregate with random connections, the cycle saturation varies inversely as the square root of the number of neurons; in the dense two-chain net it varies inversely as the square root of the neuron density and inversely on the square root of the standard deviation of the normal distribution.     

The logical analysis of continuous, non-linear biochemical control networks

We propose a mapping to study the qualitative properties of continuous biochemical control networks which are invariant to the parameters used to describe the networks but depend only on the logical structure of the networks. For the networks, we are able to place a lower limit on the number of steady states and strong restrictions on the phase relations between components on cycles and transients. The logical structure and the dynamical behavior for a number of simple systems of biological interest, the feedback (predator-prey) oscillator, the bistable switch, the phase dependent switch, are discussed. We discuss the possibility that these techniques may be extended to study the dynamics of large many component systems.     

Clustering in large networks does not promote upstream reciprocity

Upstream reciprocity (also called generalized reciprocity) is a putative mechanism for cooperation in social dilemma situations with which players help others when they are helped by somebody else. It is a type of indirect reciprocity. Although upstream reciprocity is often observed in experiments, most theories suggest that it is operative only when players form short cycles such as triangles, implying a small population size, or when it is combined with other mechanisms that promote cooperation on their own. An expectation is that real social networks, which are known to be full of triangles and other short cycles, may accommodate upstream reciprocity. In this study, I extend the upstream reciprocity game proposed for a directed cycle by Boyd and Richerson to the case of general networks. The model is not evolutionary and concerns the conditions under which the unanimity of cooperative players is a Nash equilibrium. I show that an abundance of triangles or other short cycles in a network does little to promote upstream reciprocity. Cooperation is less likely for a larger population size even if triangles are abundant in the network. In addition, in contrast to the results for evolutionary social dilemma games on networks, scale-free networks lead to less cooperation than networks with a homogeneous degree distribution.     

The Dynamics of Conjunctive and Disjunctive Boolean Network Models

For many biological networks, the topology of the network constrains its dynamics. In particular, feedback loops play a crucial role. The results in this paper quantify the constraints that (unsigned) feedback loops exert on the dynamics of a class of discrete models for gene regulatory networks. Conjunctive (resp. disjunctive) Boolean networks, obtained by using only the AND (resp. OR) operator, comprise a subclass of networks that consist of canalyzing functions, used to describe many published gene regulation mechanisms. For the study of feedback loops, it is common to decompose the wiring diagram into linked components each of which is strongly connected. It is shown that for conjunctive Boolean networks with strongly connected wiring diagram, the feedback loop structure completely determines the long-term dynamics of the network. A formula is established for the precise number of limit cycles of a given length, and it is determined which limit cycle lengths can appear. For general wiring diagrams, the situation is much more complicated, as feedback loops in one strongly connected component can influence the feedback loops in other components. This paper provides a sharp lower bound and an upper bound on the number of limit cycles of a given length, in terms of properties of the partially ordered set of strongly connected components.     

A proposal for using the ensemble approach to understand genetic regulatory networks

Understanding the genetic regulatory network comprising genes, RNA, proteins and the network connections and dynamical control rules among them, is a major task of contemporary systems biology. I focus here on the use of the ensemble approach to find one or more well-defined ensembles of model networks whose statistical features match those of real cells and organisms. Such ensembles should help explain and predict features of real cells and organisms. More precisely, an ensemble of model networks is defined by constraints on the "wiring diagram" of regulatory interactions, and the "rules" governing the dynamical behavior of regulated components of the network. The ensemble consists of all networks consistent with those constraints. Here I discuss ensembles of random Boolean networks, scale free Boolean networks, "medusa" Boolean networks, continuous variable networks, and others. For each ensemble, M statistical features, such as the size distribution of avalanches in gene activity changes unleashed by transiently altering the activity of a single gene, the distribution in distances between gene activities on different cell types, and others, are measured. This creates an M-dimensional space, where each ensemble corresponds to a cluster of points or distributions. Using current and future experimental techniques, such as gene arrays, these M properties are to be measured for real cells and organisms, again yielding a cluster of points or distributions in the M-dimensional space. The procedure then finds ensembles close to those of real cells and organisms, and hill climbs to attempt to match the observed M features. Thus obtains one or more ensembles that should predict and explain many features of the regulatory networks in cells and organisms.     

Probing the extent of randomness in protein interaction networks

Protein-protein interaction (PPI) networks are commonly explored for the identification of distinctive biological traits, such as pathways, modules, and functional motifs. In this respect, understanding the underlying network structure is vital to assess the significance of any discovered features. We recently demonstrated that PPI networks show degree-weighted behavior, whereby the probability of interaction between two proteins is generally proportional to the product of their numbers of interacting partners or degrees. It was surmised that degree-weighted behavior is a characteristic of randomness. We expand upon these findings by developing a random, degree-weighted, network model and show that eight PPI networks determined from single high-throughput (HT) experiments have global and local properties that are consistent with this model. The apparent random connectivity in HT PPI networks is counter-intuitive with respect to their observed degree distributions; however, we resolve this discrepancy by introducing a non-network-based model for the evolution of protein degrees or "binding affinities." This mechanism is based on duplication and random mutation, for which the degree distribution converges to a steady state that is identical to one obtained by averaging over the eight HT PPI networks. The results imply that the degrees and connectivities incorporated in HT PPI networks are characteristic of unbiased interactions between proteins that have varying individual binding affinities. These findings corroborate the observation that curated and high-confidence PPI networks are distinct from HT PPI networks and not consistent with a random connectivity. These results provide an avenue to discern indiscriminate organizations in biological networks and suggest caution in the analysis of curated and high-confidence networks.     

Network structure, predator–prey modules, and stability in large food webs

Large, complex networks of ecological interactions with random structure tend invariably to instability. This mathematical relationship between complexity and local stability ignited a debate that has populated ecological literature for more than three decades. Here we show that, when species interact as predators and prey, systems as complex as the ones observed in nature can still be stable. Moreover, stability is highly robust to perturbations of interaction strength, and is largely a property of structure driven by predator–prey loops with the stability of these small modules cascading into that of the whole network. These results apply to empirical food webs and models that mimic the structure of natural systems as well. These findings are also robust to the inclusion of other types of ecological links, such as mutualism and interference competition, as long as consumer–resource interactions predominate. These considerations underscore the influence of food web structure on ecological dynamics and challenge the current view of interaction strength and long cycles as main drivers of stability in natural communities. Electronic Supplementary Material The online version of this article (doi:) contains supplementary material, which is available to authorized users.     

Semiparametric bayesian inference for multilevel repeated measurement data

We discuss inference for data with repeated measurements at multiple levels. The motivating example is data with blood counts from cancer patients undergoing multiple cycles of chemotherapy, with days nested within cycles. Some inference questions relate to repeated measurements over days within cycle, while other questions are concerned with the dependence across cycles. When the desired inference relates to both levels of repetition, it becomes important to reflect the data structure in the model. We develop a semiparametric Bayesian modeling approach, restricting attention to two levels of repeated measurements. For the top-level longitudinal sampling model we use random effects to introduce the desired dependence across repeated measurements. We use a nonparametric prior for the random effects distribution. Inference about dependence across second-level repetition is implemented by the clustering implied in the nonparametric random effects model. Practical use of the model requires that the posterior distribution on the latent random effects be reasonably precise.     

Correlations in spiking neuronal networks with distance dependent connections

Can the topology of a recurrent spiking network be inferred from observed activity dynamics? Which statistical parameters of network connectivity can be extracted from firing rates, correlations and related measurable quantities? To approach these questions, we analyze distance dependent correlations of the activity in small-world networks of neurons with current-based synapses derived from a simple ring topology. We find that in particular the distribution of correlation coefficients of subthreshold activity can tell apart random networks from networks with distance dependent connectivity. Such distributions can be estimated by sampling from random pairs. We also demonstrate the crucial role of the weight distribution, most notably the compliance with Dales principle, for the activity dynamics in recurrent networks of different types.