Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Finite-prefix episode count for recursive PageRank

Proved
NearlyOptimalPPR.Computation.recursive_episode_count

by Shuze Chen · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

algorithm-analysisgraph-theorypagerank

There is a positive absolute constant CCC such that every created recursive PageRank call satisfies, at every finite prefix,

episodes⁡≤C(2+log⁡(2/ε)+ℓ)4Nb.\operatorname{episodes}\le C\bigl(2+\log(2/\varepsilon)+\ell\bigr)^4\frac Nb.episodes≤C(2+log(2/ε)+ℓ)4bN​.

Here NNN and bbb are the call's scale and block size, the depth is ℓ\ellℓ, and 0<ε≤10<\varepsilon\le10<ε≤1. The finite undirected input graph has a nonisolated seed and 0<α≤1/20<\alpha\le1/20<α≤1/2. The same constant works over all graphs, primitive models, depths, schedules, and calls.

This is the episode-count component of Lemma 4.4. It counts actual episode entries in finite reachable prefixes and assumes no eventual termination.

Preamble
import Definitions.Def_NearlyOptimalPPR_Computation_work_analysis
import Definitions.Def_NearlyOptimalPPR_Computation_push
set_option autoImplicit false
open Finset Matrix NearlyOptimalPPR.Computation
Formal statement
theorem NearlyOptimalPPR.Computation.recursive_episode_count :
    ∃ C : ℝ, 0 < C ∧ ∀ (m : SolveModel) (n : ℕ) (g : InputGraph n) (s : Fin n)
      (α ε : ℝ) (ℓ : ℕ) (schedule : BlockSchedule),
      (0 < α ∧ α ≤ 1/2) → (0 < ε ∧ ε ≤ 1) → 0 < g.graph.degree s →
      ∀ (t id : ℕ) (info : CallInformation),
        (recursiveRun m g s α (rootThreshold ε ℓ) ℓ schedule t).information id=some info →
          ((recursiveRun m g s α (rootThreshold ε ℓ) ℓ schedule t).episodes id : ℝ) ≤
            overhead C 4 ε ℓ*info.scale/info.block := by sorry
Source
Li, Xu, Yang, Zhou, Nearly optimal Personalized PageRank computation, STOC 2027 submission #884, https://github.com/sigact-stoc/stoc2027/releases/download/papers-1/884.pdf, Lemma 4.4 p.18 and its finite-prefix episode-counting argument pp.28–29.

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