Related papers: Multi-colour competition with reinforcement

Triangles are abundant in real-world networks but rare in standard null models for sparse graphs. Existing explanations typically rely on explicit triadic closure mechanisms or geometry-based connection rules. We propose an alternative…

We study the outcomes of various positions of the game Snort. When played on graphs admitting an automorphism of order two that maps vertices outside of their closed neighbourhoods (called opposable graphs), the second player has a winning…

In a diverse population, where many species are present, competitors can fight for surviving at individual and collective levels. In particular, species, which would beat each other individually, may form a specific alliance that ensures…

Competitive systems can exhibit both hierarchical (transitive) and cyclic (intransitive) structures. Despite theoretical interest in cyclic competition, which offers richer dynamics, and occupies a larger subset of the space of possible…

An incidence in a graph $G$ is a pair $(v,e)$ where $v$ is a vertex of $G$ and $e$ is an edge of $G$ incident to $v$. Two incidences $(v,e)$ and $(u,f)$ are adjacent if at least one of the following holds: $(a)$ $v = u$, $(b)$ $e = f$, or…

We (re-)prove that in every 3-edge-coloured tournament in which no vertex is incident with all colours there is either a cyclic rainbow triangle or a vertex dominating every other vertex monochromatically.

Resolving a conjecture of Bollob\'{a}s and Erd\H{o}s, Gy\'{a}rf\'{a}s proved that every graph $G$ of chromatic number $k+1\geq 3$ contains cycles of $\lfloor\frac{k}{2}\rfloor$ distinct odd lengths. We strengthen this prominent result by…

We say that an edge colouring $c$ of a graph preserves an automorphism $\varphi$ if $\varphi$ maps each edge to an edge of the same colour. Otherwise, we say that $c$ breaks $\varphi$. We call an automorphism of a graph small if it moves…

We study a dynamical system motivated by our earlier work on the statistical physics of social balance on graphs that can be viewed as a generalization of annihilating walks along two directions: first, the interaction topology is a…

We investigate an algebraic problem related to the determination of the fundamental group of a class of spaces of configurations on surfaces. The configuration spaces are spaces of points grouped into colors. Whether two points are allowed…

It is known that the competitive exclusion principle holds for a large kind of models involving several species competing for a single resource in an homogeneous environment. Various works indicate that the coexistence is possible in an…

If all but two vertices of a triangulated sphere have degrees divisible by $k$, then the exceptional vertices are not adjacent. This theorem is proved for $k=2$ with the help of the coloring monodromy. For $k = 3, 4, 5$ colorings by the…

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…

We define and prove limit results for a class of dominant P\'olya sequences, which are randomly reinforced urn processes with color-specific random weights and unbounded number of possible colors. Under fairly mild assumptions on the…

We prove that a random graph $G(n,p)$, with $p$ above the Hamiltonicity threshold, is typically such that for any $r$-colouring of its edges there exists a Hamilton cycle with at least $(2/(r+ 1)-o(1))n$ edges of the same colour. This…

Nonequilibrium spatiotemporal patterns have been extensively studied. However, a single oscillator or cyclic loop of states is typically employed at each site in theories and simulations. Here, we investigate how competition among multiple…

We propose a variant model of P{\'o}lya urn process, where the dynamics consist of two competing elements namely, suppression of growth and enhancement of dormant character. Here the level of such features are controlled by an internal…

This work brings together ideas of mixing graph colourings, discrete homotopy, and precolouring extension. A particular focus is circular colourings. We prove that all the $(k,q)$-colourings of a graph $G$ can be obtained by successively…

Early investigation of P\'{o}lya urns considered drawing balls one at a time. In the last two decades, several authors considered multiple drawing in each step, but mostly for schemes on two colors. In this manuscript, we consider multiple…

We develop a theory on a topologically non-trivial manifold which leads to different vacuum backgrounds at the field level. The different colors of the same quark flavor live in different backgrounds generated by the action of the torsion…