32 citations · 117 across the 58 of their papers we have counts for
6 papers · 1 filter
Distinguishing number of Urysohn metric spaces
Anthony Bonato, Claude Laflamme, Micheal Pawliuk +1
The distinguishing number of a structure is the smallest size of a partition of its elements so that only the trivial automorphism of the structure preserves each cell of the parti…
Approximation Algorithms for Graph Burning
Anthony Bonato, Shahin Kamali
Numerous approaches study the vulnerability of networks against social contagion. Graph burning studies how fast a contagion, modeled as a set of fires, spreads in a graph. The bur…
Burning the plane: densities of the infinite Cartesian grid
Anthony Bonato, Karen Gunderson, Amy Shaw
Graph burning is a discrete-time process on graphs, where vertices are sequentially burned, and burned vertices cause their neighbours to burn over time. We consider extremal prope…
Bounds on the localization number
Anthony Bonato, William B. Kinnersley
We consider the localization game played on graphs, wherein a set of cops attempt to determine the exact location of an invisible robber by exploiting distance probes. The correspo…
Dynamic Competition Networks: detecting alliances and leaders
Anthony Bonato, Nicole Eikmeier, David F. Gleich +1
We consider social networks of competing agents that evolve dynamically over time. Such dynamic competition networks are directed, where a directed edge from nodes to corre…
Geometric random graphs and Rado sets of continuous functions
Anthony Bonato, Jeannette Janssen, Anthony Quas
We prove the existence of Rado sets in the Banach space of continuous functions on [0,1]. A countable dense set S is Rado if with probability 1, the infinite geometric random graph…