SearcharxivSearch

arXiv · 2312.15774

Central Limit Theorem of Overlap for the Mean Field Ghatak-Sherrington model

Abstract

The Ghatak-Sherrington (GS) spin glass model is a random probability measure defined on the configuration space $\{0,\pm1,\pm2,\ldots, \pm \mathcal{S} \}^N$ with system size $N$ and $\mathcal{S}\ge1$ finite. This generalizes the classical Sherrington-Kirkpatrick (SK) model on the boolean cube $\{-1,+1\}^N$ in order to capture more complex behaviors, including the spontaneous inverse freezing phenomenon. Although many results on the physics side have been established to understand the GS model, mathematical exploration of the model remains scarce. Overlap, the normalized inner product of two configurations, acts as the system order parameter to understand the phase transition of mean-field spin glass models. In this paper, we use moment method combined with the cavity approach to rigorously establish a quantitative joint central limit theorem for the overlap and self-overlap array. The results hold at high temperatures under arbitrary crystal and external fields. Compared to the SK model, the main challenge comes from the non-trivial self-overlap terms which also correlated with the standard overlap terms.

Explore related subjects

Keep this discovery

BibTeXRIS

Yueqi Sheng, Qiang Wu. 2023-12-25. Central Limit Theorem of Overlap for the Mean Field Ghatak-Sherrington model. https://arxiv.org/abs/2312.15774

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