DBScholar

Back to papers

Estimating Single-Node PageRank in O~(min{d_t, sqrt(m)}) Time

Summary: Introduces SetPush, a single-node PageRank estimator for undirected graphs that avoids the linear-time worst cases of random walks and backward push. It achieves \tilde O(min{d_t,√m}) time with constant relative error and failure probability, supported by experiments. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
13324
Venue
VLDB
Year
2023
Pagerank
5.4949527e-05
Overall Rank
8,063 | 44.69%
DOI
10.14778/3611479.3611500

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{wang_vldb23,
        title = {{Estimating Single-Node PageRank in O\~{}(min\{d\_t, sqrt(m)\}) Time}},
        author = {Wang, Hanzhi and Wei, Zhewei},
        journal = {PVLDB},
        series = {{VLDB} '23},
        volume = {16},
        number = {11},
        pages = {2949--2961},
        doi = {10.14778/3611479.3611500},
        url = {https://doi.org/10.14778/3611479.3611500},
        year = {2023}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
10,161 Near-Optimality for Single-Source Personalized PageRank 2026 PODS 5.093636e-05
11,237 BIRD: Efficient Approximation of Bidirectional Hidden Personalized PageRank 2024 VLDB 5.093636e-05
Previous Page 1 / 1 Next

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.

Previous Page 1 / 1 Next

Semantically Similar Papers