Related papers: A multiplicative coalescent with asynchronous mult…
In this article, we focus on Bienaym\'e-Galton-Watson processes with linear-fractional offspring distributions. At a fixed generation, we consider a sample of the individuals alive, drawn in two different ways: either through Bernoulli…
Polymers consisting of more than one type of monomer, known as copolymers, are vital to both living and synthetic systems. Copolymerisation has been studied theoretically in a number of contexts, often by considering a Markov process in…
Consider a population evolving as a discrete-time supercritical multi-type Galton--Watson process. Suppose we run the process for $T$ generations, then sample $k$ individuals uniformly at generation $T$ and trace their genealogy backwards…
Smoluchowski's coagulation equations can be used as elementary mathematical models for the formation of polymers. We review here some recent contributions on a variation of this model in which the number of aggregations for each atom is a…
Given $n>0$, let $S\subset [0,1]^2$ be a set of $n$ points, chosen uniformly at random. Let $R\cup B$ be a random partition, or coloring, of $S$ in which each point of $S$ is included in $R$ uniformly at random with probability $1/2$.…
We investigate the distribution of the coalescence time (most recent common ancestor) for two individuals picked at random (uniformly) in the current generation of a continuous time Bienaym\'e-Galton-Watson process founded $t$ units of time…
The notion of stability can be generalised to point processes by defining the scaling operation in a randomised way: scaling a configuration by $t$ corresponds to letting such a configuration evolve according to a Markov branching particle…
A simple explicit construction is provided of a partition-valued fragmentation process whose distribution on partitions of $[n]=\{1,...,n\}$ at time $\theta \ge 0$ is governed by the Ewens sampling formula with parameter $\theta$. These…
We describe a representation of the Bolthausen-Sznitman coalescent in terms of the cutting of random recursive trees. Using this representation, we prove results concerning the final collision of the coalescent restricted to [n]: we show…
We prove an upper bound for the $\varepsilon$-mixing time of the symmetric exclusion process on any graph G, with any feasible number of particles. Our estimate is proportional to $\mathsf{T}_{\mathsf{RW}(G)}\ln(|V|/\varepsilon)$, where |V|…
Every exchangeable Feller process taking values in a suitably nice combinatorial state space can be constructed by a system of iterated random Lipschitz functions. In discrete time, the construction proceeds by iterated application of…
Coalescents with multiple collisions (also called Lambda-coalescents or simple exchangeable coalescents) are used as models of genealogies. We study a new class of Markovian coalescent processes connected to a population model with…
We study a family of Markov processes on $\mathcal{P}^{(k)}$, the space of partitions of the natural numbers with at most $k$ blocks. The process can be constructed from a Poisson point process on…
Gaussian Belief Propagation (BP) algorithm is one of the most important distributed algorithms in signal processing and statistical learning involving Markov networks. It is well known that the algorithm correctly computes marginal density…
The Metric Coalescent (MC) is a measure-valued Markov Process generalizing the classical Kingman Coalescent. We show how the MC arises naturally from a discrete agent based model (Compulsive Gambler) of social dynamics and prove an…
Motivated by limits of critical inhomogeneous random graphs, we construct a family of sequences of measured metric spaces that we call continuous multiplicative graphs, that are expected to be the universal limit of graphs related to the…
We consider the behaviour of branching-selection particle systems in the large population limit. The dynamics of these systems is the combination of the following three components: (a) Motion: particles move on the real line according to a…
We establish sufficient conditions for exponential convergence to a unique quasi-stationary distribution in the total variation norm. These conditions also ensure the existence and exponential ergodicity of the Q-process, the process…
We consider fragmentation processes with values in the space of marked partitions of $\mathbb{N}$, i.e. partitions where each block is decorated with a nonnegative real number. Assuming that the marks on distinct blocks evolve as…
The notion of a successful coupling of Markov processes, based on the idea that both components of the coupled system ``intersect'' in finite time with probability one, is extended to cover situations when the coupling is unnecessarily…