Search arXivSearch

arXiv · 2406.12722

Non-central limit of densities of some functionals of Gaussian processes

Abstract

We establish the convergence of the densities of a sequence of nonlinear functionals of an underlying Gaussian process to the density of a Gamma distribution. The key idea of our work is a new density formula for random variables in the setting of Markov diffusion generators, which yields a special representation for the density of a Gamma distribution. Via this representation, we are able to provide precise estimates on the distance between densities while developing the techniques of Malliavin calculus and Stein's method suitable to Gamma approximation at the density level. We first focus our study on the case of random variables living in a fixed Wiener chaos of an even order for which the bound for the difference of the densities can be dominated by a linear combination of moments up to order four. We then study the case of general Gaussian functionals with possibly infinite chaos expansion. Finally, we provide an application to random variables living in the second Wiener chaos.

Explore related subjects

Keep this discovery

BibTeXRIS

Solesne Bourguin, Thanh Dang, Yaozhong Hu. 2024-06-18. Non-central limit of densities of some functionals of Gaussian processes. https://arxiv.org/abs/2406.12722

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