Many real-world networks demonstrate “scale-free” characteristics [1]}, [2]}.
Four initial sparse static graphs and sets of edge insertions
and deletions were created using an R-MAT [3]} generator with parameters \(A = 0.55\) , \(B = 0.1\) ,
\(C = 0.1\) , and \(D = 0.25)\) . These graphs contain 1K (tiny), 32K (small), 1M (medium),
and 16M (large) vertices with 8K, 256K, 8M, and 256M undirected edges, respectively.
Graphs over 1B edges were considered, but it was determined that many packages
could not handle that scale. Edge updates have a 6.25% probability of being deletions
uniformly selected from existing edges where deletions are handled in the default manner
for the package. For the tiny and small graphs, 100K updates were performed, and 1M
updates were performed otherwise.
