Search arXivSearch

arXiv · 2503.01320

Stochastic flows and Poisson representations for the block masses of the $\Lambda$-coalescent with dust : moment asymptotics and large deviation estimates

Abstract

We develop a new methodology for the study of the $\Lambda$-coalescent with dust, based on the construction of a stochastic flow of inverses, introduced by Bertoin and Le Gall [Ann. inst. Henri Poincare (B) Probab. Stat. 41(3), 307-333 (2003)], in which the coalescent is naturally embedded as a nested interval-partition. This framework yields Poisson representations for the ordered block masses $(W_k(t))_{k \geq 1}$ as stochastic integrals with respect to the Poisson random measure governing the flow, enabling the use of stochastic calculus in a setting where it was not previously available. We believe this methodology to be of independent interest and applicable beyond the specific results of this paper. As a first application, we derive precise logarithmic asymptotics for the moments of $W_k(t)$ as $t \to \infty$, which reveal an interesting cutoff phenomenon related to the presence of dust. We then establish a law of large numbers and a large deviation principle for $\log(1-W_1(t))/t$ and a one-sided weak large deviation principle for $\log(W_k(t))/t$, for $k \geq 2$, with explicit rate functions.

Explore related subjects

Keep this discovery

BibTeXRIS

Grégoire Véchambre. 2025-03-03. Stochastic flows and Poisson representations for the block masses of the $\Lambda$-coalescent with dust : moment asymptotics and large deviation estimates. https://arxiv.org/abs/2503.01320

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