Approximating single-source personalized pagerank with absolute error guarantees

DOI10.4230/LIPICS.ICDT.2024.9MaRDI QIDQ6902081zbMATH OpenFDO

Authors Zhewei Wei, Jirong Wen, Mingji Yang

Publication date 11 November 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICDT.2024.9

zbMATH Keywords

graph algorithmspersonalized pageranksublinear algorithms

Mathematics Subject Classification ID

Database theory (68P15)

Cites work

• Bookmark-Coloring Algorithm for Personalized PageRank Computing
• Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm
• Directed scale-free graphs
• Emergence of Scaling in Random Networks
• Local Computation of PageRank Contributions
• Local Computation of PageRank Contributions
• On the choice of kernel and labelled data in semi-supervised learning methods
• PageRank beyond the web
• Quick detection of top-k personalized PageRank lists
• Random generation of combinatorial structures from a uniform distribution
• Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments
• Using PageRank to Locally Partition a Graph
• Variational perspective on local graph clustering

This page was built for publication: Approximating single-source personalized pagerank with absolute error guarantees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902081)