Related papers: Random recursive trees and the Bolthausen-Sznitman…
For a martingale $(X_n)$ converging almost surely to a random variable $X$, the sequence $(X_n - X)$ is called martingale tail sum. Recently, Neininger [Random Structures Algorithms, 46 (2015), 346-361] proved a central limit theorem for…
In this article it is shown that the Brownian motion on the continuum random tree is the scaling limit of the simple random walks on any family of discrete $n$-vertex ordered graph trees whose search-depth functions converge to the Brownian…
We discuss several connections between discrete and continuous random trees. In the discrete setting, we focus on Galton-Watson trees under various conditionings. In particular, we present a simple approach to Aldous' theorem giving the…
We study simple nonequilibrium distributions describing a classical gas of particles interacting via a pair potential ${\phi}(x/{\epsilon})$, in the Boltzmann-Grad scaling ${\epsilon} \rightarrow 0$. We establish bounds for truncated…
We introduce multi-type Markov Branching trees, which are simple random population tree models where individuals are characterized by their size and type and give rise to (size,type)-children in a Galton-Watson fashion, with the rule that…
Panagiotou and Stufler (arXiv:1502.07180v2) recently proved one important fact on their way to establish the scaling limits of random P\'{o}lya trees: a uniform random P\'{o}lya tree of size $n$ consists of a conditioned critical…
We study a population model of fixed size undergoing strong selection where individuals accumulate beneficial mutations, namely the Moran model with selection. In a specific setting with strong selection, Schweinsberg showed that the…
We find scaling limits for the sizes of the largest components at criticality for rank-1 inhomogeneous random graphs with power-law degrees with power-law exponent \tau. We investigate the case where $\tau\in(3,4)$, so that the degrees have…
A approach of finite size scaling theory for discontinous percolation with multiple giant clusters is developed in this paper. The percolation in generalized Bohman-Frieze-Wormald (BFW) model has already been proved to be discontinuous…
We extend the peeling exploration introduced in arxiv:1506.01590 to the setting of Boltzmann planar maps coupled to a rigid $O(n)$ loop model. Its law is related to a class of discrete Markov processes obtained by confining random walks to…
A finite graph embedded in the plane is called a series-parallel map if it can be obtained from a finite tree by repeatedly subdividing and doubling edges. We study the scaling limit of weighted random two-connected series-parallel maps…
We consider fragmentations of an R-tree $T$ driven by cuts arriving according to a Poisson process on $T \times [0, \infty)$, where the first co-ordinate specifies the location of the cut and the second the time at which it occurs. The…
Processes of coalescence and fragmentation are used to understand the time-evolution of the mass distribution of various systems and may result in a steady state or in stable deterministic or stochastic cycles. Motivated by applications in…
We show the variational convergence of an irreversible Markov jump process describing a finite stochastic particle system to the solution of a countable infinite system of deterministic time-inhomogeneous quadratic differential equations…
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…
Coagulation-fragmentation processes describe the stochastic association and dissociation of particles in clusters. Cluster dynamics with cluster-cluster interactions for a finite number of particles has recently attracted attention…
The Kingman coalescent is a fundamental process in population genetics modelling the ancestry of a sample of individuals backwards in time. In this paper, in a large-sample-size regime, we study asymptotic properties of the coalescent under…
We study the probability distribution, $P_N(T)$, of the coincidence time $T$, i.e. the total local time of all pairwise coincidences of $N$ independent Brownian walkers. We consider in details two geometries: Brownian motions all starting…
In a view for a simple model where natural selection at the individual level is confronted to selection effects at the group level, we consider some individual-based models of some large population subdivided into a large number of groups.…
We present a Markov-chain analysis of blockwise-stochastic algorithms for solving partially block-separable optimization problems. Our main contributions to the extensive literature on these methods are statements about the Markov operators…