Related papers: Multi-colour competition with reinforcement
We study competition between two growth models with long-range correlations on the torus $\mathbb T_n^d$ of size $n$ in dimension $d$. We append the edge set of the torus $\mathbb T_n^d$ by including all non-nearest-neighbour edges, and…
For $k\geq 1$, a $k$-colouring $c$ of $G$ is a mapping from $V(G)$ to $\{1,2,\ldots,k\}$ such that $c(u)\neq c(v)$ for any two non-adjacent vertices $u$ and $v$. The $k$-Colouring problem is to decide if a graph $G$ has a $k$-colouring. For…
In this paper, we study three two competing species Lotka-Volterra competition models on finite connected graphs, with Dirichlet, Neumann or no boundary conditions. We get that when time goes to infinity, either one specie extincts while…
We say that a vertex or edge colouring of a graph is distinguishing if the only automorphism that preserves this colouring is the identity. A (proper) distinguishing colouring is irreducible if there is no possibility of merging two…
This paper concerns the long term behaviour of a growth model describing a random sequential allocation of particles on a finite cycle graph. The model can be regarded as a reinforced urn model with graph-based interactions. It is motivated…
A conjecture of Erd\H{o}s, Gy\'arf\'as, and Pyber says that in any edge-colouring of a complete graph with r colours, it is possible to cover all the vertices with r vertex-disjoint monochromatic cycles. So far, this conjecture has been…
In this article we consider the relationship between vertex coloring and the immersion order. Specifically, a conjecture proposed by Abu-Khzam and Langston in 2003, which says that the complete graph with $t$ vertices can be immersed in any…
We study a geometrically constrained coalescence model derived from spin systems. Given two probability distributions $\mathbb{P}_R$ and $\mathbb{P}_B$ on the positive reals with finite means, colour the real line alternately with red and…
Reaction-diffusion systems with a Lotka-Volterra-type reaction term, also known as competition-diffusion systems, have been used to investigate the dynamics of the competition among $m$ ecological species for a limited resource necessary to…
We give several results showing that different discrete structures typically gain certain spanning substructures (in particular, Hamilton cycles) after a modest random perturbation. First, we prove that adding linearly many random edges to…
The concurrence vectors are proposed by employing the fundamental representation of $A_n$ Lie algebra, which provides a clear criterion to evaluate the entanglement of bipartite system of arbitrary dimension for both pure and mixed states.…
Let $X$ be a two-sided subshift on a finite alphabet endowed with a mixing probability measure which is positive on all cylinders in $X$. We show that there exist arbitrarily small finite overlapping union of shifted cylinders which…
The competition number k(G) of a graph G is the smallest number k such that G together with k isolated vertices added is the competition graph of an acyclic digraph. A chordless cycle of length at least 4 of a graph is called a hole of the…
Cyclic, nonhierarchical interactions among biological species represent a general mechanism by which ecosystems are able to maintain high levels of biodiversity. However, species coexistence is often possible only in spatially extended…
We study systems of three interacting particles, in which drifts and variances are assigned by rank. These systems are "degenerate": the variances corresponding to one or two ranks can vanish, so the corresponding ranked motions become…
A central goal in ecology is to understand how biodiversity is maintained. Previous theoretical works have employed the rock-paper-scissors (RPS) game as a toy model, demonstrating that population mobility is crucial in determining the…
A \emph{uniform random intersection graph} $G(n,m,k)$ is a random graph constructed as follows. Label each of $n$ nodes by a randomly chosen set of $k$ distinct colours taken from some finite set of possible colours of size $m$. Nodes are…
A triangulation of a polygon is a subdivision of it into triangles, using diagonals between its vertices. Two different triangulations of a polygon can be related by a sequence of flips: a flip replaces a diagonal by the unique other…
A class of variational models describing ecological systems of k species competing for the same resources is investigated. The occurrence of coexistence in minimal energy solutions is discussed and positive results are proven for suitably…
This work contributes to a foundational question in economic theory: how do individual-level cognitive biases interact with collective choice mechanisms? We study a setting where voters hold intrinsic preference rankings over a set of…