SearcharxivSearch

arXiv · 2602.22885

Pfaffian structure of basin walls for coalescing particles

Abstract

Coalescing particles on a line merge when they meet. As they do, their basins of attraction merge and the walls between basins disappear. If every site is initially occupied, these walls at any positive time form a Pfaffian point process: all correlation functions are determined by pairwise quantities arranged in antisymmetric matrices. Tribe, Zaboronski, Garrod, and Poplavskyi established this structure using analytic methods for time-homogeneous dynamics; our combinatorial approach works for any skip-free process (one where particles cannot change order without first meeting). We show that the Pfaffian structure lives naturally at the wall level: we prove an exact Pfaffian empty-interval formula for the walls and compute the cumulants of the wall indicators (higher-order analogs of the variance) as signed sums of probabilities that independent particles started at the interval endpoint positions reorder in specific ways. A structural property of these sums, indecomposability - every nonzero term couples all wall positions together - implies a central limit theorem for the wall count. A checkerboard duality identifies the walls of one process with the surviving particles of the dual process. This covers totally asymmetric dynamics and position-dependent transition rules, and for Brownian motion recovers the known Pfaffian point process.

Explore related subjects

Keep this discovery

BibTeXRIS

Piotr Śniady. 2026-02-26. Pfaffian structure of basin walls for coalescing particles. https://arxiv.org/abs/2602.22885

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