Approximate Graph Propagation (AGP)

Updated 10 July 2026

Approximate Graph Propagation (AGP) is a unified framework for computing graph diffusion queries using a randomized push-and-sample method that guarantees relative-error bounds.
AGP unifies various propagation techniques—from PageRank to GNN feature propagation—by parametrizing a truncated power series and efficiently handling both static and dynamic graph data.
Its design leverages degree-aware sampling and bucket-based partitioning to reduce computational cost and achieve significant speedups in practical graph mining and learning tasks.

Approximate Graph Propagation (AGP) is a unified randomized framework for efficiently computing a broad class of graph propagation and node-proximity queries of the form

$\pi \;=\;\sum_{i=0}^\infty w_i\,(D^{-a}\,A\,D^{-b})^i\,x,$

where $A$ is the adjacency matrix, $D$ is the degree matrix, $a,b\in[0,1]$ with $a+b\ge 1$ , $\{w_i\}_{i=0}^\infty$ is a nonnegative weight sequence, and $x$ is a nonnegative seed vector with $\|x\|_1=1$ . Introduced as a single algorithmic framework covering node-proximity computation and GNN feature propagation, AGP was later revisited to support dynamic parameterized queries and dynamic graph updates while preserving approximation guarantees (Wang et al., 2021, Zhao et al., 12 Sep 2025).

1. Origin, scope, and problem class

AGP was proposed to unify what earlier work had treated on a case-by-case basis: transition probabilities, Personalized PageRank, heat kernel PageRank, Katz, and the feature-propagation steps used in decoupled GNN architectures such as SGC, GDC, and APPNP (Wang et al., 2021). The motivating observation is that many graph-mining and graph-learning tasks require repeated evaluation of the same algebraic template, yet prior methods either built bespoke algorithms for particular kernels or relied on expensive full-graph power iterations.

The framework treats graph propagation as a weighted sum of powers of the normalized operator $D^{-a}AD^{-b}$ . In the 2025 revisit, this formulation is presented as a formal query model with on-the-fly parameters $a,b,\{w_i\},x$ , together with an $A$ 0-time oracle $A$ 1 that returns $A$ 2 and the tail index $A$ 3 (Zhao et al., 12 Sep 2025). This generality is explicitly stated to capture PageRank, feature propagation in Graph Neural Networks (GNNs), and graph-based Retrieval-Augmented Generation (RAG).

A central object in the framework is the $A$ 4-approximation notion: $A$ 5 is a $A$ 6-approximation to $A$ 7 if, for every vertex $A$ 8 with $A$ 9, one has

$D$ 0

This places AGP in the class of relative-error algorithms for significant entries rather than uniform absolute-error approximators (Zhao et al., 12 Sep 2025).

2. Unified formulation and truncation principle

The original AGP formulation emphasizes that the same propagation equation recovers a range of classical kernels and GNN propagators by varying $D$ 1, $D$ 2, the weight sequence, and the seed vector (Wang et al., 2021). The 2025 treatment makes this explicit as a formal framework for parameterized queries. A truncation fact underlies both presentations: if $D$ 3 and $D$ 4, then the truncated sum

$D$ 5

already achieves a $D$ 6-approximation (Zhao et al., 12 Sep 2025).

This truncation principle is operationally important because it converts an infinite propagation into a bounded-depth computation. In the 2021 presentation, deterministic propagation computes levelwise residues $D$ 7 and reserves $D$ 8, with $D$ 9. Truncating at $a,b\in[0,1]$ 0 ensures tail control, after which the computational problem becomes the efficient estimation of the first $a,b\in[0,1]$ 1 levels (Wang et al., 2021).

The same formulation supports both query-centric and feature-centric regimes. When $a,b\in[0,1]$ 2 is a one-hot seed, AGP instantiates personalized or local propagation tasks; when $a,b\in[0,1]$ 3 is a feature column, it instantiates decoupled GNN propagation, including SGC, APPNP, and GDC (Wang et al., 2021). This suggests that AGP is best understood not as a single kernel but as an algorithmic interface to truncated diffusion families.

