Related papers: Coalescence on the real line
A neat question involving coin flips surfaced on $\Bbb X$, and generated an intensive `storm' of `social mathematics'. In a sequence of flips of a fair coin, Alice wins a point at each appearance of two consecutive heads, and Bob wins a…
A validated simulation model primarily requires performing an appropriate input analysis mainly by determining the behavior of real-world processes using probability distributions. In many practical cases, probability distributions of the…
Coalescing random walks is a fundamental stochastic process, where a set of particles perform independent discrete-time random walks on an undirected graph. Whenever two or more particles meet at a given node, they merge and continue as a…
When two liquid drops touch, a microscopic connecting liquid bridge forms and rapidly grows as the two drops merge into one. Whereas coalescence has been thoroughly studied when drops coalesce in vacuum or air, many important situations…
We study statistical properties of a one dimensional infinite system of coalescing particles. Each particle moves with constant velocity $\pm v$ towards its closest neighbor and merges with it upon collision. We propose a mean-field theory…
An edge-coloring of a graph $G$ with colors $1,...,t$ is an interval $t$-coloring if all colors are used, and the colors of edges incident to each vertex of $G$ are distinct and form an interval of integers. A graph $G$ is interval…
An infection spreads in a binary tree of height n as follows: initially, each leaf is either infected by one of k states or it is not infected at all. The infection state of each leaf is independently distributed according to a probability…
Begin continuous time random walks from every vertex of a graph and have particles coalesce when they collide. We use a duality relation with the voter model to prove the process is site recurrent on bounded degree graphs, and for…
We study the time evolution of continuous-time quantum walks on randomly changing graphs. At certain moments edges of the graph appear or disappear with a given probability. We focus on the case when the time interval between subsequent…
The Central Limit Theorem states that, in the limit of a large number of terms, an appropriately scaled sum of independent random variables yields another random variable whose probability distribution tends to a stable distribution. The…
An assignment of colours to the vertices of a graph is stable if any two vertices of the same colour have identically coloured neighbourhoods. The goal of colour refinement is to find a stable colouring that uses a minimum number of…
Given a dynamic graph subject to edge insertions and deletions, we show how to update an implicit representation of a proper vertex colouring, such that colours of vertices are computable upon query time. We give a deterministic algorithm…
The coalescence of viscous drops on a substrate is studied experimentally and theoretically. We consider cases where the drops can have different contact angles, leading to a very asymmetric coalescence process. Side view experiments reveal…
The rapid collapse of a polymer, due to external forces or changes in solvent, yields a long-lived `crumpled globule.' The conjectured fractal structure shaped by hierarchical collapse dynamics has proved difficult to establish, even with…
The spectrum of cosmic-ray electrons depends sensitively on the history and spatial distribution of nearby sources. Given our limited observational handle on cosmic-ray sources, any model remains necessarily probabilistic. Previously,…
We study existence of random elements with partially specified distributions. The technique relies on the existence of a positive extension for linear functionals accompanied by additional conditions that ensure the regularity of the…
An \emph{interval $t$-coloring} of a multigraph $G$ is a proper edge coloring with colors $1,\dots,t$ such that the colors on the edges incident to every vertex of $G$ are colored by consecutive colors. A \emph{cyclic interval $t$-coloring}…
Consider an undirected graph G, representing a social network, where each node is blue or red, corresponding to positive or negative opinion on a topic. In the voter model, in discrete time rounds, each node picks a neighbour uniformly at…
Position $n$ points uniformly at random in the unit square $S$, and consider the Voronoi tessellation of $S$ corresponding to the set $\eta$ of points. Toss a fair coin for each cell in the tessellation to determine whether to colour the…
The problem we are considering is the following. A colorblind player is given a set $B = \{b_1,b_2,...,b_N\}$ of $N$ colored balls. He knows that each ball is colored either red or green, and that there are less green balls (this will be…