SearcharxivSearch

arXiv · 1202.1001

Asymptotic properties of certain diffusion ratchets with locally negative drift

Abstract

We consider two reflecting diffusion processes $(X_t)_{t \ge 0}$ with a moving reflection boundary given by a non-decreasing pure jump Markov process $(R_t)_{t \ge 0}$. Between the jumps of the reflection boundary the diffusion part behaves as a reflecting Brownian motion with negative drift or as a reflecting Ornstein-Uhlenbeck process. In both cases at rate $\gamma(X_t -R_t)$ for some $\gamma \ge 0$ the reflection boundary jumps to a new value chosen uniformly in $[R_{t-},X_t]$. Since after each jump of the reflection boundary the diffusions are reflected at a higher level we call the processes Brownian ratchet and Ornstein-Uhlenbeck ratchet. Such diffusion ratchets are biologically motivated by passive protein transport across membranes. The processes considered here are generalisations of the Brownian ratchet (without drift) studied in (Depperschmidt and Pfaffelhuber, 2010). For both processes we prove a law of large numbers, in particular each of the ratchets moves to infinity at a positive speed which can be computed explicitly, and a central limit theorem.

Explore related subjects

Keep this discovery

BibTeXRIS

Andrej Depperschmidt, Sophia Götz. 2012-02-05. Asymptotic properties of certain diffusion ratchets with locally negative drift. https://arxiv.org/abs/1202.1001

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