SearcharxivSearch

arXiv · 2602.20043

Coalescing random walks via the coalescence determinant

Abstract

When identical particles on a line collide, they merge and continue as one. Exact determinantal formulas have long been available for particles conditioned never to collide, but collisions change the number of particles, and exact distributions for the survivors have been obtained only in specific settings and by ad hoc methods. Building on the coalescence determinant introduced in a companion paper, we study the wall-particle system: when every site is initially occupied, this is the joint system of survivors and the boundaries between their basins of attraction. Its finite-dimensional distributions are determinants of block matrices built from transition probabilities and their cumulative sums; a finite block matrix suffices even when the initial configuration is infinite. As applications, we recover the Rayleigh spacing density and the joint distribution of consecutive gaps - which are negatively correlated - by new methods, and give a new derivation of the determinantal formula for the joint CDF of finitely many coalescing particles starting from fixed positions. All formulas hold for arbitrary nearest-neighbor random walks and their Brownian scaling limits, with no specific transition kernels required.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Piotr Śniady. 2026-02-23. Coalescing random walks via the coalescence determinant. https://arxiv.org/abs/2602.20043

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