SearcharxivSearch

arXiv subjects

Timothy Killingback

Publications and source records attributed to Timothy Killingback.

2 recordsLinked to original sources

Competitively Coupled Maps and Spatial Pattern Formation

Spatial pattern formation is a key feature of many natural systems in physics, chemistry and biology. The essential theoretical issue in understanding pattern formation is to explain how a spatially homogeneous initial state can undergo spontaneous symmetry breaking leading to a stable spatial pattern. This problem is most commonly studied using partial differential equations to model a reaction-diffusion system of the type introduced by Turing. We report here on a much simpler and more robust model of spatial pattern formation, which is formulated as a novel type of coupled map lattice. In our model, the local site dynamics are coupled through a competitive, rather than diffusive, interaction. Depending only on the strength of the interaction, this competitive coupling results in spontaneous symmetry breaking of a homogeneous initial configuration and the formation of stable spatial patterns. This mechanism is very robust and produces stable pattern formation for a wide variety of spatial geometries, even when the local site dynamics is trivial.

nlin.PS

Effects of neighbourhood size and connectivity on spatial Continuous Prisoner's Dilemma

The Prisoner's Dilemma, a 2-person game in which the players can either cooperate or defect, is a common paradigm for studying the evolution of cooperation, when individuals exhibit variable degrees of cooperation. It is known that in the presence of spatial structure, when individuals ``play against'' their neighbours, and ``compare to'' them, cooperative investments can evolve to considerable levels. Here we examine the effect of increasing the neighbourhood size: we find that the mean-field limit of no cooperation is reached for a critical neighbourhood size of about five neighbours. We also find the related result that in a network of players, the critical average degree (number of neighbours) of nodes for which defection is the final state depends only on the network topology. This critical average degree is considerably higher for clustered networks, than for distributed random networks. This result strengthens the argument that clustering is the mechanism which makes the development and maintenance of the cooperation possible.

q-bio.PE