Related papers: Random recursive trees and the Bolthausen-Sznitman…

We describe a new phenomenon in models of coalescence and fragmentation, that of gel-shatter cycles. These are dynamical, unforced, stochastic cycles in which slow, approximately deterministic coalescence up to and beyond gelation is…

In this paper, we consider the random plane forest uniformly drawn from all possible plane forests with a given degree sequence. Under suitable conditions on the degree sequences, we consider the limit of a sequence of such forests with the…

We define some new sequences of recursively constructed random combinatorial trees, and show that, after properly rescaling graph distance and equipping the trees with the uniform measure on vertices, each sequence converges almost surely…

Consider a linear Boltzmann equation posed on the Euclidian plane with a periodic system of circular holes and for particles moving at speed 1. Assuming that the holes are absorbing -- i.e. that particles falling in a hole remain trapped…

The goal of this paper is to study the lookdown model with selection in the case of a population containing two types of individuals, with a reproduction model which is dual to the $\Lambda$-coalescent. In particular we formulate the…

We consider a finite number of particles characterised by their positions and velocities. At random times a randomly chosen particle, the follower, adopts the velocity of another particle, the leader. The follower chooses its leader…

In a series of recent works it has been shown that a class of simple models of evolving populations under selection leads to genealogical trees whose statistics are given by the Bolthausen-Sznitman coalescent rather than by the well known…

We consider a family of random trees satisfying a Markov branching property. Roughly, this property says that the subtrees above some given height are independent with a law that depends only on their total size, the latter being either the…

Consider a system of coalescing random walks where each individual performs random walk over a finite graph G, or (more generally) evolves according to some reversible Markov chain generator Q. Let C be the first time at which all walkers…

We show that large critical multi-type Galton-Watson trees, when conditioned to be large, converge locally in distribution to an infinite tree which is analoguous to Kesten's infinite monotype Galton-Watson tree. This is proven when we…

We study a model of random $\mathcal{R}$-enriched trees that is based on weights on the $\mathcal{R}$-structures and allows for a unified treatment of a large family of random discrete structures. We establish distributional limits…

We study the number of collisions $X_n$ of an exchangeable coalescent with multiple collisions ($\Lambda$-coalescent) which starts with $n$ particles and is driven by rates determined by a finite characteristic measure $\nu({\rm…

We study the parking process on the random recursive tree. We first prove that although the random recursive tree has a non-degenerate Benjamini--Schramm limit, the phase transition for the parking process appears at density $0$. We then…

The dynamics of a point particle in a periodic array of spherical scatterers converges, in the limit of small scatterer size, to a random flight process, whose paths are piecewise linear curves generated by a Markov process with memory two.…

We give an example of a transient reversible Markov chain that almost surely has only a finite number of cutpoints. We explain how this is relevant to a conjecture of Diaconis and Freedman and a question of Kaimanovich. We also answer…

In this paper we provide a rigorous derivation of the inelastic linear Boltzmann equation, in the Boltzmann-Grad limit, from a dissipative, random, Lorentz gas in arbitrary dimensions d $\geq$ 2. Specifically, we consider a microscopic…

We study the masses of blocks of the $\Lambda$-coalescent with dust and some aspects of their large and small time behaviors. To do so, we start by associating the $\Lambda$-coalescent to a nested interval-partition constructed from the…

We study the scaling limit of random forest with prescribed degree sequence in the regime that the largest tree consists of all but a vanishing fraction of nodes. We give a description of the limit of the forest consisting of the small…

The block counting process with initial state $n$ counts the number of blocks of an exchangeable coalescent ($\Xi$-coalescent) restricted to a sample of size $n$. This work provides scaling limits for the block counting process of regular…

Study of random networks generally requires the nodes to be independently and uniformly distributed such as a Poisson point process. In this work, we venture beyond this standard paradigm and investigate a stochastic forest obtained from a…