Towards an Efficient Weighted Random Walk Domination
Summary: Weighted random walk domination on weighted graphs: pick a k-set S under budget B to minimize residual access cost to S. DpSel baseline; MatrixSel matrix-based greedy; BoundSel bound-pruning; all achieve (1-1/e); real-data experiments show scalability, memory efficiency, and applicability to social advertising and base-station planning. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Songsong Mo (Wuhan University)
- 2. Zhifeng Bao (Royal Melbourne Institute of Technology University)
- 3. Ping Zhang (Huawei)
- 4. Zhiyong Peng (Wuhan University)
BibTeX Citation
@article{mo_vldb21,
title = {{Towards an Efficient Weighted Random Walk Domination}},
author = {Mo, Songsong and Bao, Zhifeng and Zhang, Ping and Peng, Zhiyong},
journal = {PVLDB},
series = {{VLDB} '21},
volume = {14},
number = {4},
pages = {560--572},
doi = {10.14778/3436905.3436915},
url = {https://doi.org/10.14778/3436905.3436915},
year = {2021}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 199 | Influence Maximization: Near-Optimal Time Complexity Meets Practical Efficiency | 2014 | SIGMOD | 0.00025510476 |
| 1,474 | Online Processing Algorithms for Influence Maximization | 2018 | SIGMOD | 0.00010552001 |
| 2,280 | Influence Maximization Revisited: Efficient Reverse Reachable Set Generation with Bound Tightened | 2020 | SIGMOD | 8.7029683e-05 |
| 2,604 | Effective Indexing for Approximate Constrained Shortest Path Queries on Large Road Networks | 2017 | VLDB | 8.2286766e-05 |
| 2,698 | Efficient Algorithms for Budgeted Influence Maximization on Massive Social Networks | 2020 | VLDB | 8.1163992e-05 |
| 8,721 | Confucius and Its Intelligent Disciples: Integrating Social with Search | 2010 | VLDB | 5.2880532e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,810 | Walk, Not Wait: Faster Sampling Over Online Social Networks | 2015 | VLDB |
| 2 | 4,649 | On the Embeddability of Random Walk Distances | 2013 | VLDB |
| 3 | 1,420 | Fast and Exact Top-k Search for Random Walk with Restart | 2012 | VLDB |
| 4 | 5,980 | Maximizing Welfare in Social Networks under A Utility Driven Influence Diffusion model | 2019 | SIGMOD |
| 5 | 9,960 | Efficient and Effective Algorithms for A Family of Influence Maximization Problems with A Matroid Constraint | 2025 | VLDB |
| 6 | 4,821 | Efficient Location-Aware Influence Maximization | 2014 | SIGMOD |
| 7 | 1,942 | A General Framework for Estimating Graphlet Statistics via Random Walk | 2017 | VLDB |
| 8 | 11,729 | Efficient Algorithm for Budgeted Adaptive Influence Maximization: An Incremental RR-set Update Approach | 2023 | SIGMOD |
| 9 | 6,305 | Memory-Aware Framework for Efficient Second-Order Random Walk on Large Graphs | 2020 | SIGMOD |
| 10 | 2,698 | Efficient Algorithms for Budgeted Influence Maximization on Massive Social Networks | 2020 | VLDB |