Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Stored-vertex discovery credit for recursive PageRank

Proved
NearlyOptimalPPR.Computation.recursive_discovery_credit

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

algorithm-analysisgraph-theorypagerank

At every finite prefix of the recursive PageRank computation, the volume of stored vertices is bounded by the root's discovery potential:

vol⁡(stored)≤Φ0,Φ0=5q C0+vol⁡(H0).\operatorname{vol}(\mathrm{stored})\le\Phi_0,\qquad \Phi_0=\frac5q\,C_0+\operatorname{vol}(H_0).vol(stored)≤Φ0​,Φ0​=q5​C0​+vol(H0​).

Here q>0q>0q>0 is the root threshold, H0H_0H0​ its active region, and C0C_0C0​ its discovery credit, consisting of active-volume credit and the degree-weighted potential remaining outside the active region. The input graph is finite and undirected, the seed is nonisolated, and the teleportation parameter lies between zero and one.

This invariant pays for storing a newly discovered adjacency list. It supports the subsequent sparse-data and queue-cost bounds without assuming termination.

Preamble
import Definitions.Def_NearlyOptimalPPR_Computation_work_analysis
open NearlyOptimalPPR.Computation
Formal statement
theorem NearlyOptimalPPR.Computation.recursive_discovery_credit (m : SolveModel) (n : ℕ) (g : InputGraph n) (s : Fin n) (α q : ℝ)
    (hα : 0 < α ∧ α < 1) (hq : 0 < q) (hs : 0 < g.graph.degree s)
    (ℓ : ℕ) (schedule : BlockSchedule) (t : ℕ) :
    StoredCreditInvariant g (recursiveRun m g s α q ℓ schedule t) := 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-cost analysis in Section 5, pp.28–29; 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