SearcharxivSearch

arXiv · 2201.06576

Asymptotic Gaussianity via coalescence probabilities in the Hammond-Sheffield urn

Abstract

For the renormalised sums of the random $\pm 1$-colouring of the connected components of $\mathbb Z$ generated by the coalescing renewal processes in the "power law P\'olya's urn" of Hammond and Sheffield we prove functional convergence towards fractional Brownian motion, closing a gap in the tightness argument of their paper. In addition, in the regime of the strong renewal theorem we gain insights into the coalescing renewal processes in the Hammond-Sheffield urn (such as the asymptotic depth of most recent common ancestors) and are able to control the coalescence probabilities of two, three and four individuals that are randomly sampled from $[n]$. This allows us to obtain a new, conceptual proof of the asymptotic Gaussianity (including the functional convergence) of the renormalised sums of more general colourings, which can be seen as an invariance principle beyond the main result of Hammond and Sheffield. In this proof, a key ingredient of independent interest is a sufficient criterion for the asymptotic Gaussianity of the renormalised sums in randomly coloured random partitions of $[n]$, based on Stein's method. Along the way we also prove a statement on the asymptotics of the coalescence probabilities in the long-range seedbank model of Blath, Gonz\'alez Casanova, Kurt, and Span\`o.

Explore related subjects

Keep this discovery

BibTeXRIS

Jan Lukas Igelbrink, Anton Wakolbinger. 2022-01-17. Asymptotic Gaussianity via coalescence probabilities in the Hammond-Sheffield urn. https://doi.org/10.30757/alea.v20-04

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