Search arXivSearch

arXiv · 2203.02850

Fluctuations of Quadratic Chaos

Abstract

In this paper we characterize all distributional limits of the random quadratic form $T_n =\sum_{1\le u< v\le n} a_{u, v} X_u X_v$, where $((a_{u, v}))_{1\le u,v\le n}$ is a $\{0, 1\}$-valued symmetric matrix with zeros on the diagonal and $X_1, X_2, \ldots, X_n$ are i.i.d.~ mean $0$ variance $1$ random variables with common distribution function $F$. In particular, we show that any distributional limit of $S_n:=T_n/\sqrt{\mathrm{Var}[T_n]}$ can be expressed as the sum of three independent components: a Gaussian, a (possibly) infinite weighted sum of independent centered chi-squares, and a Gaussian mixture with a random variance. As a consequence, we prove a fourth moment theorem for the asymptotic normality of $S_n$, which applies even when $F$ does not have finite fourth moment. More formally, we show that $S_n$ converges to $N(0, 1)$ if and only if the fourth moment of $S_n$ (appropriately truncated when $F$ does not have finite fourth moment) converges to 3 (the fourth moment of the standard normal distribution).

Explore related subjects

Keep this discovery

BibTeXRIS

Bhaswar B. Bhattacharya, Sayan Das, Somabha Mukherjee, Sumit Mukherjee. 2022-03-06. Fluctuations of Quadratic Chaos. https://doi.org/10.1007/s00220-024-05072-w

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