Search arXiv⌕ Search

arXiv · 2610.27166

Central Limit Theorem for continuous $N$-particle systems in fixed- and high-temperature: single level

Abstract

We characterize central limit theorems for polynomial linear statistics of continuous $N$-particle systems on $\mathbb R$, in both the fixed-temperature regime $θ=β/2>0$ and the high-temperature regime $Nθ\toγ>0$. In each regime, we give necessary and sufficient conditions in terms of the coefficients of the logarithmic Bessel generating function, together with an explicit combinatorial formula for the limiting covariance. At fixed temperature, this formula recovers the classical second-order free moment--cumulant relation, up to the factor $1/θ$; at high temperature, it yields new second-order free $γ$-cumulants and their covariance relations. The proof combines moment extraction through Dunkl operators with a topological expansion of the logarithmic multivariate Bessel function indexed by ribbon graphs on surfaces. This expansion gives a topological interpretation of the free-cumulants: only genus zero contributes at fixed temperature, whereas arbitrarily high genera contribute at high temperature. As applications, we prove that $β$-addition preserves the CLT in both regimes and determine its limiting covariance from the input free cumulants, and establish a suitably rescaled transition from the high-temperature covariance to its fixed-temperature counterpart as $γ\to\infty$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jiaming Xu. 2026-10-19. Central Limit Theorem for continuous $N$-particle systems in fixed- and high-temperature: single level. https://arxiv.org/abs/2610.27166

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Graph-diameter criteria and sharp dissipation in discrete Wasserstein-Fisher geometry

We study the probability simplex of a finite connected weighted graph with an Onsager operator combining logarithmic-mean transport and mass-conserving Fisher reaction. For every fixed positive reaction parameter, we prove that the entropy Hessian has a finite global lower bound if and only if the original transport graph has diameter at most two. Near a boundary probability, the corresponding criterion is that its positive support reaches every vertex in at most two steps. The proof controls all potential directions under arbitrary multiscale boundary degeneration. For graphs of diameter at most two, the optimal lower bound is Lipschitz on bounded parameter intervals, including the pure-transport endpoint. We also determine the largest instantaneous logarithmic-amplitude dissipation function depending only on the graph and the current amplitude, and construct two-level probabilities attaining it. Its positivity has the same two-step criterion. As consequences, we obtain graph-dependent entropy-decay estimates and exact projective contraction bounds without assuming nonnegative entropic curvature.

math.PR↗

Two-neighbor lattice percolation percolates in all dimensions

It is trivial that $1$-dimensional $2$-neighbor lattice percolation percolates. Coupier, Henry, Jahnel and Köppl proved the $2$-neighbor lattice percolation percolates in dimension 2; and then for sufficiently large dimensions, Bäumler, Jahnel, Köppl, Lodewijks, Reeves and Tóbiás showed this is still true. In this paper, we verify that the $2$-neighbor lattice percolation percolates in all dimensions $d\ge 3.$

math.PR↗

Strong approximations for dependent random fields

We establish strong Gaussian approximations for centered stationary random fields on $\mathbb Z^d$, $d\ge2$, represented as measurable functions of i.i.d.\ innovations. Under finite $p$th moments, $p>2$, and sufficiently fast decay of spatial dependence, we construct a single coupling of the field with an i.i.d.\ Gaussian field. Its partial sums, scaled by the long-run standard deviation, approximate those of the original field almost surely, uniformly over all rectangular prefixes and all observation scales. Over a cube of side length $n$, the approximation error is $O_{\mathrm{a.s.}}(n^{\max\{d/p,(d-1)/2\}})$ up to logarithmic factors. While $d/p$ is the familiar moment term, the surface term $(d-1)/2$, absent for independent planar arrays, emerges as a cost of dependence, and cannot be removed even for finite-range Gaussian fields. The assumptions accommodate nonlinear and noncausal fields without imposing mixing. The proof combines a permanent dyadic blocking, a local Gaussian coupling in tensor Haar coordinates driven by a Doob martingale with vanishing conditional third moments, and a comparison of the resulting dependent Gaussian blocks with white noise.

math.PR↗