Pith. sign in

REVIEW

Tight Bounds on the Probabilistic Zero Forcing on Hypercubes and Grids

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2012.00216 v2 pith:M3THJMTY submitted 2020-12-01 math.CO

Natalie C. Behague , Trent Marbach , Pawel Pralat This is my paper · ORCID
classification math.CO
keywords blueforcingverticeswhitezeroprobabilisticbecomegrids
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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.

Discussion (0). Continue with ORCID to comment.

Pith tools