Greedy pathlengths and small world graphs

Abstract We use matrix analysis to study a cycle plus random, uniform shortcuts—the classic small world model. For such graphs, in addition to the usual edge and vertex information there is an underlying metric that determines distance between vertices. The metric induces a natural greedy algorithm for navigating between vertices and we use this to define a pathlength. This pathlength definition, which is implicit in [J. Kleinberg, The small-world phenomenon: an algorithmic perspective, in: Proceedings of the 32nd ACM Symposium on Theory of Computing, 2000] is entirely appropriate in many message passing contexts. Using a Markov chain formulation, we set up a linear system to determine the expected greedy pathlengths and then use techniques from numerical analysis to find a continuum limit. This gives an asymptotically correct expression for the expected greedy pathlength in the limit of large network size: both the leading term and a sharp estimate of the remainder are produced. The results quantify how the greedy pathlength drops as the number of shortcuts is increased. Further, they allow us to measure the amount by which the greedy pathlength, which is based on local information, exceeds the traditional pathlength, which requires knowledge of the whole network. The analysis allows for either O(1) shortcuts per node or O(1) shortcuts per network. In both cases we find that the greedy algorithm fails to exploit fully the existence of short paths.

[1]  Ernst Hairer,et al.  Solving Ordinary Differential Equations I: Nonstiff Problems , 2009 .

[2]  Azer Bestavros,et al.  Small-world Characteristics of Internet Topologies and Multicast Scaling , 2003 .

[3]  Béla Bollobás,et al.  The Diameter of a Cycle Plus a Random Matching , 1988, SIAM J. Discret. Math..

[4]  D. Vere-Jones.  Markov Chains , 1972, Nature.

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

[6]  Anna T. Lawniczak,et al.  Performance of data networks with random links , 1999, ArXiv.

[7]  S. Strogatz.  Exploring complex networks , 2001, Nature.

[8]  Jose M. Montoya Ricard V. Sole,et al.  Small world patterns in food webs. , 2000, Journal of theoretical biology.

[9]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[10]  Lada A. Adamic.  The Small World Web , 1999, ECDL.

[11]  P. Grindrod.  Range-dependent random graphs and their application to modeling large small-world Proteome datasets. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[13]  M. Newman,et al.  Mean-field solution of the small-world network model. , 1999, Physical review letters.

[14]  Desmond J. Higham.  A Matrix Perturbation View of the Small World Phenomenon , 2007, SIAM Rev..

[15]  Duncan J Watts,et al.  A simple model of global cascades on random networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[16]  Jon M. Kleinberg,et al.  Navigation in a small world , 2000, Nature.

[17]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

[18]  M E J Newman,et al.  Identity and Search in Social Networks , 2002, Science.

[19]  Gesine Reinert,et al.  Small worlds , 2001, Random Struct. Algorithms.

[20]  Azer Bestavros,et al.  Small-world characteristics of Internet topologies and implications on multicast scaling , 2006, Comput. Networks.

[21]  Peter F. Stadler,et al.  Relevant cycles in Chemical reaction Networks , 2001, Adv. Complex Syst..

[22]  Stanislav Volkov,et al.  Packet delay in models of data networks , 2001, TOMC.