Leveraging History for Faster Sampling of Online Social Networks
Summary: Leverages history to form higher-order Markov walks, CNRW and GNRW, for faster sampling on online social networks. They prove preservation of the stationary distribution and show empirical gains over standard random walks on real and synthetic graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Zhuojie Zhou
- 2. Nan Zhang
- 3. Gautam Das
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,740 | A General Framework for Estimating Graphlet Statistics via Random Walk | 2017 | VLDB | 0.0001071792 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 388 | Graph Summarization with Bounded Error | 2008 | SIGMOD | 0.00024662272 |
| 11,977 | Aggregate Estimation Over a Microblog Platform | 2014 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next