Related papers: Competition in growth and urns
We introduce a new model for contagion spread using a network of interacting finite memory two-color P\'{o}lya urns, which we refer to as the finite memory interacting P\'{o}lya contagion network. The urns interact in the sense that the…
We investigate a nonclassic urn model with triggers that increase the number of colors. The scheme has emerged as a model for web services that set up frequently asked questions (FAQ). We present a thorough asymptotic analysis of the FAQ…
Formation and competition of associations are studied in a six-species ecological model where each species has two predators and two prey. Each site of a square lattice is occupied by an individual belonging to one of the six species. The…
The evolution of two species with different fitness is investigated on degree-heterogeneous graphs. The population evolves either by one individual dying and being replaced by the offspring of a random neighbor (voter model (VM) dynamics)…
Consider an urn model whose replacement matrix is triangular, has all entries nonnegative and the row sums are all equal to one. We obtain the strong laws for the counts of balls corresponding to each color. The scalings for these laws…
In many growth processes particles are highly mobile in an active layer at the surface, but are relatively immobile once incorporated in the bulk. We study models in which atoms are allowed to interact, equilibrate, and order on the…
In growing populations, the fate of mutations depends on their competitive ability against the ancestor and their ability to colonize new territory. Here we present a theory that integrates both aspects of mutant fitness by coupling the…
This paper considers a two-color, single-draw urn model with two types of balls, denoted type $1$ and type $2$, with initial counts $Y^1_0\in N^+$ and $Y^2_0\in N^+$, respectively. At each discrete time step, a ball is drawn uniformly at…
We determine the limiting distribution of the logarithm of the number of satisfying assignments in the random $k$-uniform hypergraph 2-colouring problem in a certain density regime for all $k\ge 3$ . As a direct consequence we obtain that…
We study the evolution of cooperation in an interacting particle system with two types. The model we investigate is an extension of a two-type biased voter model. One type (called defector) has a (positive) bias $\alpha$ with respect to the…
We study the evolution of recombination using a microscopic model developed within the frame of the theory of quantitative traits. Two components of fitness are considered: a static one that describes adaptation to environmental factors not…
The Colouring problem asks whether the vertices of a graph can be coloured with at most $k$ colours for a given integer $k$ in such a way that no two adjacent vertices receive the same colour. A graph is $(H_1,H_2)$-free if it has no…
Many metastable systems can nucleate to multiple competing stable or intermediate metastable states. In this work, a Potts model, subject to external fields, is used to study the competitive nucleation of two phases attempting to grow on a…
In the Colored Bin Packing problem a sequence of items of sizes up to $1$ arrives to be packed into bins of unit capacity. Each item has one of $c\geq 2$ colors and an additional constraint is that we cannot pack two items of the same color…
List colouring is an influential and classic topic in graph theory. We initiate the study of a natural strengthening of this problem, where instead of one list-colouring, we seek many in parallel. Our explorations have uncovered a…
In some scenarios ("anti-coordination games"), individuals are better off choosing different actions than their neighbors while in other scenarios ("coordination games"), it is beneficial for individuals to choose the same strategy as their…
In the bond percolation model on a lattice, we colour vertices with $n_c$ colours independently at random according to Bernoulli distributions. A vertex can receive multiple colours and each of these colours is individually observable. The…
In $r$-neighbor bootstrap percolation on the vertex set of a graph $G$, a set $A$ of initially infected vertices spreads by infecting, at each time step, all uninfected vertices with at least $r$ previously infected neighbors. When the…
We propose general conditions for the emergence of Turing patterns in a domain that changes size through homogeneous growth/shrinkage based on the qualitative changes of a potential function. For this part of the work, we consider the most…
Source-sink systems are metapopulations of patches that can be of variable habitat quality. They can be seen as graphs, where vertices represent the patches, and the weighted oriented edges give the probability of dispersal from one patch…