Dynamics of nearest-neighbour competitions on graphs (Q1685488)

In this work is considered a discrete process random selection agent (i.e., vertices), at each step the selection is made from a pair of agents -- the vertices connected in the graph by the edge (2-agent model). The graph formulation can be considered as a generalization of the model introduced by \textit{E. Ben-Naim} et al. [``What is the most competitive sport'', J. Korean Phys. Soc. 50, 124--126 (2007]. Their model can be interpreted as a process on a special graph. It follows from the above that the referred work can be considered as a extension of the class of simulated objects. Possible applications for partial differential equations of hyperbolic type and to graph coloring problems are given. The main focus is located in a depth study of $d$-dimensional tori. A detailed study for the ring graph, which includes a chemical potential approximation to calculate all its statistics is presented. The two-dimensional torus, not studied in depth as the ring, is shown to possess critical behaviour in that the asymptotic speeds arrange themselves in two-coloured islands separated by borders of three other colours and the size of the islands obey power law distribution. It is also shown that in the large $d$ limit the $d$-dimensional torus shows inverse sine law for the distribution of asymptotic speeds. In the introduction, it is mentioned about possible applications to the modeling of social processes. However, in thise work these problems are not considered.