Related papers: Steady state clusters and the Rath-Toth mean field…
We investigate the growth of clusters within the forest fire model of R\'{a}th and T\'{o}th [22]. The model is a continuous-time Markov process, similar to the dynamical Erd\H{o}s-R\'{e}nyi random graph but with the addition of so-called…
We give a unified treatment of the limit, as the size tends to infinity, of simply generated random trees, including both the well-known result in the standard case of critical Galton--Watson trees and similar but less well-known results in…
We discuss various forms of convergence of the vicinity of a uniformly at random selected vertex in random simply generated trees, as the size tends to infinity. For the standard case of a critical Galton-Watson tree conditioned to be large…
We study the distribution of ages in the mean field forest fire model introduced by R\'ath and T\'oth. This model is an evolving random graph whose dynamics combine Erd\H{o}s-R\'enyi edge-addition with a Poisson rain of lightning strikes.…
We survey recent developments about random real trees, whose prototype is the Continuum Random Tree (CRT) introduced by Aldous in 1991. We briefly explain the formalism of real trees, which yields a neat presentation of the theory and in…
We prove the well-posedness of a differential equation that describes the evolution of the large-system limit of the empirical age measure in the mean field forest fire model of R\'ath and T\'oth (arXiv:0808.2116). This forest fire model is…
We consider a random process on recursive trees, with three types of events. Vertices give birth at a constant rate (growth), each edge may be removed independently (fragmentation of the tree) and clusters (or trees) are frozen with a rate…
We consider a family of discrete coagulation-fragmentation equations closely related to the one-dimensional forest-fire model of statistical mechanics: each pair of particles with masses $i,j \in \nn$ merge together at rate 2 to produce a…
We consider the genealogical tree of a stationary continuous state branching process with immigration. For a sub-critical stable branching mechanism, we consider the genealogical tree of the extant population at some fixed time and prove…
We study a genealogical model for continuous-state branching processes with immigration with a (sub)critical branching mechanism. This model allows the immigrants to be on the same line of descent. The corresponding family tree is an…
We are interested in the local limits of families of random trees that satisfy the Markov branching property, which is fulfilled by a wide range of models. Loosely, this property entails that given the sizes of the sub-trees above the root,…
Take a continuous-time Galton-Watson tree. If the system survives until a large time $T$, then choose $k$ particles uniformly from those alive. What does the ancestral tree drawn out by these $k$ particles look like? Some special cases are…
We consider a super-critical Galton-Watson tree whose non-degenerate offspring distribution has finite mean. We consider the random trees $\tau$n distributed as $\tau$ conditioned on the n-th generation, Zn, to be of size an $\in$ N. We…
We study the long-time dynamics of a forest-fire model with deterministic tree growth and instantaneous burning of entire forests by stochastic lightning strikes. Asymptotically the system organizes into a coarsening self-similar mosaic of…
We introduce a general recursive method to construct continuum random trees (CRTs) from independent copies of a random string of beads, that is, any random interval equipped with a random discrete probability measure, and from related…
Distinguishing between continuous and first-order phase transitions is a major challenge in random discrete systems. We study the topic for events with recursive structure on Galton-Watson trees. For example, let $\mathcal{T}_1$ be the…
A continuous time mixed state branching process is constructed as the scaling limits of two-type Galton-Watson processes. The process can also be obtained by the pathwise unique solution to a stochastic equation system. From the stochastic…
Aldous, Evans and Pitman (1998) studied the behavior of the fragmentation process derived from deleting the edges of a uniform random tree on $n$ labelled vertices. In particular, they showed that, after proper rescaling, the above…
We study self-similarity in random binary rooted trees. In a well-understood case of Galton-Watson trees, a distribution on a space of trees is said to be self-similar if it is invariant with respect to the operation of pruning, which cuts…
We study the local convergence of critical Galton-Watson trees and Levy trees under various conditionings. Assuming a very general monotonicity property on the functional of random trees, we show that random trees conditioned to have large…