SearcharxivSearch

arXiv · 1705.02948

Large Deviations for Small Noise Diffusions in a Fast Markovian Environment

Abstract

A large deviation principle is established for a two-scale stochastic system in which the slow component is a continuous process given by a small noise finite dimensional Itô stochastic differential equation, and the fast component is a finite state pure jump process. Previous works have considered settings where the coupling between the components is weak in a certain sense. In the current work we study a fully coupled system in which the drift and diffusion coefficient of the slow component and the jump intensity function and jump distribution of the fast process depend on the states of both components. In addition, the diffusion can be degenerate. Our proofs use certain stochastic control representations for expectations of exponential functionals of finite dimensional Brownian motions and Poisson random measures together with weak convergence arguments. A key challenge is in the proof of the large deviation lower bound where, due to the interplay between the degeneracy of the diffusion and the full dependence of the coefficients on the two components, the associated local rate function has poor regularity properties.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Amarjit Budhiraja, Paul Dupuis, Arnab Ganguly. 2017-05-08. Large Deviations for Small Noise Diffusions in a Fast Markovian Environment. https://arxiv.org/abs/1705.02948

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