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

zbMATH Open1453.60131arXiv1906.11083MaRDI QIDQ3299342FDOQ3299342

Jesse Geneson, Kevin F. R. Liu, Emelie Curl, Michael S. Ross, Leslie Hogben, Isaac Odegard, Yu Chan

Publication date: 22 July 2020

Abstract: 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 (deterministic) color change rule starting with as few blue vertices as possible. Probabilistic zero forcing yields a discrete dynamical system governed by a Markov chain. 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 studied. Given a Markov transition matrix for a probabilistic zero forcing process, we establish an exact formula for expected propagation time. We apply Markov chains to determine bounds on expected propagation time for various families of graphs.

Full work available at URL: https://arxiv.org/abs/1906.11083

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Markov chainexpected propagation timeprobabilistic zero forcing

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Positive matrices and their generalizations; cones of matrices (15B48) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Stochastic matrices (15B51) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Zero forcing sets and the minimum rank of graphs
• Iteration index of a zero forcing set in a graph
• Propagation time for zero forcing on a graph
• Positive semidefinite propagation time
• The minimum rank of symmetric matrices described by a graph: a survey
• Fast-mixed searching and related problems on graphs
• Throttling zero forcing propagation speed on graphs
• Probabilistic Zero Forcing in Graphs

Cited In (5)

• Propagation time for probabilistic zero forcing
• Probabilistic zero forcing on random graphs
• Zero forcing with random sets
• Tight bounds on probabilistic zero forcing on hypercubes and grids
• Bounds on expected propagation time of probabilistic zero forcing

This page was built for publication: Using Markov chains to determine expected propagation time for probabilistic zero forcing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3299342)