We show that in the generic situation where a biological network, e.g. a protein interaction network, is in fact a subnetwork embedded in a larger "bulk" network, the presence of the bulk causes not just extrinsic noise but also memory effects. This means that the dynamics of the subnetwork will depend not only on its present state, but also its past. We use projection techniques to get explicit expressions for the memory functions that encode such memory effects, for generic protein interaction networks involving binary and unary reactions such as complex formation and phosphorylation, respectively. Remarkably, in the limit of low intrinsic copy-number noise such expressions can be obtained even for nonlinear dependences on the past. We illustrate the method with examples from a protein interaction network around epidermal growth factor receptor (EGFR), which is relevant to cancer signalling. These examples demonstrate that inclusion of memory terms is not only important conceptually but also leads to substantially higher quantitative accuracy in the predicted subnetwork dynamics.
Abstract. The Langevin formulation of a number of well-known stochastic processes involves multiplicative noise. In this work we present a systematic mapping of a process with multiplicative noise to a related process with additive noise, which may often be easier to analyse. The mapping is easily understood in the example of the branching process. In a second example we study the random neighbour (or infinite range) contact process which is mapped to an Ornstein-Uhlenbeck process with absorbing wall. The present work might shed some light on absorbing state phase transitions in general, such as the role of conditional expectation values and finite size scaling, and elucidate the meaning of the noise amplitude. While we focus on the physical interpretation of the mapping, we also provide a mathematical derivation.
To understand the behaviour of complex systems, it is often necessary to use models that describe the dynamics of subnetworks. It has previously been established using projection methods that such subnetwork dynamics generically involves memory of the past and that the memory functions can be calculated explicitly for biochemical reaction networks made up of unary and binary reactions. However, many established network models involve also Michaelis-Menten kinetics, to describe, e.g., enzymatic reactions. We show that the projection approach to subnetwork dynamics can be extended to such networks, thus significantly broadening its range of applicability. To derive the extension, we construct a larger network that represents enzymes and enzyme complexes explicitly, obtain the projected equations, and finally take the limit of fast enzyme reactions that gives back Michaelis-Menten kinetics. The crucial point is that this limit can be taken in closed form. The outcome is a simple procedure that allows one to obtain a description of subnetwork dynamics, including memory functions, starting directly from any given network of unary, binary, and Michaelis-Menten reactions. Numerical tests show that this closed form enzyme elimination gives a much more accurate description of the subnetwork dynamics than the simpler method that represents enzymes explicitly and is also more efficient computationally.
We consider the general problem of describing the dynamics of subnetworks of larger biochemical reaction networks, e.g., protein interaction networks involving complex formation and dissociation reactions. We propose the use of model reduction strategies to understand the "extrinsic" sources of stochasticity arising from the rest of the network. Our approaches are based on subnetwork dynamical equations derived by projection methods and path integrals. The results provide a principled derivation of different components of the extrinsic noise that is observed experimentally in cellular biochemical reactions, over and above the intrinsic noise from the stochasticity of biochemical events in the subnetwork. We explore several intermediate approximations to assess systematically the relative importance of different extrinsic noise components, including initial transients, long-time plateaus, temporal correlations, multiplicative noise terms, and nonlinear noise propagation. The best approximations achieve excellent accuracy in quantitative tests on a simple protein network and on the epidermal growth factor receptor signaling network.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.