On the efficiency of data representation on the modeling and characterization of complex networks

Specific choices about how to represent complex networks can have a substantial impact on the execution time required for the respective construction and analysis of those structures. In this work we report a comparison of the effects of representing complex networks statically by adjacency matrices or dynamically by adjacency lists. Three theoretical models of complex networks are considered: two types of Erdős–Renyi as well as the Barabasi–Albert model. We investigated the effect of the different representations with respect to the construction and measurement of several topological properties (i.e. degree, clustering coefficient, shortest path length, and betweenness centrality). We found that different forms of representation generally have a substantial effect on the execution time, with the sparse representation frequently resulting in remarkably superior performance.

[1]  L. da F. Costa,et al.  Characterization of complex networks: A survey of measurements , 2005, cond-mat/0505185.

[2]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[3]  FaloutsosMichalis,et al.  On power-law relationships of the Internet topology , 1999 .

[4]  Judith L. Gersting.  Mathematical structures for computer science : a modern approach to discrete mathematics , 2007 .

[5]  Ronald L. Graham,et al.  Concrete Mathematics, a Foundation for Computer Science , 1991, The Mathematical Gazette.

[6]  K. Hawick,et al.  Computational Data Structures for High-Performance Complex Network-Based Small-World Simulations , 2005 .

[7]  S. Wasserman,et al.  Social Network Analysis: Computer Programs , 1994 .

[8]  William H. Press,et al.  Numerical recipes in C , 2002 .

[9]  C. Tsallis.  Possible generalization of Boltzmann-Gibbs statistics , 1988 .

[10]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[11]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[12]  S. N. Dorogovtsev,et al.  Evolution of networks , 2001, cond-mat/0106144.

[13]  A. Barabasi,et al.  Lethality and centrality in protein networks , 2001, Nature.

[14]  John Scott.  What is social network analysis , 2010 .

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

[16]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

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