On the Hyperbolicity of Small-World and Treelike Random Graphs

Hyperbolicity is a property of a graph that may be viewed as being a "soft" version of a tree, and recent empirical and theoretical work has suggested that many graphs arising in Internet and related data applications have hyperbolic properties. We consider Gromov's notion of \delta-hyperbolicity, and establish several results for small-world and tree-like random graph models. First, we study the hyperbolicity of Kleinberg small-world random graphs and show that the hyperbolicity of these random graphs is not significantly improved comparing to graph diameter even when it greatly improves decentralized navigation. Next we study a class of tree-like graphs called ringed trees that have constant hyperbolicity. We show that adding random links among the leaves similar to the small-world graph constructions may easily destroy the hyperbolicity of the graphs, except for a class of random edges added using an exponentially decaying probability function based on the ring distance among the leaves. Our study provides one of the first significant analytical results on the hyperbolicity of a rich class of random graphs, which shed light on the relationship between hyperbolicity and navigability of random graphs, as well as on the sensitivity of hyperbolic {\delta} to noises in random graphs.

[1]  Jon M. Kleinberg,et al.  Small-World Phenomena and the Dynamics of Information , 2001, NIPS.

[2]  Yang Xiang,et al.  Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs , 2010, Algorithmica.

[3]  Feodor F. Dragan,et al.  Notes on diameters, centers, and approximating trees of delta-hyperbolic geodesic spaces and graphs , 2008, Electron. Notes Discret. Math..

[4]  Amin Vahdat,et al.  Efficient Navigation in Scale-Free Networks Embedded in Hyperbolic Metric Spaces , 2008, ArXiv.

[5]  E. Jonckheere,et al.  Geometry of network security , 2004, Proceedings of the 2004 American Control Conference.

[6]  M. Newman,et al.  Scaling and percolation in the small-world network model. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[7]  Robert D. Kleinberg.  Geographic Routing Using Hyperbolic Space , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[8]  Edmond A. Jonckheere,et al.  Scaled Gromov hyperbolic graphs , 2008, J. Graph Theory.

[9]  Laurent Viennot,et al.  Treewidth and Hyperbolicity of the Internet , 2011, 2011 IEEE 10th International Symposium on Network Computing and Applications.

[10]  M. Bridson,et al.  Metric Spaces of Non-Positive Curvature , 1999 .

[11]  Edward Howorka,et al.  On metric properties of certain clique graphs , 1979, J. Comb. Theory, Ser. B.

[12]  Wei Chen,et al.  On the Hyperbolicity of Small-World and Treelike Random Graphs , 2013, Internet Math..

[13]  Yuval Shavitt,et al.  On Hyperbolic Embedding of Internet Graph for Distance Estimation and Overlay Construction , 2007 .

[14]  E. Jonckheere,et al.  Hyperbolic geometry of networks , 2003 .

[15]  Feodor F. Dragan,et al.  Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs , 2008, SCG '08.

[16]  Feodor F. Dragan,et al.  A Note on Distance Approximating Trees in Graphs , 1999, Eur. J. Comb..

[17]  Ittai Abraham,et al.  Reconstructing approximate tree metrics , 2007, PODC '07.

[18]  Amin Vahdat,et al.  On curvature and temperature of complex networks , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[20]  Victor Chepoi,et al.  Diameters , centers , and approximating trees of δ-hyperbolic geodesic spaces and graphs ∗ [ Extended Abstract ] , 2007 .

[21]  Ramana Rao,et al.  Laying out and visualizing large trees using a hyperbolic space , 1994, UIST '94.

[22]  Amin Vahdat,et al.  Hyperbolic Geometry of Complex Networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  V. Chepoi,et al.  Packing and covering δ-hyperbolic spaces by balls ? , 2007 .

[24]  Iraj Saniee,et al.  Large-scale curvature of networks. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[25]  Sergio Bermudo,et al.  Mathematical Properties of Gromov Hyperbolic Graphs , 2010 .

[26]  Marián Boguñá,et al.  Navigability of Complex Networks , 2007, ArXiv.

[27]  O. Narayan,et al.  Lack of Spectral Gap and Hyperbolicity in Asymptotic Erd\"os-Renyi Random Graphs , 2010 .

[28]  Yuliy Baryshnikov,et al.  Asymptotic Traffic Flow in an Hyperbolic Network I: Definition and Properties of the Core , 2010, ArXiv.

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

[30]  Olivier Ly,et al.  Distance Labeling in Hyperbolic Graphs , 2005, ISAAC.

[31]  Helge J. Ritter,et al.  On interactive visualization of high-dimensional data using the hyperbolic plane , 2002, KDD.

[32]  M. Gromov.  Metric Structures for Riemannian and Non-Riemannian Spaces , 1999 .

[33]  Tamara Munzner,et al.  Visualizing the structure of the World Wide Web in 3D hyperbolic space , 1995, VRML '95.

[34]  Gabriel H. Tucci.  Random Regular Graphs are not Asymptotically Gromov Hyperbolic , 2012, ArXiv.

[35]  Mingji Lou,et al.  Traffic pattern in negatively curved network , 2008 .

[36]  A. O. Houcine.  On hyperbolic groups , 2006 .

[37]  Iraj Saniee,et al.  Lack of spectral gap and hyperbolicity in asymptotic Erdo¨s-Renyi sparse random graphs , 2012, 2012 5th International Symposium on Communications, Control and Signal Processing.

[38]  Yilun Shang,et al.  Lack of Gromov-hyperbolicity in small-world networks , 2012 .

[39]  Arthur Brady,et al.  On compact routing for the internet , 2007, CCRV.

[40]  Charles U. Martel,et al.  Analyzing and characterizing small-world graphs , 2005, SODA '05.

[41]  Eric Rémila,et al.  Some Properties of Hyperbolic Networks , 2000, DGCI.

[42]  Yuliy Baryshnikov,et al.  Euclidean versus Hyperbolic Congestion in Idealized versus Experimental Networks , 2009, Internet Math..

[43]  Ramana Rao,et al.  A focus+context technique based on hyperbolic geometry for visualizing large hierarchies , 1995, CHI '95.

[44]  Tamara Munzner,et al.  Exploring Large Graphs in 3D Hyperbolic Space , 1998, IEEE Computer Graphics and Applications.

[45]  João Pedro Hespanha,et al.  Effective resistance of Gromov-hyperbolic graphs: Application to asymptotic sensor network problems , 2007, 2007 46th IEEE Conference on Decision and Control.