SearcharxivSearch

arXiv · 2507.14008

Large deviations at the edge for 1D gases and tridiagonal random matrices at high temperature

Abstract

We consider a model of a gas of $N$ confined particles subject to a two-body repulsive interaction, namely the one-dimensional log or Riesz gas. We are interested in the so-called \textit{high temperature} regime, \textit{i.e.} when the inverse temperature is given by $\beta_N=2\alpha/N$ for some $\alpha>0$. We establish, in the log case, a large deviation (LD) principle and moderate deviations estimates for the largest particle $x_\mathrm{max}$ when appropriately rescaled. Our result is in the continuity of [Ben Arous Dembo Guionnet 01', Pakzad 20'] where such estimates were shown for the largest particle of the $\beta$-ensemble at fixed $\beta_N=\beta>0$ and $\beta_N\gg N^{-1}$ respectively. We show that the corresponding rate function is the same as in the case of iid particles. We also provide LD estimates in the Riesz case. Additionally, we consider related models of symmetric tridiagonal random matrices with independent entries having Gaussian tails; for which we establish the LD principle for the top eigenvalue. In a certain specialization of the entries, we recover the result for the largest particle of the log-gas. We show that LD are created by a few entries taking abnormally large values.

Explore related subjects

Keep this discovery

BibTeXRIS

Charlie Dworaczek Guera, Ronan Memin. 2025-07-18. Large deviations at the edge for 1D gases and tridiagonal random matrices at high temperature. https://arxiv.org/abs/2507.14008

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