Tight bounds for expected propagation time of probabilistic zero forcing

Mehdi Jelassi, Julien Portier, Rik Sarkar

We study the probabilistic zero forcing process, a probabilistic variant of the classical zero forcing process. We show that for every connected graph $G$ on $n$ vertices, there ex…