SearcharxivSearch

arXiv · 2609.11543

Fourth-Order Fusion Asymptotics for $\mathrm{Sine}_\beta$ Correlation Functions

Abstract

We compute the fourth-order correction to the full-collision asymptotics of the correlation functions of the $\mathrm{Sine}_\beta$ process. For $m \ge 2$ and $m\beta > 3$, the normalized correlation has an expansion through order $\epsilon^4$, with an explicit rational coefficient depending on the centered profile only through its fourth power sum and the square of its second power sum. The remainder is $o(\epsilon^4)$, locally uniformly in the collision profile. We evaluate the required fourth inverse moments of the Hua-Pickrell environment by finite-dimensional Ward identities and prove their convergence using characteristic-polynomial derivative bounds. A fourth-order expectation-Taylor lemma handles the full range $m\beta > 3$ without requiring fourth moments of every analytic derivative. For general unitary ensembles with a $C^4$ confining potential and a regular bulk point, we prove convergence of the finite-particle fusion coefficients through fourth order and a joint second-order limit, using complex kernel universality and divided differences. This unitary result imposes no fused-environment hypotheses. For arbitrary $\beta$, we retain a conditional quadratic transfer criterion.

Explore related subjects

Keep this discovery

BibTeXRIS

Weiyang Fang. 2026-09-10. Fourth-Order Fusion Asymptotics for $\mathrm{Sine}_\beta$ Correlation Functions. https://arxiv.org/abs/2609.11543

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