Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Number of budget-restart full solves in a PageRank call

Proved
NearlyOptimalPPR.Computation.recursive_restart_count

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

algorithm-analysisgraph-theorypagerank

Let τ(0)<⋯<τ(T)\tau(0)<\cdots<\tau(T)τ(0)<⋯<τ(T) be finite full-solve states of one recursive PageRank call. Let E⊆{0,…,T−1}E\subseteq\{0,\ldots,T-1\}E⊆{0,…,T−1} contain only transitions for which the next full solve was requested by a budget restart. If NNN and bbb are the call's scale and block size at the first snapshot, then

∣E∣≤2κ0Nb,κ0=ℓ+3.|E|\le\frac{2\kappa_0N}{b},\qquad \kappa_0=\ell+3.∣E∣≤b2κ0​N​,κ0​=ℓ+3.

The input graph is finite and undirected with a nonisolated seed, 0<α<10<\alpha<10<α<1, and positive root threshold. Each full solve is a reachable permitted event of that same call; no termination hypothesis is imposed.

This is the budget-restart count used in Lemma 4.4. It separates restarts from the other exceptions to residual-mass descent.

Preamble
import Definitions.Def_NearlyOptimalPPR_Computation_work_analysis
open Finset Matrix NearlyOptimalPPR.Computation
Formal statement
theorem NearlyOptimalPPR.Computation.recursive_restart_count (m : SolveModel) (n : ℕ) (g : InputGraph n) (s : Fin n) (α q : ℝ)
    (hα : 0 < α ∧ α < 1) (hq : 0 < q) (hs : 0 < g.graph.degree s)
    (ℓ : ℕ) (schedule : BlockSchedule) (τ : ℕ → ℕ) (hτ : StrictMono τ) (T id : ℕ)
    (hfull : ∀ i ≤ T, fullSolveEvent g (recursiveRun m g s α q ℓ schedule (τ i)) id)
    (E : Finset ℕ) (hE : E ⊆ Finset.range T)
    (hrestart : ∀ i ∈ E, currentPC (recursiveRun m g s α q ℓ schedule (τ (i+1)-2))=.restartDrain) :
    let st := recursiveRun m g s α q ℓ schedule (τ 0)
    (E.card : ℝ) ≤ 2*(kappa ℓ 0 : ℝ)*(st.frames st.top).N/(st.frames st.top).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, Lemmas 5.7–5.8 pp.26–28 and the finite-prefix event-counting proof of Lemma 4.4 pp.28–29; Lemma 4.4 statement p.18.

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