Physics – Computational Physics
Scientific paper
2010-05-21
Physics
Computational Physics
Scientific paper
Specific choices about how to represent complex networks can have a substantial effect 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 as matrices or dynamically as spase structures. Three theoretical models of complex networks are considered: two types of Erdos-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.
Bruno Odemir Martinez
Fontoura Costa Luciano da
Ruggiero Carlos A.
Travieso Gonzalo
No associations
LandOfFree
On the Efficiency of Data Representation on the Modeling and Characterization of Complex Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the Efficiency of Data Representation on the Modeling and Characterization of Complex Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Efficiency of Data Representation on the Modeling and Characterization of Complex Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-412651