Edge-based Local Push for Personalized PageRank

Summary: Introduces EdgePush, an edge-granular LocalPush variant for SSPPR on weighted graphs that avoids propagating probability along negligible-weight edges. Per-edge termination thresholds provide up to O(n) theoretical savings on unbalanced graphs and substantial empirical speedups. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: h7797c4ebad9b6d5b
Venue: VLDB
Year: 2022
Pagerank: 6.2171816e-05
Overall Rank: 5,236 | 64.80%
DOI: 10.14778/3523210.3523216

Incoming Non-self Citations Over Time

Authors

1. Hanzhi Wang (Renmin University of China)
2. Zhewei Wei (Renmin University of China)
3. Junhao Gan (University of Melbourne)
4. Ye Yuan (Beijing Institute of Technology)
5. Xiaoyong Du (Renmin University of China)
6. Ji-Rong Wen (Renmin University of China)

BibTeX Citation

@article{wang_vldb22,
        title = {{Edge-based Local Push for Personalized PageRank}},
        author = {Wang, Hanzhi and Wei, Zhewei and Gan, Junhao and Yuan, Ye and Du, Xiaoyong and Wen, Ji-Rong},
        journal = {PVLDB},
        series = {{VLDB} '22},
        volume = {15},
        number = {7},
        pages = {1376--1389},
        doi = {10.14778/3523210.3523216},
        url = {https://doi.org/10.14778/3523210.3523216},
        year = {2022}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
3,017	Zebra: When Temporal Graph Neural Networks Meet Temporal Personalized PageRank	2023	VLDB	7.7471344e-05
9,558	Efficient and Accurate PageRank Approximation on Large Graphs	2024	SIGMOD	5.1571823e-05
10,742	Theoretically and Practically Efficient Resistance Distance Computation on Large Graphs	2026	VLDB	4.9793485e-05
11,517	Efficient Approximation of Kemeny’s Constant for Large Graphs	2024	SIGMOD	4.9793485e-05

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
2,183	Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push	2021	SIGMOD	8.8962182e-05
2,258	HubPPR: Effective Indexing for Approximate Personalized PageRank	2017	VLDB	8.7385422e-05
3,977	Massively Parallel Algorithms for Personalized PageRank	2021	VLDB	6.8850687e-05
4,101	TopPPR: Top-k Personalized PageRank Queries with Precision Guarantees on Large Graphs	2018	SIGMOD	6.8073016e-05
6,033	Efficient Estimation of Heat Kernel PageRank for Local Clustering	2019	SIGMOD	5.9093593e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	5,859	Efficient Algorithms for Finding Approximate Heavy Hitters in Personalized PageRanks	2018	SIGMOD
2	1,368	Computing Personalized PageRank Quickly by Exploiting Graph Structures	2014	VLDB
3	8,227	Estimating Single-Node PageRank in O~(min{d_t, sqrt(m)}) Time	2023	VLDB
4	9,220	One Index for All: Towards Efficient Personalized PageRank Computation for Every Damping Factor	2026	SIGMOD
5	3,977	Massively Parallel Algorithms for Personalized PageRank	2021	VLDB
6	6,403	Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach	2022	SIGMOD
7	2,258	HubPPR: Effective Indexing for Approximate Personalized PageRank	2017	VLDB
8	4,101	TopPPR: Top-k Personalized PageRank Queries with Precision Guarantees on Large Graphs	2018	SIGMOD
9	4,264	Personalized PageRank on Evolving Graphs with an Incremental Index-Update Scheme	2023	SIGMOD
10	2,183	Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push	2021	SIGMOD