SearcharxivSearch

arXiv · 2405.10580

A stochastic version of the Hopfield-Ninio kinetic proofreading model

Abstract

In this paper we study a simple stochastic version of the Hopfield-Ninio kinetic proofreading model. The model is characterized by means of two parameters, the unbinding time, which depends on the binding energy between a ligand and a receptor, and the number of times $M \geq 1$ that a ligand attaches to a receptor. We prove that, under suitable assumptions on M, our model has an extreme specificity, i.e. it is capable to discriminate between different ligands, and a high sensitivity, i.e. the response of the system does not change in a significant manner for ranges of ligands varying within several orders of magnitude. Additional quantities like the amount of energy used by the network or the time required to yield a response will be also computed. We also show that our results are robust, i.e., they do not depend on the specific choice of parameters that we make in this paper.

Explore related subjects

Keep this discovery

BibTeXRIS

Eugenia Franco, Juan J. L. Velázquez. 2024-05-17. A stochastic version of the Hopfield-Ninio kinetic proofreading model. https://arxiv.org/abs/2405.10580

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