ROLL: Fast In-Memory Generation of Gigantic Scale-free Networks
Summary: ROLL-tree uses an in-memory roulette-wheel data structure to enable exact Barabási–Albert preferential attachment for scale-free graph generation. ≈1000× faster than state-of-the-art on a single PC; generates 1.1B nodes and 6.6B edges in 62 minutes, and generalizes to other rich-get-richer growth models. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Ali Hadian
- 2. Sadegh Nobari
- 3. Behrooz Minaei-Bidgoli
- 4. Qiang Qu
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,733 | TopPPR: Top-k Personalized PageRank Queries with Precision Guarantees on Large Graphs | 2018 | SIGMOD | 5.9631943e-05 |
| 6,668 | TrillionG: A Trillion-scale Synthetic Graph Generator using a Recursive Vector Model | 2017 | SIGMOD | 4.968252e-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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 334 | Fast and Practical Indexing and Querying of Very Large Graphs | 2007 | SIGMOD | 0.00027081079 |
| 4,713 | SharkDB: An In-Memory Storage System for Massive Trajectory Data | 2015 | SIGMOD | 5.9786915e-05 |
| 4,780 | TOUCH: In-Memory Spatial Join by Hierarchical Data-Oriented Partitioning | 2013 | SIGMOD | 5.9263494e-05 |
| 6,572 | Mining Statistically Significant Connected Subgraphs in Vertex Labeled Graphs | 2014 | SIGMOD | 5.005963e-05 |
| 12,043 | A Direct Mining Approach To Efficient Constrained Graph Pattern Discovery | 2013 | SIGMOD | 4.1945683e-05 |
Previous
Page 1 / 1
Next