2 citations · 2 across the 1 of their papers we have counts for
6 papers
Game Connectivity and Adaptive Dynamics
Tom Johnston, Michael Savery, Alex Scott +1
We analyse the typical structure of games in terms of the connectivity properties of their best-response graphs. Our central result shows that, among games that are `generic' (with…
A note on inverting the dijoin of oriented graphs
Natalie Behague, Tom Johnston, Natasha Morrison +1
For an oriented graph and a set , the inversion of in is the graph obtained from by reversing the orientation of each edge that has both endpoints…
Short reachability networks
Carla Groenland, Tom Johnston, Jamie Radcliffe +1
We investigate the following generalisation of permutation networks. We say a sequence of transpositions in forms a -reachability network if, for ev…
Infinite induced-saturated graphs
Marthe Bonamy, Carla Groenland, Tom Johnston +2
A graph is -induced-saturated if is -free but deleting any edge or adding any edge creates an induced copy of . There are non-trivial graphs , such as , fo…
Shotgun assembly of random graphs
Tom Johnston, Gal Kronenberg, Alexander Roberts +1
In the graph shotgun assembly problem, we are given the balls of radius around each vertex of a graph and asked to reconstruct the graph. We study the shotgun assembly of the E…
Improved bounds for 1-independent percolation on
Paul Balister, Tom Johnston, Michael Savery +1
A 1-independent bond percolation model on a graph is a probability distribution on the spanning subgraphs of in which, for all vertex-disjoint sets of edges and …