3. Core randomized algorithm: push-and-sample propagation

The original AGP algorithm replaces full sparse matrix-vector multiplication by a randomized push-and-sample scheme (Wang et al., 2021). At each level $a,b\in[0,1]$ 4, it maintains an approximate residue $a,b\in[0,1]$ 5 and approximate reserve $a,b\in[0,1]$ 6. For a node $a,b\in[0,1]$ 7 with $a,b\in[0,1]$ 8, AGP computes

$a,b\in[0,1]$ 9

then partitions neighbors into those whose propagated contribution exceeds a threshold $a+b\ge 1$ 0 and those whose contribution is below it. “Heavy” neighbors are updated exactly, while “light” neighbors are sampled with probability proportional to the normalized propagation mass divided by $a+b\ge 1$ 1. Accepted samples receive a fixed mass $a+b\ge 1$ 2 (Wang et al., 2021).

The implementation relies on degree-aware adjacency organization. In the 2021 version, adjacency lists are sorted by neighbor degree so that suitable neighbors can be skipped in $a+b\ge 1$ 3 per heavy block, and the remaining neighbors are grouped into $a+b\ge 1$ 4 degree bands for binomial sampling (Wang et al., 2021). In the 2025 revisit, AGP-Static is described more explicitly through bucket partitions

$a+b\ge 1$ 5

and a two-regime propagation rule: small-degree neighbors are fully scanned, while large-degree neighbors are sampled via a bucket-based binomial procedure, each sampled vertex receiving a fixed mass $a+b\ge 1$ 6 in the original AGP-Static analysis (Zhao et al., 12 Sep 2025).

The 2025 paper identifies two limitations in that state-of-the-art static solution. First, the claimed query complexity assumed an optimal subset-sampling algorithm that “did not exist” at the time, so an extra $a+b\ge 1$ 7 factor appears in practice. Second, AGP-Static processes graph updates poorly, taking $a+b\ge 1$ 8 time per update in the original discussion and $a+b\ge 1$ 9 if naively maintained in the narrative comparison (Zhao et al., 12 Sep 2025). The proposed AGP-Static++ replaces the two-stage binomial-plus-rejection mechanism with repeated draws from a bounded Geometric $\{w_i\}_{i=0}^\infty$ 0, yielding $\{w_i\}_{i=0}^\infty$ 1 overall per neighborhood rather than per bucket, and it also removes the need for sorted scans (Zhao et al., 12 Sep 2025).

4. Approximation guarantees and complexity bounds

The theoretical guarantees of AGP are framed in terms of unbiasedness, variance, and relative error. For the 2021 algorithm, for all $\{w_i\}_{i=0}^\infty$ 2,

$\{w_i\}_{i=0}^\infty$ 3

and the variance bound

$\{w_i\}_{i=0}^\infty$ 4

implies, via Chebyshev’s inequality, that choosing $\{w_i\}_{i=0}^\infty$ 5 and $\{w_i\}_{i=0}^\infty$ 6 yields

$\{w_i\}_{i=0}^\infty$ 7

for every $\{w_i\}_{i=0}^\infty$ 8 with $\{w_i\}_{i=0}^\infty$ 9. In that sense, AGP is a $x$ 0-relative-error algorithm with success probability at least $x$ 1 (Wang et al., 2021).

The expected running time of the original method is

$x$ 2

with the summary statement that, in most measures, $x$ 3, giving $x$ 4 up to logarithmic factors (Wang et al., 2021).

The 2025 refinement improves both the parameter choice and the query-time dependence on $x$ 5. AGP-Static++ sets

$x$ 6

and a variance analysis summarized through Lemmas 4–7 yields

$x$ 7

The resulting expected query time is

$x$ 8

where $x$ 9 for AGP-Static and $\|x\|_1=1$ 0 for AGP-Static++, and

