Publication Date
6-1-2022
Document Type
Article
Publication Title
Australasian Journal of Combinatorics
Volume
83
First Page
397
Last Page
417
Abstract
Zero forcing is a coloring process on a graph that was introduced more than fifteen years ago in several different applications. The goal is to color all the vertices blue by repeated use of a (deterministic) color change rule. Probabilistic zero forcing was introduced by Kang and Yi in [Bull. Inst. Combin. Appl. 67 (2013), 9–16] and yields a discrete dynamical system, which is a better model for some applications. Since in a connected graph any one vertex can eventually color the entire graph blue using probabilistic zero forcing, the expected time to do this is a natural parameter to study. We determine expected propagation time exactly for paths and cycles, establish the asymptotic value for stars, and present asymptotic upper and lower bounds for any graph in terms of its radius and order. We apply these results to obtain values and bounds on ℓ-round probabilistic zero forcing and confidence levels for propagation time.
Creative Commons License
This work is licensed under a Creative Commons Attribution-No Derivative Works 4.0 License.
Department
Mathematics and Statistics
Recommended Citation
Jesse Geneson and Leslie Hogben. "Expected propagation time for probabilistic zero forcing" Australasian Journal of Combinatorics (2022): 397-417.
