Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Discovery effort of one recursive PageRank call

Proved
NearlyOptimalPPR.Computation.recursive_discovery_effort

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

algorithm-analysisgraph-theorypagerank

For every recorded recursive call and finite reachable prefix, its own exterior pushes satisfy

∑pushes produced by this call(dv+1)≤15N,\sum_{\text{pushes produced by this call}}(d_v+1)\le15N,pushes produced by this call∑​(dv​+1)≤15N,

where vvv is the vertex selected in a push and NNN is the call's scale. The finite undirected graph has a nonisolated seed, 0<α<10<\alpha<10<α<1, and root threshold 0<q≤10<q\le10<q≤1. The statement includes every completed update in the prefix, including one that crosses a budget.

This is a quantitative discovery-effort estimate underlying the O(N)O(N)O(N) discovery term in Lemma 4.4. The sum charges adjacency-row access and a constant amount of per-push bookkeeping, before logarithmic queue factors are applied.

Preamble
import Definitions.Def_NearlyOptimalPPR_Computation_work_analysis
import Definitions.Def_NearlyOptimalPPR_Computation_push
set_option autoImplicit false
open Finset Matrix NearlyOptimalPPR.Computation
open scoped ENNReal
Formal statement
theorem NearlyOptimalPPR.Computation.recursive_discovery_effort (m : SolveModel) (n : ℕ) (g : InputGraph n) (s : Fin n) (α q : ℝ)
    (hα : 0 < α ∧ α < 1) (hq : 0 < q ∧ q ≤ 1) (hs : 0 < g.graph.degree s)
    (ℓ : ℕ) (schedule : BlockSchedule) (T id : ℕ) (info : CallInformation)
    (hinfo : (recursiveRun m g s α q ℓ schedule T).information id=some info) :
    (∑ k ∈ Finset.range T, callDiscoveryEffort g (recursiveRun m g s α q ℓ schedule k) id) ≤ 15*info.scale := 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 discovery/control/solve work accounting pp.28–29; exact-SDDM convention Section 2 p.4; Algorithms 6–9.

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