Tight bounds on probabilistic zero forcing on hypercubes and grids (Q2073291)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7467796
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight bounds on probabilistic zero forcing on hypercubes and grids |
scientific article; zbMATH DE number 7467796 |
Statements
Tight bounds on probabilistic zero forcing on hypercubes and grids (English)
0 references
1 February 2022
0 references
Summary: 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.
0 references
0 references
0.9169595241546632
0 references
0.904035210609436
0 references
0.8782094120979309
0 references
0.8684383034706116
0 references
0.8466290831565857
0 references
