Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sequence RBC = Σ_t δ_{•,t}(s_1)ρ_{s_1}·∏ δ_{s_i,t}(s_{i+1})ρ_{s_{i+1}} (Section 5.2, Algorithm 6)

Proved
RoutingBC.Chaining.sequence_rbc_eq_sum_chained_dependencies

by mikedeng1 · Oct 8, 2026 · Mathlib 0df444a (Lean v4.33.1)

betweenness-centralityp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1probabilityrouting

Let RRR be a loop-free, source-oblivious routing scheme on a finite node set VVV in which every node other than the target forwards with total probability one and the target forwards nothing. Let T:V×V→RT:V\times V\to\mathbb RT:V×V→R be a traffic matrix, ρ:V→[0,1]\rho:V\to[0,1]ρ:V→[0,1] sampling rates, and S=(s1,…,sk)S=(s_1,\dots,s_k)S=(s1​,…,sk​), k≥1k\ge1k≥1, a sequence of distinct nodes. Then the routing betweenness centrality of the sequence,

δ~∙,∙(Sρ)=∏r∈Sρr⋅∑s,t∈Vδ~s,t(S) T(s,t),\tilde\delta_{\bullet,\bullet}(S_\rho)=\prod_{r\in S}\rho_r\cdot\sum_{s,t\in V}\tilde\delta_{s,t}(S)\,T(s,t),δ~∙,∙​(Sρ​)=r∈S∏​ρr​⋅s,t∈V∑​δ~s,t​(S)T(s,t),

equals

∑t∈Vδ∙,t(s1) ρs1⋅∏i=1k−1δsi,t(si+1) ρsi+1,\sum_{t\in V}\delta_{\bullet,t}(s_1)\,\rho_{s_1}\cdot\prod_{i=1}^{k-1}\delta_{s_i,t}(s_{i+1})\,\rho_{s_{i+1}},t∈V∑​δ∙,t​(s1​)ρs1​​⋅i=1∏k−1​δsi​,t​(si+1​)ρsi+1​​,

where δ∙,t(v)=∑s∈Vδs,t(v) T(s,t)\delta_{\bullet,t}(v)=\sum_{s\in V}\delta_{s,t}(v)\,T(s,t)δ∙,t​(v)=∑s∈V​δs,t​(v)T(s,t) is the target dependency and δsi,t(si+1)\delta_{s_i,t}(s_{i+1})δsi​,t​(si+1​) the pairwise dependency.

The left side is the expected number of packets sampled by all monitors of SSS in order (Eq. (4)); the right side is the value returned by Algorithm 6, which needs only the precomputed target dependencies of s1s_1s1​ and pairwise dependencies between consecutive members of SSS. The sum on the left runs over all pairs (s,t)(s,t)(s,t), endpoints included.

Formalization Note. Algorithm 6 indexes the sequence from 000 (S={s0,…,sk}S=\{s_0,\dots,s_k\}S={s0​,…,sk​}); here it is (s1,…,sk)(s_1,\dots,s_k)(s1​,…,sk​) as in Lemma 1, and the product runs over the consecutive pairs of SSS. Distinctness of SSS is the paper's assumption for Eq. (4). The running time O(n⋅∣S∣)O(n\cdot|S|)O(n⋅∣S∣) is not formalized; only the identity is. No sign condition on TTT is assumed; the bounds 0≤ρv≤10\le\rho_v\le10≤ρv​≤1 are the page's.

Preamble
import Mathlib
import Definitions.Def_RoutingBC_Chaining_Routing
Formal statement
namespace RoutingBC.Chaining

theorem sequence_rbc_eq_sum_chained_dependencies {V : Type*} [Fintype V] [DecidableEq V]
    (R : V → V → V → V → ℝ) (hR : IsRoutingScheme R) (hobl : IsSourceOblivious R)
    (T : V → V → ℝ) (ρ : V → ℝ) (hρ : ∀ v, 0 ≤ ρ v ∧ ρ v ≤ 1)
    (s₁ : V) (rest : List V) (hS : (s₁ :: rest).Nodup) :
    seqRBC R T ρ (s₁ :: rest) =
      ∑ t, targetDelta R T t s₁ * ρ s₁ *
        (((s₁ :: rest).zip rest).map (fun ab => delta R ab.1 t ab.2 * ρ ab.2)).prod := by sorry

end RoutingBC.Chaining
Source
Dolev, Elovici, Puzis, Routing Betweenness Centrality, BGU CS Tech. Rep. #2009-09 (Aug. 2009), Section 5.2, Eqs. (11), (17) and the display after (17), pp. 13–15; Algorithm 6, p. 16; Eq. (4), p. 8
Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 8, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me