Exploration of scale-free networks

Abstract.The increased availability of data on real networks has favoured an explosion of activity in the elaboration of models able to reproduce both qualitatively and quantitatively the measured properties. What has been less explored is the reliability of the data, and whether the measurement technique biases them. Here we show that tree-like explorations (similar in principle to traceroute) can indeed change the measured exponents of a scale-free network.

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

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

[3]  L. A. Nunes Amaral,et al.  Extremum statistics in scale-free network models. , 2002, Physical review letters.

[4]  M. Marsili,et al.  Interacting Individuals Leading to Zipf's Law , 1998, cond-mat/9801289.

[5]  G. Caldarelli,et al.  The fractal properties of Internet , 2000, cond-mat/0009178.

[6]  S. Redner,et al.  Connectivity of growing random networks. , 2000, Physical review letters.

[7]  M. A. Muñoz,et al.  Scale-free networks from varying vertex intrinsic fitness. , 2002, Physical review letters.

[8]  George Kingsley Zipf,et al.  Human behavior and the principle of least effort , 1949 .

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

[10]  R. Pastor-Satorras,et al.  Class of correlated random networks with hidden variables. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.