Measuring Fundamental Properties of Real-World Complex Networks
arXiv:cs/0609115
Abstract
Complex networks, modeled as large graphs, received much attention during these last years. However, data on such networks is only available through intricate measurement procedures. Until recently, most studies assumed that these procedures eventually lead to samples large enough to be representative of the whole, at least concerning some key properties. This has crucial impact on network modeling and simulation, which rely on these properties. Recent contributions proved that this approach may be misleading, but no solution has been proposed. We provide here the first practical way to distinguish between cases where it is indeed misleading, and cases where the observed properties may be trusted. It consists in studying how the properties of interest evolve when the sample grows, and in particular whether they reach a steady state or not. In order to illustrate this method and to demonstrate its relevance, we apply it to data-sets on complex network measurements that are representative of the ones commonly used. The obtained results show that the method fulfills its goals very well. We moreover identify some properties which seem easier to evaluate in practice, thus opening interesting perspectives.
References in corpus (10)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- Epidemic spreading in scale-free networks
- Power laws, Pareto distributions and Zipf's law
- The diameter of the world wide web
- Random graphs with arbitrary degree distributions and their applications
- Problems with Fitting to the Power-Law Distribution
- A statistical approach to the traceroute-like exploration of networks: theory and simulations
- Network Inference from TraceRoute Measurements: Internet Topology `Species'
- Theory and Practice of Triangle Problems in Very Large (Sparse (Power-Law)) Graphs