Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2310.10784

Almost sure central limit theorem for the hyperbolic Anderson model with L\'evy white noise

Raluca M. Balan·Panqiu Xia·Guangqu Zheng
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we present an almost sure central limit theorem (ASCLT) for the hyperbolic Anderson model (HAM) with a L\'evy white noise in a finite-variance setting, complementing a recent work by Balan and Zheng (\emph{Trans.~Amer.~Math.~Soc.}, 2024) on the (quantitative) central limit theorems for the solution to the HAM. We provide two different proofs: one uses the Clark-Ocone formula and takes advantage of the martingale structure of the white-in-time noise, while the other is obtained by combining the second-order Gaussian Poincar\'e inequality with Ibragimov and Lifshits' method of characteristic functions. Both approaches are different from the one developed in the PhD thesis of C. Zheng (2011), allowing us to establish the ASCLT without lengthy computations of star contractions. Moreover, the second approach is expected to be useful for similar studies on SPDEs with colored-in-time noises, whereas the former, based on It\^o calculus, is not applicable.

Explore related subjects

math.PR

Keep this discovery

BibTeXRIS

Raluca M. Balan, Panqiu Xia, Guangqu Zheng. 2023-10-16. Almost sure central limit theorem for the hyperbolic Anderson model with L\'evy white noise. https://doi.org/10.1090/proc/17204

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