Expected active root-connected counts satisfy nonlinear decay
ProvedRGMISFast.root_count_expectation_driftFor a finite graph and a fixed root under independent unit-rate exponential ranks, fix and . On , the finite expectation
is nonnegative and continuous, and differentiable in the interior, with
The formal statement identifies the lower integral with throughout the closed interval, making finiteness explicit.
This auxiliary result uses the unconditional version of the decay inequality in the proof of Lemma 5.2. The paper presents its argument after fixing a root rank above the time horizon. For the unconditional process, arrivals at the root only add losses to the count; the non-root arrival contribution gives the same upper bound for the derivative. Thus this formulation retains the paper's coefficient while incorporating root-rank averaging into the stochastic step. It does not assert the final integrated bound .
import Mathlib import Definitions.Def_RGMISFast_Y import Definitions.Def_RGMISFast_rankLaw set_option autoImplicit false open MeasureTheory ProbabilityTheory open scoped ENNReal open RGMISFast
theorem RGMISFast.root_count_expectation_drift {V : Type*} [Fintype V] [LinearOrder V]
(G : SimpleGraph V) [DecidableRel G.Adj] (u : V) (t : ℝ) (ht : 0 < t)
(k : ℕ) (hk : 1 ≤ k) :
∃ f f' : ℝ → ℝ,
(∀ s ∈ Set.Icc 0 t,
(∫⁻ r, (Y G u k s r : ℝ≥0∞) ∂(rankLaw V)) = ENNReal.ofReal (f s)) ∧
ContinuousOn f (Set.Icc 0 t) ∧
(∀ s ∈ Set.Icc 0 t, 0 ≤ f s) ∧
(∀ s ∈ Set.Ioo 0 t, HasDerivAt f (f' s) s) ∧
(∀ s ∈ Set.Ioo 0 t,
f' s ≤ -(k:ℝ) / Real.exp 1 * f s ^ (1+(k:ℝ)⁻¹)) := by sorry