1 citations · 8 across the 24 of their papers we have counts for
3 papers · 1 filter
Burning Steiner triple systems
Andrea C. Burgess, Peter H. Danziger, Caleb W. Jones +2
Graph burning is a round-based process which can be viewed as a discrete one-player game that models the spread of influence throughout a network. Extending this process to hypergr…
Cooling graph products
Anthony Bonato, MacKenzie Carr, Caleb Jones +2
The cooling number measures the speed at which a slow-moving influence or contagion spreads on a graph. In this paper, we investigate the cooling number of four classical graph pro…
The Iterated Local Model for tournaments
Anthony Bonato, MacKenzie Carr, Ketan Chaudhary +2
Transitivity is a central, generative principle in social and other complex networks, capturing the tendency for two nodes with a common neighbor to form a direct connection. We pr…