$\|x\|_1=1$ 1

to read $\|x\|_1=1$ 2, or $\|x\|_1=1$ 3 when $\|x\|_1=1$ 4 admits a compact representation (Zhao et al., 12 Sep 2025). Substituting $\|x\|_1=1$ 5 and $\|x\|_1=1$ 6 gives

$\|x\|_1=1$ 7

The fully dynamic extension, AGP-Dynamic, preserves the AGP-Static++ query complexity and approximation errors while achieving $\|x\|_1=1$ 8 amortized time per edge insertion or deletion (Zhao et al., 12 Sep 2025). It does so through lazy degree updates and reference degrees $\|x\|_1=1$ 9, maintaining the invariant

$D^{-a}AD^{-b}$ 0

so that stale sampling upper bounds remain within a constant factor of the true probabilities.

5. Instantiations across proximity queries and GNN propagation

AGP specializes to a range of graph kernels and propagation rules by choosing parameters in the unified equation (Wang et al., 2021).

Task	Parameters	Seed/input
L-step transition	$D^{-a}AD^{-b}$ 1 if $D^{-a}AD^{-b}$ 2 else $D^{-a}AD^{-b}$ 3	$D^{-a}AD^{-b}$ 4
PageRank / PPR	$D^{-a}AD^{-b}$ 5	$D^{-a}AD^{-b}$ 6 or uniform teleport
Heat-kernel PR	$D^{-a}AD^{-b}$ 7	$D^{-a}AD^{-b}$ 8
Katz	$D^{-a}AD^{-b}$ 9	$a,b,\{w_i\},x$ 0
SGC	$a,b,\{w_i\},x$ 1	feature column
APPNP	$a,b,\{w_i\},x$ 2	feature column
GDC	$a,b,\{w_i\},x$ 3	feature column

The original paper emphasizes two concrete application domains. In local clustering via heat-kernel PageRank, AGP was evaluated on YouTube, Orkut, Friendster, and Twitter, using MaxError and sweep-cut conductance as metrics. The reported result is that AGP attains the lowest MaxError at all running points and finds clusters of strictly lower conductance/time trade-off, with $a,b,\{w_i\},x$ 4– $a,b,\{w_i\},x$ 5 speedups at $a,b,\{w_i\},x$ 6 (Wang et al., 2021).

In node classification with GNNs, AGP was used as the feature-propagation engine for SGC, APPNP, and GDC on Reddit, Yelp, Amazon, and Papers100M. Across all four graphs, the AGP-based versions match exact-propagation accuracy within $a,b,\{w_i\},x$ 7– $a,b,\{w_i\},x$ 8 while cutting propagation time by $a,b,\{w_i\},x$ 9– $A$ 00, and on Papers100M the exact SGC/APPNP pipelines require “tens of thousands of seconds” whereas AGP finishes in “a few thousand seconds.” The memory overhead is reported as $A$ 01 extra memory, contrasted with $A$ 02 or $A$ 03 for PPRGo and GBP (Wang et al., 2021).

The 2025 revisit broadens the stated application range to dynamic graphs and dynamic parameterized queries, explicitly naming social networks, knowledge-graph RAG for LLMs, real-time recommender systems, and dynamic GNNs as scenarios where evolving graphs and on-the-fly choices of $A$ 04 matter (Zhao et al., 12 Sep 2025). This suggests an expansion of AGP from static precomputation toward online graph-serving settings.

6. Later developments, comparisons, and disambiguation

A significant later development is the distinction between AGP and newer acceleration methods based on Chebyshev approximation. The paper "Scaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach" introduces ChebyPower and ChebyPush for graph propagation, with ChebyPush reported as $A$ 05– $A$ 06 faster than state-of-the-art Push and randomized Push methods including AGP, PWPush, and PWPushSOR for SSPPR, and $A$ 07– $A$ 08 faster than AGP and TEA+ for HKPR under comparable error (Yang et al., 2024). That comparison places AGP as a strong prior baseline for local diffusion, but not as the final word on graph propagation computation.

