SearcharxivSearch

arXiv · 1812.04436

The eternal multiplicative coalescent encoding via excursions of L\'evy-type processes, with Supplement

Abstract

The multiplicative coalescent is a mean-field Markov process in which any pair of blocks coalesces at rate proportional to the product of their masses. In Aldous and Limic (1998) each extreme eternal version of the multiplicative coalescent was described in three different ways, one of which matched its (marginal) law to that of the ordered excursion lengths above past minima of a certain L\'evy-type process. Using a modification of the breadth-first-walk construction from Aldous (1997) and Aldous and Limic (1998), and some new insight from the thesis by Uribe (2007), this work settles an open problem (3) from Aldous (1997) in the more general context of Aldous and Limic (1998). Informally speaking, each eternal version is entirely encoded by its L\'evy-type process, and contrary to Aldous' original intuition, the time for the multiplicative coalescent does correspond to the linear increase in the constant part of the drift of the L\'e}y-type process. In the "standard multiplicative coalescent" context of Aldous (1997), this result was first announced by Armend\'ariz in 2001, while its first published proof is due to Broutin and Marckert (2016), who simultaneously account for the process of excess (or surplus) edge counts.

Explore related subjects

Keep this discovery

BibTeXRIS

Vlada Limic. 2018-12-04. The eternal multiplicative coalescent encoding via excursions of L\'evy-type processes, with Supplement. https://arxiv.org/abs/1812.04436

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