Bottom-up threshold propagation stabilizes on a rooted tree
ProvedDirKECC1549.Main.hitting_set_stabilizesdirected-graphsgraph-algorithms
Let have vertices, let be a root, and suppose a parent map fixes and every vertex reaches under repeated parent steps. Given arbitrary natural vertex weights and a threshold , define Algorithm 2's propagated values by starting with zero at every vertex and repeatedly replacing each value with the vertex weight plus its children's previous values, reset to zero if the sum exceeds . Then every value is unchanged between rounds and . This is a stabilization property of bottom-up propagation on a finite rooted tree, independent of any graph-edge or outdegree assumptions.
Preamble
import Definitions.Def_DirKECC1549_Main_HittingSet set_option autoImplicit false
Formal statement
namespace DirKECC1549.Main
theorem hitting_set_stabilizes {n : ℕ} (r : Fin n) (par : Fin n → Fin n)
(deg : Fin n → ℕ) (b : ℕ) (hroot : par r = r)
(hreach : ∀ v, ∃ j : ℕ, par^[j] v = r) (v : Fin n) :
alg2Rho r par deg b (n + 1) v = alg2Rho r par deg b n v := by sorry
end DirKECC1549.Main
Source
Derived auxiliary fact for Algorithm 2, Georgiadis, Kipouridis, Kosinas, Papadopoulos and Pergaminelis, STOC 2027 submission #1549, Section 3.2.1, pp. 13–14.