SearcharxivSearch

arXiv · 1211.6539

Mod\'elisation de r\'eseaux de r\'egulation de g\`enes par processus d\'eterministes par morceaux

Abstract

The molecular evolution in a gene regulatory network is classically modeled by Markov jump processes. However, the direct simulation of such models is extremely time consuming. Indeed, even the simplest Markovian model, such as the production module of a single protein involves tens of variables and biochemical reactions and an equivalent number of parameters. We study the asymptotic behavior of multiscale sto- chastic gene networks using weak limits of Markov jump processes. The results allow us to propose new models with reduced execution times. In a new article, we have shown that, depending on the time and concentration scales of the system, the Markov jump processes could be approximated by piecewise deterministic processes. We give some applications of our results for simple gene networks (Cook's model and Lambda-phage model).

Explore related subjects

Keep this discovery

BibTeXRIS

Aurélie Muller-Gueudin. 2012-11-28. Mod\'elisation de r\'eseaux de r\'egulation de g\`enes par processus d\'eterministes par morceaux. https://arxiv.org/abs/1211.6539

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR