2 citations · 6 across the 17 of their papers we have counts for
5 papers · 1 filter
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.…
The iterated local transitivity model for hypergraphs
Natalie C. Behague, Anthony Bonato, Melissa A. Huggan +2
Complex networks are pervasive in the real world, capturing dyadic interactions between pairs of vertices, and a large corpus has emerged on their mining and modeling. However, man…
The Game of Cops and Eternal Robbers
Anthony Bonato, Melissa Huggan, Trent Marbach +1
We introduce the game of Cops and Eternal Robbers played on graphs, where there are infinitely many robbers that appear sequentially over distinct plays of the game. A positive int…
Iterated Global Models for Complex Networks
Anthony Bonato, Erin Meger
We introduce the Iterated Global model as a deterministic graph process that simulates several properties of complex networks. In this model, for every set of nodes of a prescr…
A probabilistic version of the game of Zombies and Survivors on graphs
Anthony Bonato, Dieter Mitsche, Xavier Pérez-Giménez +1
We consider a new probabilistic graph searching game played on graphs, inspired by the familiar game of Cops and Robbers. In Zombies and Survivors, a set of zombies attempts to eat…