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

0Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.

Abstract

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 ErdsRnyi as well as the Barabási-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. © 2011 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Ruggiero, C. A., Bruno, O. M., Travieso, G., & Da Fontoura Costa, L. (2011). On the efficiency of data representation on the modeling and characterization of complex networks. Physica A: Statistical Mechanics and Its Applications, 390(11), 2172–2180. https://doi.org/10.1016/j.physa.2011.02.011

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free