Generalizing Kronecker graphs in order to model searchable networks

This paper describes an extension to stochastic Kronecker graphs that provides the special structure required for searchability, by defining a “distance”-dependent Kronecker operator. We show how this extension of Kronecker graphs can generate several existing social network models, such as the Watts-Strogatz small-world model and Kleinberg's lattice-based model. We focus on a specific example of an expanding hypercube, reminiscent of recently proposed social network models based on a hidden hyperbolic metric space, and prove that a greedy forwarding algorithm can find very short paths of length O((log log n)2) for graphs with n nodes.

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

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

[3]  Amin Vahdat,et al.  Greedy forwarding in scale-free networks embedded in hyperbolic metric spaces , 2009, SIGMETRICS Perform. Evaluation Rev..

[4]  Dmitri V. Krioukov,et al.  Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces , 2008, 2010 Proceedings IEEE INFOCOM.

[5]  Charles U. Martel,et al.  Analyzing Kleinberg's (and other) small-world Models , 2004, PODC '04.

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

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

[8]  Christos Faloutsos,et al.  Dynamics of large networks , 2008 .

[9]  Paul Erdös,et al.  On random graphs, I , 1959 .

[10]  Béla Bollobás,et al.  Random Graphs , 1985 .

[11]  Marián Boguñá,et al.  Navigating ultrasmall worlds in ultrashort time. , 2008, Physical review letters.

[12]  Mark Crovella,et al.  Hyperbolic Embedding and Routing for Dynamic Graphs , 2009, IEEE INFOCOM 2009.

[13]  Christos Faloutsos,et al.  Realistic, Mathematically Tractable Graph Generation and Evolution, Using Kronecker Multiplication , 2005, PKDD.

[14]  Christos Faloutsos,et al.  Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.

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

[16]  George Giakkoupis,et al.  The effect of power-law degrees on the navigability of small worlds: [extended abstract] , 2009, PODC '09.

[17]  P. Bak,et al.  A forest-fire model and some thoughts on turbulence , 1990 .

[18]  Aditya Akella,et al.  On the treeness of internet latency and bandwidth , 2009, SIGMETRICS '09.

[19]  Mohammad Mahdian,et al.  Stochastic Kronecker Graphs , 2007, WAW.

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