32 citations · 117 across the 58 of their papers we have counts for
6 papers · 1 filter
The Iterated Local Directed Transitivity Model for Social Networks
Anthony Bonato, Daniel W. Cranston, Melissa Huggan +2
We introduce a new directed graph model for social networks, based on the transitivity of triads. In the Iterated Local Directed Transitivity (ILDT) model, new nodes are born over…
Improved Bounds for Burning Fence Graphs
Anthony Bonato, Sean English, Bill Kay +1
Graph burning studies how fast a contagion, modeled as a set of fires, spreads in a graph. The burning process takes place in synchronous, discrete rounds. In each round, a fire br…
Centrality in dynamic competition networks
Anthony Bonato, Nicole Eikmeier, David F. Gleich +1
Competition networks are formed via adversarial interactions between actors. The Dynamic Competition Hypothesis predicts that influential actors in competition networks should have…
The Iterated Local Model for Social Networks
Anthony Bonato, Huda Chuangpishit, Sean English +2
On-line social networks, such as in Facebook and Twitter, are often studied from the perspective of friendship ties between agents in the network. Adversarial ties, however, also p…
Optimizing the trade-off between number of cops and capture time in Cops and Robbers
Anthony Bonato, Jane Breen, Boris Brimkov +6
The cop throttling number of a graph for the game of Cops and Robbers is the minimum of , where is the number of cops and is the minimu…
A Sublinear Bound on the Cop Throttling Number of a Graph
Anthony Bonato, Sean English
We provide a sublinear bound on the cop throttling number of a connected graph. Related to the graph searching game Cops and Robbers, the cop throttling number, written $\mathrm{th…