DBScholar

Back to papers

Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches

Summary: Two variance-reduction techniques for Personalized PageRank: power-iteration variance reduction and progressive sampling. Integrates these with random-walk and spanning-forest Monte Carlo PPR to achieve higher accuracy at equal or lower runtime than state-of-the-art bidirectional algorithms, leveraging historical sampling. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
6725
Venue
SIGMOD
Year
2023
Pagerank
5.4949527e-05
Overall Rank
8,062 | 44.69%
DOI
10.1145/3589305

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{liao_sigmod23,
        title = {{Efficient Personalized PageRank Computation: The Power of Variance-Reduced Monte Carlo Approaches}},
        author = {Liao, Meihao and Li, Rong-Hua and Dai, Qiangqiang and Chen, Hongyang and Qin, Hongchao and Wang, Guoren},
        series = {{SIGMOD} '23},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3589305},
        url = {https://dl.acm.org/doi/10.1145/3589305},
        year = {2023}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 16 of 16 cited papers.

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

Rank Cited Paper Year Venue Pagerank
1,339 Computing Personalized PageRank Quickly by Exploiting Graph Structures 2014 VLDB 0.00011112799
1,414 Fast and Exact Top-k Search for Random Walk with Restart 2012 VLDB 0.00010848387
1,769 BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs 2015 SIGMOD 9.7969398e-05
1,838 Efficient Ad-hoc Search for Personalized PageRank 2013 SIGMOD 9.6436348e-05
2,073 BePI: Fast and Memory-Efficient Method for Billion-Scale Random Walk with Restart 2017 SIGMOD 9.2209912e-05
2,173 Unifying the Global and Local Approaches: An Efficient Power Iteration with Forward Push 2021 SIGMOD 9.0375634e-05
2,225 HubPPR: Effective Indexing for Approximate Personalized PageRank 2017 VLDB 8.9183159e-05
2,362 Incremental and Accuracy-Aware Personalized PageRank through Scheduled Approximation 2013 VLDB 8.6889619e-05
3,315 Distributed Algorithms on Exact Personalized PageRank 2017 SIGMOD 7.5274958e-05
3,616 Parallel Local Graph Clustering 2016 VLDB 7.2559471e-05
3,892 Massively Parallel Algorithms for Personalized PageRank 2021 VLDB 7.0430255e-05
4,024 TopPPR: Top-k Personalized PageRank Queries with Precision Guarantees on Large Graphs 2018 SIGMOD 6.9479974e-05
5,250 Parallel Personalized PageRank on Dynamic Graphs 2018 VLDB 6.2992176e-05
5,741 Efficient Algorithms for Finding Approximate Heavy Hitters in Personalized PageRanks 2018 SIGMOD 6.1029326e-05
6,284 Efficient Personalized PageRank Computation: A Spanning Forests Sampling Based Approach 2022 SIGMOD 5.927015e-05
6,655 Indexed Fast Network Proximity Querying 2018 VLDB 5.8125709e-05
Previous Page 1 / 1 Next

Semantically Similar Papers