SearcharxivSearch

arXiv subjects

Baruch Barzel

Publications and source records attributed to Baruch Barzel.

24 records · Page 2Linked to original sources

RIDS: Robust Identification of Sparse Gene Regulatory Networks from Perturbation Experiments

Reconstructing the causal network in a complex dynamical system plays a crucial role in many applications, from sub-cellular biology to economic systems. Here we focus on inferring gene regulation networks (GRNs) from perturbation or gene deletion experiments. Despite their scientific merit, such perturbation experiments are not often used for such inference due to their costly experimental procedure, requiring significant resources to complete the measurement of every single experiment. To overcome this challenge, we develop the Robust IDentification of Sparse networks (RIDS) method that reconstructs the GRN from a small number of perturbation experiments. Our method uses the gene expression data observed in each experiment and translates that into a steady state condition of the system's nonlinear interaction dynamics. Applying a sparse optimization criterion, we are able to extract the parameters of the underlying weighted network, even from very few experiments. In fact, we demonstrate analytically that, under certain conditions, the GRN can be perfectly reconstructed using $K = Ω(d_{max})$ perturbation experiments, where $d_{max}$ is the maximum in-degree of the GRN, a small value for realistic sparse networks, indicating that RIDS can achieve high performance with a scalable number of experiments. We test our method on both synthetic and experimental data extracted from the DREAM5 network inference challenge. We show that the RIDS achieves superior performance compared to the state-of-the-art methods, while requiring as few as ~60% less experimental data. Moreover, as opposed to almost all competing methods, RIDS allows us to infer the directionality of the GRN links, allowing us to infer empirical GRNs, without relying on the commonly provided list of transcription factors.

q-bio.QM

Spectrum of Controlling and Observing Complex Networks

Observing and controlling complex networks are of paramount interest for understanding complex physical, biological and technological systems. Recent studies have made important advances in identifying sensor or driver nodes, through which we can observe or control a complex system. Yet, the observational uncertainty induced by measurement noise and the energy required for control continue to be significant challenges in practical applications. Here we show that the variability of control energy and observational uncertainty for different directions of the state space depend strongly on the number of driver nodes. In particular, we find that if all nodes are directly driven, control is energetically feasible, as the maximum energy increases sublinearly with the system size. If, however, we aim to control a system through a single node, control in some directions is energetically prohibitive, increasing exponentially with the system size. For the cases in between, the maximum energy decays exponentially when the number of driver nodes increases. We validate our findings in several model and real networks, arriving to a series of fundamental laws to describe the control energy that together deepen our understanding of complex systems.

physics.soc-ph

Binomial moment equations for stochastic reaction systems

A highly efficient formulation of moment equations for stochastic reaction networks is introduced. It is based on a set of binomial moments that capture the combinatorics of the reaction processes. The resulting set of equations can be easily runcated to include moments up to any desired order. The number of equations is dramatically reduced compared to the master equation. This formulation enables the simulation of complex reaction networks, involving a large number of reactive species much beyond the feasibility limit of any existing method. It provides an equation-based paradigm to the analysis of stochastic networks, complementing the commonly used Monte Carlo simulations.

cond-mat.stat-mech

Stochastic Analysis of Dimerization Systems

The process of dimerization, in which two monomers bind to each other and form a dimer, is common in nature. This process can be modeled using rate equations, from which the average copy numbers of the reacting monomers and of the product dimers can then be obtained. However, the rate equations apply only when these copy numbers are large. In the limit of small copy numbers the system becomes dominated by fluctuations, which are not accounted for by the rate equations. In this limit one must use stochastic methods such as direct integration of the master equation or Monte Carlo simulations. These methods are computationally intensive and rarely succumb to analytical solutions. Here we use the recently introduced moment equations which provide a highly simplified stochastic treatment of the dimerization process. Using this approach, we obtain an analytical solution for the copy numbers and reaction rates both under steady state conditions and in the time-dependent case. We analyze three different dimerization processes: dimerization without dissociation, dimerization with dissociation and hetero-dimer formation. To validate the results we compare them with the results obtained from the master equation in the stochastic limit and with those obtained from the rate equations in the deterministic limit. Potential applications of the results in different physical contexts are discussed.

physics.comp-ph

Quantifying the connectivity of a network: The network correlation function method

Networks are useful for describing systems of interacting objects, where the nodes represent the objects and the edges represent the interactions between them. The applications include chemical and metabolic systems, food webs as well as social networks. Lately, it was found that many of these networks display some common topological features, such as high clustering, small average path length (small world networks) and a power-law degree distribution (scale free networks). The topological features of a network are commonly related to the network's functionality. However, the topology alone does not account for the nature of the interactions in the network and their strength. Here we introduce a method for evaluating the correlations between pairs of nodes in the network. These correlations depend both on the topology and on the functionality of the network. A network with high connectivity displays strong correlations between its interacting nodes and thus features small-world functionality. We quantify the correlations between all pairs of nodes in the network, and express them as matrix elements in the correlation matrix. From this information one can plot the correlation function for the network and to extract the correlation length. The connectivity of a network is then defined as the ratio between this correlation length and the average path length of the network. Using this method we distinguish between a topological small world and a functional small world, where the latter is characterized by long range correlations and high connectivity. Clearly, networks which share the same topology, may have different connectivities, based on the nature and strength of their interactions. The method is demonstrated on metabolic networks, but can be readily generalized to other types of networks.

physics.comp-ph

Evaluation of the Multiplane Method for Efficient Simulations of Reaction Networks

Reaction networks in the bulk and on surfaces are widespread in physical, chemical and biological systems. In macroscopic systems, which include large populations of reactive species, stochastic fluctuations are negligible and the reaction rates can be evaluated using rate equations. However, many physical systems are partitioned into microscopic domains, where the number of molecules in each domain is small and fluctuations are strong. Under these conditions, the simulation of reaction networks requires stochastic methods such as direct integration of the master equation. However, direct integration of the master equation is infeasible for complex networks, because the number of equations proliferates as the number of reactive species increases. Recently, the multiplane method, which provides a dramatic reduction in the number of equations, was introduced [A. Lipshtat and O. Biham, Phys. Rev. Lett. 93, 170601 (2004)]. The reduction is achieved by breaking the network into a set of maximal fully connected sub-networks (maximal cliques). Lower-dimensional master equations are constructed for the marginal probability distributions associated with the cliques, with suitable couplings between them. In this paper we test the multiplane method and examine its applicability. We show that the method is accurate in the limit of small domains, where fluctuations are strong. It thus provides an efficient framework for the stochastic simulation of complex reaction networks with strong fluctuations, for which rate equations fail and direct integration of the master equation is infeasible. The method also applies in the case of large domains, where it converges to the rate equation results.

cond-mat.stat-mech