Related papers: Coalescence on the real line

Colouring the vertices of a graph $G$ according to certain conditions can be considered as a random experiment and a discrete random variable $X$ can be defined as the number of vertices having a particular colour in the proper colouring of…

In non-hermitian systems, the particular position at which two eigenstates coalesce under a variation of a parameter in the complex plane is called an exceptional point. A non-perturbative theory is proposed which describes the evolution of…

Visual illusions may be explained by the likelihood of patches in real-world images, as argued by input-driven paradigms in Neuro-Science. However, neither the data nor the tools existed in the past to extensively support these…

For spin systems, such as the $q$-colorings and independent-set models, approximating the partition function in the so-called non-uniqueness region, where the model exhibits long-range correlations, is typically computationally hard for…

We consider a random graph in which vertices can have one of two possible colours. Each vertex switches its colour at a rate that is proportional to the number of vertices of the other colour to which it is connected by an edge. Each edge…

Here I will present an introduction to the results that have been recently obtained in constraint optimization of random problems using statistical mechanics techniques. After presenting the general results, in order to simplify the…

We consider a stochastic model, called the replicator coalescent, describing a system of blocks of $k$ different types which undergo pairwise mergers at rates depending on the block types: with rate $C_{i,j}$ blocks of type $i$ and $j$…

We study survival among two competing types in two settings: a planar growth model related to two-neighbour bootstrap percolation, and a system of urns with graph-based interactions. In the planar growth model, uncoloured sites are given a…

We obtain new results for the probabilistic model introduced in Menshikov et al (2007) and Volkov (2006) which involves a $d$-ary regular tree. All vertices are coloured in one of $d$ distinct colours so that $d$ children of each vertex all…

We consider three-state cellular automata in two dimensions in which two colored states, blue and red, compete for control of the empty background, starting from low initial densities $p$ and $q$. When the dynamics of both colored types are…

Let $S$ be a set of four points chosen independently, uniformly at random from a square. Join every pair of points of $S$ with a straight line segment. Color these edges red if they have positive slope and blue, otherwise. We show that the…

Plant differently colored points in the plane, then let random points ("Poisson rain") fall, and give each new point the color of the nearest existing point. Previous investigation and simulations strongly suggest that the colored regions…

$\Lambda$-coalescents model the evolution of a coalescing system in which any number of blocks randomly sampled from the whole may merge into a larger block. For the coalescent restricted to initially $n$ singletons we study the collision…

For a fixed graph $H$, what is the smallest number of colours $C$ such that there is a proper edge-colouring of the complete graph $K_n$ with $C$ colours containing no two vertex-disjoint colour-isomorphic copies, or repeats, of $H$? We…

Considering a random binary tree with $n$ labelled leaves, we use a pruning procedure on this tree in order to construct a $\beta(3/2,1/2)$-coalescent process. We also use the continuous analogue of this construction, i.e. a pruning…

To understand how the human visual system analyzes images, it is essential to know the structure of the visual environment. In particular, natural images display consistent statistical properties that distinguish them from random luminance…

When it is polarised, a cell develops an asymmetric distribution of specific molecular markers, cytoskeleton and cell membrane shape. Polarisation can occur spontaneously or be triggered by external signals, like gradients of signalling…

We consider a three dimensional system consisting of a large number of small spherical particles, distributed in a range of sizes and heights (with uniform distribution in the horizontal direction). Particles move vertically at a…

Set-coloring a graph means giving each vertex a subset of a fixed color set so that no two adjacent subsets have the same cardinality. When the graph is complete one gets a new distribution problem with an interesting generating function.…

A colouring of a graph is "nonrepetitive" if for every path of even order, the sequence of colours on the first half of the path is different from the sequence of colours on the second half. We show that planar graphs have nonrepetitive…