SearcharxivSearch

arXiv · 2107.14504

Asymptotic expansions for a class of Fredholm Pfaffians and interacting particle systems

Abstract

Motivated by the phenomenon of duality for interacting particle systems we introduce two classes of Pfaffian kernels describing a number of Pfaffian point processes in the `bulk' and at the `edge'. Using the probabilistic method due to Mark Kac, we prove two Szeg\H{o}-type asymptotic expansion theorems for the corresponding Fredholm Pfaffians. The idea of the proof is to introduce an effective random walk with transition density determined by the Pfaffian kernel, express the logarithm of the Fredholm Pfaffian through expectations with respect to the random walk, and analyse the expectations using general results on random walks. We demonstrate the utility of the theorems by calculating asymptotics for the empty interval and non-crossing probabilities for a number of examples of Pfaffian point processes: coalescing/annihilating Brownian motions, massive coalescing Brownian motions, real zeros of Gaussian power series and Kac polynomials, and real eigenvalues for the real Ginibre ensemble.

Explore related subjects

Keep this discovery

BibTeXRIS

Will FitzGerald, Roger Tribe, Oleg Zaboronski. 2021-07-30. Asymptotic expansions for a class of Fredholm Pfaffians and interacting particle systems. https://doi.org/10.1214/22-aop1586

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