SearcharxivSearch

arXiv · 1308.4884

Ergodicity of a Generalized Jacobi's Equation and Applications

Abstract

Consider a $1$-dimensional centered Gaussian process $W$ with $α$-Hölder continuous paths on the compact intervals of $\mathbb R_+$ ($α\in ]0,1[$) and $W_0 = 0$, and $X$ the local solution in rough paths sense of Jacobi's equation driven by the signal $W$. The global existence and the uniqueness of the solution are proved via a change of variable taking into account the singularities of the vector field, because it doesn't satisfy the non-explosion condition. The regularity of the associated Itô map is studied. By using these deterministic results, Jacobi's equation is studied on probabilistic side : an ergodic theorem in L. Arnold's random dynamical systems framework, and the existence of an explicit density with respect to Lebesgue's measure for each $X_t$, $t > 0$ are proved. The paper concludes on a generalization of Morris-Lecar's neuron model, where the normalized conductance of the $\textrm{K}^+$ current is the solution of a generalized Jacobi's equation.

Explore related subjects

Keep this discovery

BibTeXRIS

Nicolas Marie. 2015-09-02. Ergodicity of a Generalized Jacobi's Equation and Applications. https://doi.org/10.1016/j.spa.2015.07.015

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