Dynamic exploration of networks: from general principles to the traceroute process

Abstract.Dynamical processes taking place on real networks define on them evolving subnetworks whose topology is not necessarily the same of the underlying one. We investigate the problem of determining the emerging degree distribution, focusing on a class of tree-like processes, such as those used to explore the Internet's topology. A general theory based on mean-field arguments is proposed, both for single-source and multiple-source cases, and applied to the specific example of the traceroute exploration of networks. Our results provide a qualitative improvement in the understanding of dynamical sampling and of the interplay between dynamics and topology in large networks like the Internet.

[1]  Hawoong Jeong,et al.  Statistical properties of sampled networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  Alain Barrat,et al.  What is the real size of a sampled network? The case of the Internet. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  R. May,et al.  Infectious Diseases of Humans: Dynamics and Control , 1991, Annals of Internal Medicine.

[4]  Robert Nowak,et al.  Network Tomography: Recent Developments , 2004 .

[5]  Mark Levene,et al.  Web Dynamics , 2004, Springer Berlin Heidelberg.

[6]  Jean-Jacques Pansiot,et al.  On routes and multicast trees in the Internet , 1998, CCRV.

[7]  Stefan Bornholdt,et al.  Handbook of Graphs and Networks: From the Genome to the Internet , 2003 .

[8]  E. Rogers,et al.  Diffusion of innovations , 1964, Encyclopedia of Sport Management.

[9]  Yamir Moreno,et al.  Dynamics of rumor spreading in complex networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  N. Wormald.  Differential Equations for Random Processes and Random Graphs , 1995 .

[11]  Mark S. Granovetter.  Threshold Models of Collective Behavior , 1978, American Journal of Sociology.

[12]  W. O. Kermack,et al.  A contribution to the mathematical theory of epidemics , 1927 .

[13]  E. Rogers,et al.  Diffusion of Innovations , 1964 .

[14]  Ericka Stricklin-Parker,et al.  Ann , 2005 .

[15]  Bruce A. Reed,et al.  The Size of the Giant Component of a Random Graph with a Given Degree Sequence , 1998, Combinatorics, Probability and Computing.

[16]  Carsten Wiuf,et al.  Subnets of scale-free networks are not scale-free: sampling properties of networks. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[17]  IEEE Infocom 2000 , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

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

[19]  Alessandro Vespignani,et al.  Evolution and Structure of the Internet: A Statistical Physics Approach , 2004 .

[20]  R. Pastor-Satorras,et al.  Epidemic spreading in correlated complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  B. M. Fulk.  MATH , 1992 .

[22]  Reuven Cohen,et al.  Tomography of scale-free networks and shortest path trees. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  Y. Moreno,et al.  Epidemic outbreaks in complex heterogeneous networks , 2001, cond-mat/0107267.

[24]  Alessandro Vespignani,et al.  Statistical theory of Internet exploration. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[26]  T. Petermann,et al.  Exploration of scale-free networks , 2004, cond-mat/0401065.

[27]  M. Newman.  Spread of epidemic disease on networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[29]  Dimitris Achlioptas,et al.  THE THRESHOLD FOR RANDOM k-SAT IS 2k log 2 O(k) , 2004, FOCS 2004.

[30]  Lada A. Adamic,et al.  Information flow in social groups , 2003, cond-mat/0305305.

[31]  Cristopher Moore,et al.  Accuracy and scaling phenomena in Internet mapping. , 2004, Physical review letters.

[32]  Alessandro Vespignani,et al.  Evolution and structure of the Internet , 2004 .

[33]  V. Latora,et al.  Complex networks: Structure and dynamics , 2006 .

[34]  Cristopher Moore,et al.  On the bias of traceroute sampling: Or, power-law degree distributions in regular graphs , 2005, JACM.

[35]  Lixia Zhang,et al.  Observing the evolution of internet as topology , 2007, SIGCOMM 2007.

[36]  Albert-László Barabási,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW , 2004 .