Tight Bounds on the Probabilistic Zero Forcing on Hypercubes and Grids
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:M3THJMTYrecord.jsonopen to challenge →
classification
math.CO
keywords
blueforcingverticeswhitezeroprobabilisticbecomegrids
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.