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

zbMath1453.60131arXiv1906.11083MaRDI QIDQ3299342

Kevin Fong-Rey Liu, Emelie Curl, Michael S. Ross, Isaac Odegard, Yu Chan, Jesse T. Geneson, Leslie Hogben

Publication date: 22 July 2020

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

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)

Related Items (5)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast-mixed searching and related problems on graphs
• Propagation time for zero forcing on a graph
• Positive semidefinite propagation time
• The minimum rank of symmetric matrices described by a graph: a survey
• Zero forcing sets and the minimum rank of graphs
• Iteration Index of a Zero Forcing Set in a Graph
• Probabilistic Zero Forcing in Graphs

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