Related papers: A two-time-scale phenomenon in a fragmentation-coa…
The asymptotic behaviour of a generalised P\'olya--Eggenberger urn is well--known to depend on the spectrum of its replacement matrix: If its dominant eigenvalue $r$ is simple and no other eigenvalue is `large' in the sense that its real…
It has been recently suggested that a totally asymmetric exclusion process with two species on an open chain could exhibit spontaneous symmetry breaking in some range of the parameters defining its dynamics. The symmetry breaking is…
We investigate a quadratic dynamical system known as nonlinear recombinations. This system models the evolution of a probability measure over the Boolean cube, converging to the stationary state obtained as the product of the initial…
Consider throwing $n$ balls at random into $m$ urns, each ball landing in urn $i$ with probability $p_i$. Let $S$ be the resulting number of singletons, i.e., urns containing just one ball. We give an error bound for the Kolmogorov distance…
We introduce a multi-colour multi-urn generalisation of the Bernoulli-Laplace urn model, consisting of $d$ urns, $m$ colours, and $dmn$ balls, with $dn$ balls of each colour and $mn$ balls in each urn. At each step, one ball is drawn…
We consider the two-opinion voter model on a regular random graph with n vertices and degree $d \geq 3$. It is known that consensus is reached on time scale n and that on this time scale the volume of the set of vertices with one opinion…
We study an urn process containing red and blue balls and two different strategies to reinforce the urn. Namely, a generalized P\'olya-type strategy versus an i.i.d. one. At each step, one of the two reinforcement strategies is chosen by…
We study the evolution of an initially random distribution of particles on a square lattice, under certain rules for `growing' and `culling' of particles. In one version we allow the particles to move laterally along the surface (mobile…
We study how the order of N independent random walks in one dimension evolves with time. Our focus is statistical properties of the inversion number m, defined as the number of pairs that are out of sort with respect to the initial…
P\'olya urns are urns where at each unit of time a ball is drawn and replaced with some other balls according to its colour. We introduce a more general model: the replacement rule depends on the colour of the drawn ball and the value of…
We analyse the mixing profile of a random walk on a dynamic random permutation, focusing on the regime where the walk evolves much faster than the permutation. Two types of dynamics generated by random transpositions are considered: one…
A P\'olya urn process is a Markov chain that models the evolution of an urn containing some coloured balls, the set of possible colours being $\{1,\ldots,d\}$ for $d\in \mathbb{N}$. At each time step, a random ball is chosen uniformly in…
We consider a discrete-time Markov chain, called fragmentation process, that describes a specific way of successively removing objects from a linear arrangement. The process arises in population genetics and describes the ancestry of the…
We study a model of random binary trees grown "by the leaves" in the style of Luczak and Winkler. If $\tau_n$ is a uniform plane binary tree of size $n$, Luczak and Winkler, and later explicitly Caraceni and Stauffer, constructed a measure…
The horizontal dynamics of a bouncing ball interacting with an irregular surface is investigated and is found to demonstrate behavior analogous to a random walk. Its stochastic character is substantiated by the calculation of a permutation…
We study a model of random weighted uniform spanning trees on the complete graph with $n$ vertices, where each edge is assigned a weight of $n^{1+\gamma}$ with probability $1/n$ and $1$ otherwise. Whenever $\gamma$ is large enough, we prove…
Distributed voting is a fundamental topic in distributed computing. In pull voting, in each step every vertex chooses a neighbour uniformly at random, and adopts its opinion. The voting is completed when all vertices hold the same opinion.…
Consider the following mechanism for the random evolution of a distribution of mass on the integer lattice ${\mathbf{Z}}$. At unit rate, independently for each site, the mass at the site is split into two parts by choosing a random…
Aqueous foams and a wide range of related systems are believed to coarsen by gas diffusion between neighboring domains into a statistically self-similar scaling state, after the decay of initial transients, such that dimensionless size and…
Limiting distributions are derived for the sparse connected components that are present when a random graph on $n$ vertices has approximately $\half n$ edges. In particular, we show that such a graph consists entirely of trees, unicyclic…