The Similarity between Stochastic Kronecker and Chung-Lu Graph Models
Ali Pinar, C. Seshadhri, Tamara G. Kolda

TL;DR
This paper demonstrates that the Stochastic Kronecker Graph (SKG) model is mathematically and empirically very similar to the Chung-Lu (CL) model, which is simpler and equally effective for modeling large graphs.
Contribution
The study reveals the near equivalence of SKG and CL models in graph properties and fitting real data, advocating for the use of CL as a simpler alternative.
Findings
SKG and CL models produce nearly identical graph properties.
CL model fits real data as well as SKG.
CL offers a simpler fitting procedure and matches degree distributions.
Abstract
The analysis of massive graphs is now becoming a very important part of science and industrial research. This has led to the construction of a large variety of graph models, each with their own advantages. The Stochastic Kronecker Graph (SKG) model has been chosen by the Graph500 steering committee to create supercomputer benchmarks for graph algorithms. The major reasons for this are its easy parallelization and ability to mirror real data. Although SKG is easy to implement, there is little understanding of the properties and behavior of this model. We show that the parallel variant of the edge-configuration model given by Chung and Lu (referred to as CL) is notably similar to the SKG model. The graph properties of an SKG are extremely close to those of a CL graph generated with the appropriate parameters. Indeed, the final probability matrix used by SKG is almost identical to that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