The conceptual contrast is also precise. AGP is built around randomized push-and-sample propagation on a truncated power expansion, whereas the Chebyshev work replaces the Taylor basis $A$ 09 with the orthogonal Chebyshev basis $A$ 10, obtaining a $A$ 11 acceleration predicted by approximation theory and deriving both a global ChebyPower routine and a local ChebyPush routine with provable error guarantees (Yang et al., 2024). A plausible implication is that AGP and Chebyshev-based propagation occupy adjacent points in the design space: both target approximate graph diffusion, but they exploit different approximation bases and locality mechanisms.

The term “AGP” also appears in unrelated literatures. In probabilistic graphical models, "Join-Graph Propagation Algorithms" uses AGP to denote a family of parameterized message-passing algorithms, including Mini-Clustering and Iterative Join-Graph Propagation, for approximate inference in graphical models (Mateescu et al., 2014). In systems work, GraphGuess is described as an “Approximate Graph Propagation (AGP)” framework with adaptive correction for iterative graph algorithms such as PageRank, SSSP, BP, and WCC (Ramezani et al., 2021). Distance-estimation work based on seed propagation, such as PROPAGATE, also uses propagation-oriented approximation language but addresses distance-based metrics rather than the weighted diffusion framework of AGP proper (Amati et al., 2023). These usages are terminological collisions rather than extensions of the 2021 Approximate Graph Propagation framework.

Within graph learning, propagation itself is also studied outside AGP. For example, propagation-embracing MLP distillation explicitly models a propagation operator $A$ 12, often instantiated by PPR, to transfer structural information from a teacher GNN to a student MLP (Shin et al., 2023). This is related at the level of propagation semantics, but it is not an AGP algorithm in the formal sense of the randomized $A$ 13-approximation framework.

7. Significance and open directions

The 2021 formulation characterizes AGP as the first single algorithm that handles popular proximity kernels and GNN propagation rules, gives a rigorous relative-error guarantee, and runs in time proportional to the nonzero output size up to logarithmic factors (Wang et al., 2021). The 2025 revisit retains that unifying role while tightening the static theory and extending the framework to dynamic settings, specifically by removing an $A$ 14 query overhead relative to the earlier practical implementation, eliminating one factor of $A$ 15 in the runtime dependence, and achieving $A$ 16 amortized update time in AGP-Dynamic (Zhao et al., 12 Sep 2025).

Empirically, the revised framework reports that AGP-Static++ is up to $A$ 17 faster than AGP-Static, AGP-Dynamic matches AGP-Static++ within $A$ 18 overhead, and AGP-Dynamic achieves update-time speedups of up to $A$ 19 over the $A$ 20 per-update maintenance of AGP-Static++ (Zhao et al., 12 Sep 2025). These are implementation-level consequences of tighter subset sampling, improved variance analysis, and lazy bucket maintenance rather than changes to the underlying propagation definition.

A common misconception is to identify AGP exclusively with Personalized PageRank or with a single local-push routine. The formalism and specialization table show that AGP is instead a parameterized framework for truncated graph diffusions, spanning PageRank-style kernels, heat kernels, Katz scores, transition probabilities, and decoupled GNN propagators (Wang et al., 2021). Another potential misunderstanding is to treat AGP as inherently static; the dynamic extensions demonstrate that the same approximation model can be maintained under edge insertions and deletions without changing its query guarantees (Zhao et al., 12 Sep 2025).

Taken together, the 2021 and 2025 papers define AGP as a general-purpose methodology for approximate graph diffusion under relative-error guarantees, with subsequent work clarifying both its strengths and its boundaries. Its role in the literature is therefore dual: it is both a practical algorithmic toolkit for node proximity and GNN propagation, and a baseline against which newer approximation schemes for graph propagation are now measured (Wang et al., 2021, Zhao et al., 12 Sep 2025, Yang et al., 2024).