Tight bounds on probabilistic zero forcing on hypercubes and grids

DOI10.37236/10585OpenAlexW4210802632MaRDI QIDQ2073291

Natalie C. Behague, Paweł Prałat, Trent G. Marbach

Publication date: 1 February 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Random walks on graphs (05C81)

Related Items (2)

Power of \(k\) choices in the semi-random graph process ⋮ Zero forcing with random sets

Uses Software

• Julia

Cites Work

• Unnamed Item
• Propagation time for zero forcing on a graph
• Zero forcing parameters and minimum rank problems
• Bounds on expected propagation time of probabilistic zero forcing
• Complexity and computation of connected zero forcing
• Probabilistic zero forcing on random graphs
• Zero-forcing in random regular graphs
• Zero forcing sets and the minimum rank of graphs
• Power domination in graphs
• Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified
• Introduction to Random Graphs
• Julia: A Fresh Approach to Numerical Computing
• Using Markov chains to determine expected propagation time for probabilistic zero forcing
• The Zero Forcing Number of Graphs
• Probabilistic Zero Forcing in Graphs
• Bounds for the Zero Forcing Number of Graphs with Large Girth
• Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks

This page was built for publication: Tight bounds on probabilistic zero forcing on hypercubes and grids