SearcharxivSearch

arXiv · 1201.4260

Applications of a simple but useful technique to stochastic convolution of $α$-stable processes

Abstract

Our simple but useful technique is using an integration by parts to split the stochastic convolution into two terms. We develop five applications for this technique. The first one is getting a uniform estimate of stochastic convolution of $α$-stable processes. Since $α$-stable noises only have $p<α$ moment, unlike the stochastic convolution of Wiener process, the well known Da Prato-Kwapień-Zabczyk's factorization ([5]) is not applicable. Alternatively, combining this technique with Doob's martingale inequality, we obtain a uniform estimate similar to that of stochastic convolution of Wiener process. Using this estimate, we show that the stochastic convolution of $α$-stable noises stays, with positive probability, in arbitrary small ball with zero center. These two results are important for studying ergodicity and regularity of stochastic PDEs forced by $α$-stable noises ([9]). The third application is getting the same results as in [12]. The fourth one gives the trajectory regularity of stochastic Burgers equation forced by $α$-stable noises ([9]). Finally, applying a similar integration by parts to stochastic convolution of Wiener noises, we get the uniform estimate and continuity property originally obtained by Da Prato-Kwapień-Zabczyk's factorization.

Explore related subjects

Keep this discovery

BibTeXRIS

Lihu Xu. 2012-01-23. Applications of a simple but useful technique to stochastic convolution of $α$-stable processes. https://arxiv.org/abs/1201.4260

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