SearcharxivSearch

arXiv · 1208.1165

A Generalized Mean-Reverting Equation and Applications

Abstract

Consider a mean-reverting equation, generalized in the sense it is driven by a 1-dimensional centered Gaussian process with H\"older continuous paths on $[0,T]$ ($T > 0$). Taking that equation in rough paths sense only gives local existence of the solution because the non-explosion condition is not satisfied in general. Under natural assumptions, by using specific methods, we show the global existence and uniqueness of the solution, its integrability, the continuity and differentiability of the associated It\^o map, and we provide an $L^p$-converging approximation with a rate of convergence ($p\geq 1$). The regularity of the It\^o map ensures a large deviation principle, and the existence of a density with respect to the Lebesgue measure, for the solution of that generalized mean-reverting equation. Finally, we study a generalized mean-reverting pharmacokinetic model.

Explore related subjects

Keep this discovery

BibTeXRIS

Nicolas Marie. 2012-08-06. A Generalized Mean-Reverting Equation and Applications. https://doi.org/10.1051/ps/2014002

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