SearcharxivSearch

arXiv · 2602.04429

Disordered systems and (subcritical) polynomial chaos with heavy-tail disorder

Abstract

We study discrete statistical mechanics systems perturbed by a random environment without a finite second moment. Specifically, we consider a random environment whose tail distribution satisfies $P[\omega > x] \sim x^{-\gamma}$ as $x \to +\infty$ for some $\gamma \in (1,2)$. Inspired by the seminal work of Caravenna, Sun and Zygouras \cite{csz_2016}, we adopt a general framework that encompasses as key examples both the disordered pinning model and the long-range directed polymer model. We provide some subcriticality condition under which we prove that the discrete disordered system possesses a non-trivial scaling limit. We also interpret the subcriticality condition in terms of a generalized Harris criterion without second moment, which gives a prediction for disorder relevance depending on the parameters of the system. Our analysis relies on the study of multilinear polynomials of independent heavy-tailed random variables known as polynomial chaos and their continuous analogue, given by multiple integrals with respect to a $\gamma$-stable L\'evy white noise. We develop precise and flexible moments estimates adapted to the heavy-tailed setting.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gaspard Gomez. 2026-02-04. Disordered systems and (subcritical) polynomial chaos with heavy-tail disorder. https://arxiv.org/abs/2602.04429

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