Using Markov chains to determine expected propagation time for probabilistic zero forcing

Yu Chan, Emelie Curl, Jesse Geneson +4

Zero forcing is a coloring game played on a graph where each vertex is initially colored blue or white and the goal is to color all the vertices blue by repeated use of a (determin…