Randomized Zero Forcing

TL;DR

The expected propagation time of randomized zero forcing (RZF) is studied, establishing monotonicity properties with respect to enlarging the initial blue set and increasing weights on edges out of initially blue vertices, as well as invariances that relate weighted and unweighted dynamics.

Abstract

We introduce randomized zero forcing (RZF), a stochastic color-change process on directed graphs in which a white vertex turns blue with probability equal to the fraction of its incoming neighbors that are blue. Unlike probabilistic zero forcing, RZF is governed by in-neighborhood structure and can fail to propagate globally due to directionality. The model extends naturally to weighted directed graphs by replacing neighbor counts with incoming weight proportions. We study the expected propagation time of RZF, establishing monotonicity properties with respect to enlarging the initial blue set and increasing weights on edges out of initially blue vertices, as well as invariances that relate weighted and unweighted dynamics. Exact values and sharp asymptotics are obtained for several families of directed graphs, including arborescences, stars, paths, cycles, and spiders, and we derive tight extremal bounds for unweighted directed graphs in terms of basic parameters such as order, degree, and radius. We conclude with an application to an empirical input-output network, illustrating how expected propagation time under RZF yields a dynamic, process-based notion of centrality in directed weighted systems.

Figures (1)

• Figure 7.1: RZF expected propagation times on the BEA input-output sector network. Nodes correspond to economic sectors and are colored by the EPT from a singleton start; edge widths and opacities reflect relative inter-sectoral supply magnitudes.

Theorems & Definitions (98)

• Definition 1.1: Randomized zero forcing process
• Definition 1.2
• Theorem 2.1
• proof
• Lemma 2.1
• proof
• Corollary 2.2
• proof
• Lemma 2.3
• proof