SearcharxivSearch

arXiv · math/0601032

Small-time behavior of beta coalescents

Abstract

For a finite measure $\varLambda$ on $[0,1]$, the $\varLambda$-coalescent is a coalescent process such that, whenever there are $b$ clusters, each $k$-tuple of clusters merges into one at rate $\int_0^1x^{k-2}(1-x)^{b-k}\varLambda(\mathrm{d}x)$. It has recently been shown that if $1<α<2$, the $\varLambda$-coalescent in which $\varLambda$ is the $\operatorname {Beta}(2-α,α)$ distribution can be used to describe the genealogy of a continuous-state branching process (CSBP) with an $α$-stable branching mechanism. Here we use facts about CSBPs to establish new results about the small-time asymptotics of beta coalescents. We prove an a.s. limit theorem for the number of blocks at small times, and we establish results about the sizes of the blocks. We also calculate the Hausdorff and packing dimensions of a metric space associated with the beta coalescents, and we find the sum of the lengths of the branches in the coalescent tree, both of which are determined by the behavior of coalescents at small times. We extend most of these results to other $\varLambda$-coalescents for which $\varLambda$ has the same asymptotic behavior near zero as the $\operatorname {Beta}(2-α,α)$ distribution. This work complements recent work of Bertoin and Le Gall, who also used CSBPs to study small-time properties of $\varLambda$-coalescents.

Explore related subjects

Keep this discovery

BibTeXRIS

Julien Berestycki, Nathanaël Berestycki, Jason Schweinsberg. 2008-05-26. Small-time behavior of beta coalescents. https://doi.org/10.1214/07-aihp103

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