5 citations · 15 across the 31 of their papers we have counts for
4 papers · 1 filter
The Localization Game on Directed Graphs
Anthony Bonato, Ryan Cushman, Trent G. Marbach +1
In the Localization game played on graphs, a set of cops uses distance probes to identify the location of an invisible robber. We present an extension of the game and its main para…
Winner does not take all: contrasting centrality in adversarial networks
Anthony Bonato, Joey Kapusin, Jiajie Yuan
In adversarial networks, edges correspond to negative interactions such as competition or dominance. We introduce a new type of node called a low-key leader in adversarial networks…
Iterative models for complex networks formed by extending cliques
Anthony Bonato, Ryan Cushman, Trent G. Marbach +1
We consider a new model for complex networks whose underlying mechanism is extending dense subgraphs. In the frustum model, we iteratively extend cliques over discrete-time steps.…
On Meyniel extremal families of graphs
Anthony Bonato, Ryan Cushman, Trent G. Marbach
We provide new constructions of Meyniel extremal graphs, which are families of graphs with the conjectured largest asymptotic cop number. Using spanning subgraphs, we prove that th…