SearcharxivSearch

arXiv · 1107.5219

Realistic extensions of a Brownian ratchet for protein translocation

Abstract

We study a model for the translocation of proteins across membranes through a nanopore using a ratcheting mechanism. When the protein enters the nanopore it diffuses in and out of the pore according to a Brownian motion. Moreover, it is bound by ratcheting molecules which hinder the diffusion of the protein out of the nanopore, i.e. the Brownian motion is reflected such that no ratcheting molecule exits the pore. New ratcheting molecules bind at rate gamma. Extending our previous approach (Depperschmidt and Pfaffelhuber, 2010) we allow the ratcheting molecules to dissociate (at rate delta) from the protein (Model I). We also provide an approximate model (Model II) which assumes a Poisson equilibrium of ratcheting molecules on one side of the current reflection boundary. Using analytical methods and simulations we show that the speed of both models are approximately the same. Our analytical results on Model II give the speed of translocation by means of a solution of an ordinary differential equation.

Explore related subjects

Keep this discovery

BibTeXRIS

A. Depperschmidt, N. Ketterer, P. Pfaffelhuber. 2011-07-26. Realistic extensions of a Brownian ratchet for protein translocation. https://arxiv.org/abs/1107.5219

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