TITLE:
Markov Models for the Tipsy Cop and Robber Game on Graph
AUTHORS:
Viktoriya Bardenova, Vincent Ciarcia, Erik Insko
KEYWORDS:
Cops and Robbers, Graph Searching, Markov Chains
JOURNAL NAME:
Open Journal of Discrete Mathematics,
Vol.11 No.3,
July
12,
2021
ABSTRACT: 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 graphs. The three different scenarios we model account for different biological scenarios. The first scenario is when the cop and robber have a consistent tipsiness level through the duration of the game; the second is when the cop and robber sober up as a function of time; the third is when the cop and robber sober up as a function of the distance between them. Using Markov chains to model each scenario we calculate the probability of a game persisting through M rounds of the game and the expected game length given different starting positions and tipsiness levels for the cop and robber.