SearcharxivSearch

arXiv · 2305.12312

Large Deviations of Fractional Stochastic Equations with Non-Lipschitz Drift and Multiplicative Noise on Unbounded Domains

Abstract

This paper is concerned with the large deviation principle of the non-local fractional stochastic reaction-diffusion equation with a polynomial drift of arbitrary degree driven by multiplicative noise defined on unbounded domains. We first prove the strong convergence of the solutions of a control equation with respect to the weak topology of controls, and then show the convergence in distribution of the solutions of the stochastic equation when the noise intensity approaches zero. We finally establish the large deviations of the stochastic equation by the weak convergence method. The main difficulty of the paper is caused by the non-compactness of Sobolev embeddings on unbounded domains, and the idea of uniform tail-ends estimates is employed to circumvent the obstacle in order to obtain the tightness of distribution laws of the stochastic equation and the precompactness of the control equation.

Explore related subjects

Keep this discovery

BibTeXRIS

Bixiang Wang. 2023-05-21. Large Deviations of Fractional Stochastic Equations with Non-Lipschitz Drift and Multiplicative Noise on Unbounded Domains. https://arxiv.org/abs/2305.12312

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