32 citations · 117 across the 58 of their papers we have counts for
78 papers
Structural Change and Random Graph Models in Global Oil Trade Networks
Anthony Bonato, Vincent Luong, Kyne Santos
We studied structural change in global oil trade using a network approach. Using UN Comtrade data, we examined the temporal evolution of international trade networks, with an empha…
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…
Network analysis and link prediction in competitive women's basketball
Anthony Bonato, Morganna Hinds
Network structure and its role in prediction are examined in competitive basketball at the team and player levels. Adversarial game outcome networks from NCAA Division I women's ba…
Network Embedding Analysis for Anti-Money Laundering Detection
Anthony Bonato, Adam Szava
We employ network embedding to detect money laundering in financial transaction networks. Using real anonymized banking data, we model over one million accounts as a directed graph…
Between burning and cooling: liminal burning on graphs
Anthony Bonato, Trent G. Marbach, John Marcoux +1
Liminal burning generalizes both the burning and cooling processes in graphs. In -liminal burning, a Saboteur reveals -sets of vertices in each round, with the goal of extend…
Network Analysis of Global Banking Systems and Detection of Suspicious Transactions
Anthony Bonato, Juan Chavez Palan, Adam Szava
A novel network-based approach is introduced to analyze banking systems, focusing on two main themes: identifying influential nodes within global banking networks using Bank for In…
Analysis and predictability of centrality measures in competition networks
Anthony Bonato, Mariam Walaa
The Common Out-Neighbor (or CON) score quantifies shared influence through outgoing links in competitive contexts. A dynamic analysis of competition networks reveals the CON score…
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…
The -visibility Localization Game
Anthony Bonato, Trent G. Marbach, John Marcoux +1
We study a variant of the Localization game in which the cops have limited visibility, along with the corresponding optimization parameter, the -visibility localization number $…
The Iterated Local Transitivity Model for Tournaments
Anthony Bonato, Ketan Chaudhary
A key generative principle within social and other complex networks is transitivity, where friends of friends are more likely friends. We propose a new model for highly dense compl…
The one-visibility Localization game
Anthony Bonato, Trent G. Marbach, Michael Molnar +1
We introduce a variant of the Localization game in which the cops only have visibility one, along with the corresponding optimization parameter, the one-visibility localization num…
The Localization Game on Directed Graphs
Anthony Bonato, Ryan Cushman, Trent G. Marbach +1
In the Localization game played on graphs, a set of cops uses distance probes to identify the location of an invisible robber. We present an extension of the game and its main para…
Winner does not take all: contrasting centrality in adversarial networks
Anthony Bonato, Joey Kapusin, Jiajie Yuan
In adversarial networks, edges correspond to negative interactions such as competition or dominance. We introduce a new type of node called a low-key leader in adversarial networks…
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.…
On Meyniel extremal families of graphs
Anthony Bonato, Ryan Cushman, Trent G. Marbach
We provide new constructions of Meyniel extremal graphs, which are families of graphs with the conjectured largest asymptotic cop number. Using spanning subgraphs, we prove that th…
An improved bound on the burning number of graphs
Anthony Bonato, Shahin Kamali
The burning number conjecture states that the burning number of a connected graph is at most While the conjecture is unresolved, Land and Lu proved that t…
Improved pyrotechnics : Closer to the burning graph conjecture
Paul Bastide, Marthe Bonamy, Anthony Bonato +4
The Burning Number Conjecture claims that for every connected graph of order its burning number satisfies While the conjecture remains o…