2 citations · 2 across the 6 of their papers we have counts for
6 papers
Majority dynamics with one nonconformist
John Haslegrave, Chris Cannings
We consider a system in which a group of agents represented by the vertices of a graph synchronously update their opinion based on that of their neighbours. If each agent adopts a…
Geiringer Theorems: From Population Genetics to Computational Intelligence, Memory Evolutive Systems and Hebbian Learning
Boris Mitavskiy, Elio Tuci, Chris Cannings +2
The classical Geiringer theorem addresses the limiting frequency of occurrence of various alleles after repeated application of crossover. It has been adopted to the setting of evo…
Random walk attachment graphs
Chris Cannings, Jonathan Jordan
We consider the random walk attachment graph introduced by Saramäki and Kaski and proposed as a mechanism to explain how behaviour similar to preferential attachment may appear req…
Best Response Games on Regular Graphs
Richard Southwell, Chris Cannings
With the growth of the internet it is becoming increasingly important to understand how the behaviour of players is affected by the topology of the network interconnecting them. Ma…
A Version of Geiringer-like Theorem for Decision Making in the Environments with Randomness and Incomplete Information
Boris Mitavskiy, Jonathan Rowe, Chris Cannings
Purpose: In recent years Monte-Carlo sampling methods, such as Monte Carlo tree search, have achieved tremendous success in model free reinforcement learning. A combination of the…
On the structure of proten-protein interaction networks
Alun Thomas, Rob Cannings, Nicholas A. M. Monk +1
We present a simple model for the underlying structure of protein-protein pairwise interaction graphs that is based on the way in which proteins attach to each other in experiments…