SearcharxivSearch

arXiv · 2608.12804

Scaling Limits for Ising Models on Inhomogeneous Random Graphs and Applications

Abstract

In this paper, we derive quenched scaling limits for linear functionals and the empirical spin field of Ising models on inhomogeneous random graphs generated by a graphon (encompassing both dense and sparse graphs), in the high-temperature regime. We first prove a joint central limit theorem (CLT) for finite collections of linear statistics of the spin configurations, where the limiting covariance is characterized by the resolvent of the associated graphon integral operator. Building on this result, we establish functional CLTs for the average magnetization and for the spin field indexed by suitable classes of regular test functions. We further prove convergence of the full empirical spin field, viewed as a random generalized function in negative Sobolev spaces. These scaling limits provide applications to both Bayesian neural networks and causal inference. Specifically, for the former, we derive infinite-width Gaussian-process limits for two-layer Bayesian neural networks with Ising-dependent output-layer signs, while for the latter, we establish the asymptotic normality of H\'{a}jek estimators for average treatment effects under network interference.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sanchayan Bhowal, Anirban Chatterjee, Somabha Mukherjee. 2026-08-13. Scaling Limits for Ising Models on Inhomogeneous Random Graphs and Applications. https://arxiv.org/abs/2608.12804

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