Related papers: Random recursive trees and the Bolthausen-Sznitman…
Kingman derived the Ewens sampling formula for random partitions describing the genetic variation in a neutral mutation model defined by a Poisson process of mutations along lines of descent governed by a simple coalescent process, and…
We consider a system of particles which perform branching Brownian motion with negative drift and are killed upon reaching zero, in the near-critical regime where the total population stays roughly constant with approximately N particles.…
We study Gibbs partitions that typically form a unique giant component. The remainder is shown to converge in total variation toward a Boltzmann-distributed limit structure. We demon- strate how this setting encompasses arbitrary weighted…
We study a Markovian model for the random fragmentation of an object. At each time, the state consists of a collection of blocks. Each block waits an exponential amount of time with parameter given by its size to some power $\alpha$,…
Let $\mathbb{T}^d_N$, $d\ge 2$, be the discrete $d$-dimensional torus with $N^d$ points. Place a particle at each site of $\mathbb{T}^d_N$ and let them evolve as independent, nearest-neighbor, symmetric, continuous-time random walks. Each…
Coalescent theory is the study of random processes where particles may join each other to form clusters as time evolves. These notes provide an introduction to some aspects of the mathematics of coalescent processes and their applications…
In [L. Liu and S. Jin, Multiscale Model. Simult., 16, 1085-1114, 2018], spectral convergence and long-time decay of the numerical solution towards the global equilibrium of the stochastic Galerkin approximation for the Boltzmann equation…
We consider Brownian motions with one-sided collisions, meaning that each particle is reflected at its right neighbour. For a finite number of particles a Sch\"{u}tz-type formula is derived for the transition probability. We investigate an…
We consider the number of blocks involved in the last merger of a $\Lambda$-coalescent started with $n$ blocks. We give conditions under which, as $n \to \infty$, the sequence of these random variables a) is tight, b) converges in…
One class of random walks with infinite memory, so called elephant random walks, are simple models describing anomalous diffusion. We present a surprising connection between these models and bond percolation on random recursive trees. We…
We prove rigorously several results about the site-percolation on random recursive trees, observed in the previous work by Kalay and Ben-Naim [J. Phys. A48(2015), no.4, 0405001, 15 pp.]. For a random recursive tree of size $n$, let every…
In the critical beta-splitting model of a random $n$-leaf rooted tree, clades are recursively split into sub-clades, and a clade of $m$ leaves is split into sub-clades containing $i$ and $m-i$ leaves with probabilities $\propto 1/(i(m-i))$.…
We consider linear preferential attachment trees which are specific scale-free trees also known as (random) plane-oriented recursive trees. Starting with a linear preferential attachment tree of size $n$ we show that repeatedly applying a…
Consider a random real tree whose leaf set, or boundary, is endowed with a finite mass measure. Each element of the tree is further given a type, or allele, inherited from the most recent atom of a random point measure…
We consider maps which are constructed from plane trees by assigning marks to the corners of each vertex and then connecting each pair of consecutive marks on their contour by a single edge. A measure is defined on the set of such maps by…
The goal of these lectures is to survey some of the recent progress on the description of large-scale structure of random trees. We use the framework of Markov-Branching sequences of trees and discuss several applications.
We study the dynamics of a point particle in a periodic array of spherical scatterers, and construct a stochastic process that governs the time evolution for random initial data in the limit of low scatterer density (Boltzmann-Grad limit).…
The tail chain of a Markov chain can be used to model the dependence between extreme observations. For a positive recurrent Markov chain, the tail chain aids in describing the limit of a sequence of point processes $\{N_n,n\geq1\}$,…
We consider a stochastic model describing a constant size $N$ population that may be seen as a directed polymer in random medium with $N$ sites in the transverse direction. The population dynamics is governed by a noisy traveling wave…
We construct a coupling between two seemingly very different constructions of the standard additive coalescent, which describes the evolution of masses merging pairwise at rates proportional to their sums. The first construction, due to…