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

[1]  R. Albert,et al.  The large-scale organization of metabolic networks , 2000, Nature.

[2]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[3]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[4]  Amitabha Tripathi,et al.  A note on a theorem of Erdös & Gallai , 2003, Discret. Math..

[5]  D. Richard Kuhn,et al.  Study of BGP Peering Session Attacks and Their Impacts on Routing Performance , 2006, IEEE Journal on Selected Areas in Communications.

[6]  James Noble,et al.  Scale-free geometry in OO programs , 2005, CACM.

[7]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[8]  Amitabha Tripathi,et al.  A note on a theorem of Erd˝ os & Gallai , 2003 .

[9]  Brian Cloteaux,et al.  Measuring the effectiveness of the s-metric to produce better network models , 2008, 2008 Winter Simulation Conference.

[10]  H E Stanley,et al.  Classes of small-world networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[11]  Neo D. Martinez,et al.  Simple rules yield complex food webs , 2000, Nature.

[12]  Walter Willinger,et al.  Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications , 2005, Internet Math..

[13]  Gerhard W. Dueck,et al.  Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .

[14]  Christos Gkantsidis,et al.  The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs , 2003, ALENEX.

[15]  Dana Randall,et al.  Rapidly mixing Markov chains with applications in computer science and physics , 2006, Computing in Science & Engineering.

[16]  Matthieu Latapy,et al.  Efficient and simple generation of random simple connected graphs with prescribed degree sequence , 2005, J. Complex Networks.