Tight Bounds on the Probabilistic Zero Forcing on Hypercubes and Grids
Combinatorics
2021-03-17 v2
Abstract
Zero forcing is a deterministic iterative graph colouring process in which vertices are coloured either blue or white, and in every round, any blue vertices that have a single white neighbour force these white vertices to become blue. Here we study probabilistic zero forcing, where blue vertices have a non-zero probability of forcing each white neighbour to become blue. We explore the propagation time for probabilistic zero forcing on hypercubes and grids.
Keywords
Cite
@article{arxiv.2012.00216,
title = {Tight Bounds on the Probabilistic Zero Forcing on Hypercubes and Grids},
author = {Natalie C. Behague and Trent Marbach and Pawel Pralat},
journal= {arXiv preprint arXiv:2012.00216},
year = {2021}
}
Comments
arXiv admin note: substantial text overlap with arXiv:1909.06568