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 CLgraph generated with the appropriate parameters. Indeed, the final probability matrix used by SKG is almost identical to that of a CL model. This implies that the graph distribution represented by SKG is almost the same as that given by a CL model. We also show that when it comes to fitting real data, CL performs as well as SKG based on empirical studies of graph properties. CL has the added benefit of a trivially simple fitting procedure and exactly matching the degree distribution. Our results suggest that users of the SKG model should consider the CL model because of its similar properties, simpler structure, and ability to fit a wider range of degree distributions. At the very least, CL is a good control model to compare against.
@inproceedings{PiSeKo12,
author = {Ali Pinar and C. Seshadhri and Tamara G. Kolda},
title = {The Similarity between Stochastic {Kronecker} and {Chung-Lu} Graph Models},
booktitle = {SDM12: Proceedings of the 12th SIAM International Conference on Data Mining},
venue = {Anaheim, CA},
eventdate = {2012-04-26/2012-04-28},
pages = {1071-1082},
year = {2012},
doi = {10.1137/1.9781611972825.92},
}