Generating Network Models Using the S-Metric

摘要

The ability to create random models of real networks is useful for understanding the interactions in these systems. Several researchers have proposed modeling complex networks by using the node degree distribution, the most popular being a power-law distribution. Recent work by Li et al. introduced the S metric as a metric to characterize the structure of networks with power-law distributions. In this paper, we examine some of the practical difficulties of producing random graphs with a given degree sequence and an approximate S value. We give a solution for this problem that we have had success using in our research.