3 citations · 6 across the 3 of their papers we have counts for
3 papers
cs.DM2017★ 3 cited
An anti-incursion algorithm for unknown probabilistic adversaries on connected graphs
Jesse Geneson
A gambler moves on the vertices of a graph using the probability distribution . A cop pursues the gambler on the graph, only being able to move…
cs.DM2016★ 3 cited
Distributed pursuit algorithms for probabilistic adversaries on connected graphs
Jesse Geneson
A gambler moves between the vertices of a graph using the probability distribution . Multiple cops pursue the gambler on the graph, only being…
math.CO2014
Linear bounds on matrix extremal functions using visibility hypergraphs
Jesse Geneson, Lilly Shen
The 0-1 matrix A contains a 0-1 matrix M if some submatrix of A can be transformed into M by changing some ones to zeroes. If A does not contain M, then A avoids M. Let ex(n,M) be…