32 citations · 117 across the 58 of their papers we have counts for
7 papers · 1 filter
Hypergraph burning, matchings, and zero forcing
Anthony Bonato, Caleb Jones, Trent G. Marbach +2
Lazy burning is a recently introduced variation of burning where only one set of vertices is chosen to burn in the first round. In hypergraphs, lazy burning spreads when all but on…
Enhancing Anti-Money Laundering Efforts with Network-Based Algorithms
Anthony Bonato, Juan Sebastian Chavez Palan, Adam Szava
The global banking system has faced increasing challenges in combating money laundering, necessitating advanced methods for detecting suspicious transactions. Anti-money laundering…
How to burn a Latin square
Anthony Bonato, Caleb Jones, Trent G. Marbach +1
We investigate the lazy burning process for Latin squares by studying their associated hypergraphs. In lazy burning, a set of vertices in a hypergraph is initially burned, and that…
The isoperimetric peak of complete trees
Anthony Bonato, Lazar Mandic, Trent G. Marbach +1
We give exact values and bounds on the isoperimetric peak of complete trees, improving on known results. For the complete -ary tree of depth , if , then we find that…
Locally finite graphs and their localization numbers
Anthony Bonato, Florian Lehner, Trent G. Marbach +1
We study the Localization game on locally finite graphs trees, where each of the countably many vertices have finite degree. In contrast to the finite case, we construct a locally…
Clique counts for network similarity
Anthony Bonato, Zhiyuan Zhang
Counts of small subgraphs, or graphlet counts, are widely applicable to measure graph similarity. Computing graphlet counts can be computationally expensive and may pose obstacles…
How to cool a graph
Anthony Bonato, Trent G. Marbach, Holden Milne +1
We introduce a new graph parameter called the cooling number, inspired by the spread of influence in networks and its predecessor, the burning number. The cooling number measures t…