7 citations · 9 across the 10 of their papers we have counts for
13 papers
Reproducing the k-copwin Algorithm: Theory vs. Implementation
Meagan Mann, Christian Muise, Erin Meger
Cops and Robbers is a well-studied pursuit-evasion game that provides insights into graph theory and theoretical computing. A central question is determining the minimum number of…
Domain Design for the Cops and Robbers Problem
Connor Little, Meagan Mann, Erin Meger +1
Cops and Robbers is a well-studied problem in graph theory. The setting consists of a robber and one or more cops placed on an undirected graph. Taking turns moving throughout the…
Predicting The Cop Number Using Machine Learning
Meagan Mann, Christian Muise, Erin Meger
Cops and Robbers is a pursuit evasion game played on a graph, first introduced independently by Quilliot \cite{quilliot1978jeux} and Nowakowski and Winkler \cite{NOWAKOWSKI1983235}…
Cops and Robbers on Graphs with Path Constraints
Alexander Clow, Erin Meger
In 2019, Sivaraman conjectured that every -free graph has cop number at most . In the same year, Liu proved this conjecture for -free graphs. Recently…
Zero Forcing on Iterated Graph Models
Christopher Brice, Erin Meger, Nhat-Dinh Nguyen +2
Modeling how information travels throughout a network has vast applications across social sciences, cybersecurity, and graph-based neural networks. In this paper, we consider the z…
Improved bounds on the cop number when forbidding a minor
Franklin Kenter, Erin Meger, Jérémie Turcotte
Andreae (1986) proved that the cop number of connected -minor-free graphs is bounded for every graph . In particular, the cop number is at most if contains n…
The Iterative Independent Model
Erin Meger, Abigail Raz
Deterministic complex networks that use iterative generation algorithms have been found to more closely mirror properties found in real world networks than the traditional uniform…
Linear Bounds for Cycle-free Saturation Games
Sean English, Tomáš Masařík, Grace McCourt +3
Given a family of graphs , we define the -saturation game as follows. Two players alternate adding edges to an initially empty graph on vertices, with…
The Explorer-Director Game on Graphs
Pat Devlin, Erin Meger, Abigail Raz +1
The Explorer-Director game, first introduced by Nedev and Muthukrishnan, can be described as a game where two players -- Explorer and Director -- determine the movement of a token…
Eternal distance-k domination on graphs
Danielle Cox, Erin Meger, M. E. Messinger
Eternal domination is a dynamic process by which a graph is protected from an infinite sequence of vertex intrusions. In eternal distance- domination, guards initially occupy th…
Hybrid Power-Law Models of Network Traffic
Pat Devlin, Jeremy Kepner, Ashley Luo +1
The availability of large scale streaming network data has reinforced the ubiquity of power-law distributions in observations and enabled precision measurements of the distribution…
Iterated Global Models for Complex Networks
Anthony Bonato, Erin Meger
We introduce the Iterated Global model as a deterministic graph process that simulates several properties of complex networks. In this model, for every set of nodes of a prescr…
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…