1 citations · 1 across the 7 of their papers we have counts for
9 papers · 1 filter
A combinatorial model for lane merging
Viktoriya Bardenova, Erik Insko, Katie Johnson +1
A two lane road approaches a stoplight. The left lane merges into the right just past the intersection. Vehicles approach the intersection one at a time, with some drivers always c…
On broadcast domination of directed graphs
Pamela E. Harris, Peter Hollander, Erik Insko
A dominating set of a graph is a set of vertices that contains at least one endpoint of every edge on the graph. The domination number of is the order of a minimum dominati…
Markov models for the tipsy cop and robber game on graphs
Viktoriya Bardenova, Vincent Ciarcia, Erik Insko
In this paper we analyze and model three open problems posed by Harris, Insko, Prieto-Langarica, Stoisavljevic, and Sullivan in 2020 concerning the tipsy cop and robber game on gra…
Tipsy cop and drunken robber: a variant of the cop and robber game on graphs
Pamela Harris, Erik Insko, Alicia Prieto-Langarica +2
Motivated by a biological scenario illustrated in the YouTube video \url{ https://www.youtube.com/watch?v=Z_mXDvZQ6dU} where a neutrophil chases a bacteria cell moving in random di…
A formula for enumerating permutations with a fixed pinnacle set
Alexander Diaz-Lopez, Pamela E. Harris, Isabella Huang +2
In 2017 Davis, Nelson, Petersen, and Tenner pioneered the study of pinnacle sets of permutations and asked whether there exists a class of operations, which applied to a permutatio…
A Variant on the Feline Josephus Problem
Shaun Sullivan, Erik Insko
In the Feline Josephus problem, soldiers stand in a circle, each having `lives'. Going around the circle, a life is taken from every th soldier; soldiers with 0 lives rem…