SearcharxivSearch

arXiv · 1308.1124

Smooth densities of stochastic differential equations forced by degenerate stable type noises

Abstract

Using the Bismut's approach to Malliavin calculus, we introduce a simplified Malliavin matrix ([11]) for stochastic differential equations (SDEs) force by degenerate stable like noises. For the degenerate SDEs driven by Wiener noises, one can derive a Norris type lemma and use it \emph{iteratively} to prove the smoothness of density functions. Unfortunately, Norris type lemma is very hard to be iteratively applied to SDEs with stable like noises. In this paper, we derive a simple inequality as a replacement and use it to show that two families of degenerate SDEs with stable like noises admit smooth density functions. One family is the linear SDEs studied by Priola and Zabczyk ([13]), under some additional assumption we can iteratively use the inequality to get the smoothness of the density. The other family is the general SDEs with stable like noises, we can apply this inequality only \emph{one} time and thus derive that the SDEs admit smooth density if the \emph{first} order Lie brackets span $\R^d$. The crucial step in this paper is estimating the smallest eigenvalue of the simplified Malliavin matrix, which only uses some elementary facts of Poisson processes and undergraduate level ordinary differential equations.

Explore related subjects

Keep this discovery

BibTeXRIS

Lihu Xu. 2014-02-20. Smooth densities of stochastic differential equations forced by degenerate stable type noises. https://arxiv.org/abs/1308.1124

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