Searcharxiv⌕ Search

arXiv subjects

Ákos Urbán

Publications and source records attributed to Ákos Urbán.

2 recordsLinked to original sources

Exact determinant formulas for coalescing particle systems

When particles on a line collide, they may coalesce into one. Such systems arise in the voter model, where boundaries between opinion clusters perform coalescing random walks, and in reaction-diffusion theory, where diffusing particles merge on contact. Computing exact coalescence probabilities has been difficult because collisions reduce the particle count, while classical determinantal methods require a fixed number of particles throughout. We introduce ghost particles: when two particles collide, one survivor continues as usual and one invisible ghost is created alongside it, preserving the total count. This restores the square matrix structure needed for a determinantal formula. We prove that the probability of any specified coalescence pattern - which initial particles merge into which survivors - is given by a determinant whose entries are transition probabilities. Integrating out ghost positions yields a closed-form formula for the surviving particles alone: the coalescence determinant. The only assumptions are the Markov property and nearest-neighbor transitions, so the results apply wherever the classical non-colliding theory does: discrete lattice paths, birth-death chains, and continuous diffusions including Brownian motion.

math.PR↗

The Pólya Web

We introduce the Pólya Web, a system of coalescing random walks based on the classic Pólya urn model. This construction serves as an analogue to the web of coalescing random walks studied by Tóth and Werner (1998), replacing simple symmetric random walks with Pólya walks as primary constituents. First, we study the general web of up-right oriented coalescing random walks. We investigate its geometric properties and prove that certain indicator random variables satisfy negative association. Notably, the proof involves a non-trivial application of the van den Berg-Kesten-Reimer (BKR) inequality. Based on this property, we derive a strong law for the number of connected components generated by walks starting at the same time. Subsequently, we focus on the specific properties of the Pólya Web. It is well-known that the normalized coordinates of a single Pólya Walk converge almost surely to a beta-distributed random variable. We determine the joint distribution of these limiting variables in the coalescing framework. Using these joint densities, we provide exact calculations regarding the almost sure convergence of the number of components. Finally, by applying a local scaling to the Pólya Web at the edges, we introduce the Yule Web, a web of coalescing Yule processes. We demonstrate that the fundamental properties and results derived for the Pólya Web can be extended to this limiting case.

math.PR↗