SearcharxivSearch

arXiv · 2510.13572

Coalescence in Markov chains

Abstract

A Markov chain $X^i$ on a finite state space $S$ has transition matrix $P$ and initial state $i$. We may run the chains $(X^i: i\in S)$ in parallel, while insisting that any two such chains coalesce whenever they are simultaneously at the same state. There are $|S|$ trajectories which evolve separately, but not necessarily independently, prior to coalescence. What can be said about the number $k(\mu)$ of coalescence classes of the process, and what is the set $K(P)$ of such numbers $k(\mu)$, as the coupling $\mu$ of the chains ranges over couplings that are consistent with $P$? We continue earlier work of the authors ('Non-coupling from the past', $\textit{In and Out of Equilibrium 3}$, Springer, 2021) on these two fundamental questions, which have special importance for the 'coupling from the past' algorithm. We concentrate partly on a family of couplings termed block measures, which may be viewed as couplings of lumpable chains with coalescing lumps. Constructions of such couplings are presented, and also of non-block measure with similar properties.

Explore related subjects

Keep this discovery

BibTeXRIS

Geoffrey R. Grimmett, Mark Holmes. 2025-10-15. Coalescence in Markov chains. https://arxiv.org/abs/2510.13572

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