Abstract
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. Here, we consider Gromov’s notion of δ-hyperbolicity, and we establish several positive and negative results for small-world and tree-like random graph models. In particular, we show that small-world random graphs built from underlying grid structures do not have strong improvement in hyperbolicity, even when the rewiring greatly improves decentralized navigation. On the other hand, for a class of tree-like graphs called ringed trees that have constant hyperbolicity, adding random links among the leaves in a manner 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 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 δ to noises in random graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abraham, I., Balakrishnan, M., Kuhn, F., Malkhi, D., Ramasubramanian, V., Talwar, K.: Reconstructing approximate tree metrics. In: PODC (2007)
Baryshnikov, Y.: On the curvature of the Internet. In: Workshop on Stochastic Geometry and Teletraffic, Eindhoven, The Netherlands (April 2002)
Baryshnikov, Y., Tucci, G.H.: Asymptotic traffic flow in an hyperbolic network I: Definition and properties of the core. Technical Report Preprint: arXiv:1010.3304 (2010)
Bridson, M.R., Haefliger, A.: Metric Spaces of Non-Positive Curvature. Springer (1999)
Chen, W., Fang, W., Hu, G., Mahoney, M.W.: On the hyperbolicity of small-world and tree-like random graphs. Technical Report Preprint: arXiv:1201.1717v2 (2012)
Chepoi, V., Dragan, F.: A note on distance approximating trees in graphs. European Journal of Combinatorics 21(6), 761–766 (2000)
Chepoi, V., Dragan, F.F., Estellon, B., Habib, M., Vaxès, Y.: Diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs. In: SoCG (2008)
Chepoi, V., Dragan, F.F., Estellon, B., Habib, M., Vaxès, Y., Xiang, Y.: Additive spanners and distance and routing labeling schemes for hyperbolic graphs. Algorithmica 62(3-4), 713–732 (2012)
Chepoi, V., Estellon, B.: Packing and Covering δ-Hyperbolic Spaces by Balls. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) APPROX and RANDOM 2007. LNCS, vol. 4627, pp. 59–73. Springer, Heidelberg (2007)
de Montgolfier, F., Soto, M., Viennot, L.: Treewidth and hyperbolicity of the internet. In: IEEE Networks Computing and Applications 2011. IEEE (2011)
Gavoille, C., Ly, O.: Distance Labeling in Hyperbolic Graphs. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 1071–1079. Springer, Heidelberg (2005)
Gromov, M.: Hyperbolic groups. Essays in Group Theory 8, 75–263 (1987)
Jonckheere, E., Lohsoonthorn, P.: Hyperbolic geometry approach to multipath routing. In: MED (2002)
Jonckheere, E., Lou, M., Bonahon, F., Baryshnikov, Y.: Euclidean versus hyperbolic congestion in idealized versus experimental networks. Technical Report Preprint: arXiv:0911.2538 (2009)
Jonckheere, E.A., Lou, M., Hespanha, J., Barooah, P.: Effective resistance of Gromov-hyperbolic graphs: Application to asymptotic sensor network problems. In: CDC (2007)
Kleinberg, J.: The small-world phenomenon: an algorithm perspective. In: STOC (2000)
Kleinberg, J.: Small-world phenomena and the dynamics of information. In: NIPS (2002)
Kleinberg, J.: Complex networks and decentralized search algorithms. In: ICM (2006)
Kleinberg, R.: Geographic routing using hyperbolic space. In: Infocom (2007)
Krioukov, D., Claffy, K.C., Fall, K., Brady, A.: On compact routing for the Internet. Computer Communication Review 37(3), 41–52 (2007)
Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A., Boguñá, M.: Hyperbolic geometry of complex networks. Physical Review E 82, 036106 (2010)
Lamping, J., Rao, R.: Laying out and visualizing large trees using a hyperbolic space. In: UIST (1994)
Lohsoonthorn, P.: Hyperbolic Geometry of Networks. PhD thesis, University of Southern California (2003)
Lou, M.: Traffic pattern in negatively curved network. PhD thesis, University of Southern California (2008)
Martel, C.U., Nguyen, V.: Analyzing Kleinberg’s (and other) small-world models. In: PODC (2004)
Munzner, T., Burchard, P.: Visualizing the structure of the World Wide Web in 3D hyperbolic space. In: Web3D-VRML (1995)
Narayan, O., Saniee, I.: The large scale curvature of networks. Technical Report Preprint: arXiv:0907.1478 (2009)
Narayan, O., Saniee, I., Tucci, G.H.: Lack of spectral gap and hyperbolicity in asymptotic Erdős-Rényi random graphs. Technical Report Preprint: arXiv:1009.5700 (2010)
Nguyen, V., Martel, C.U.: Analyzing and characterizing small-world graphs. In: SODA (2005)
Shavitt, Y., Tankel, T.: Hyperbolic embedding of Internet graph for distance estimation and overlay construction. IEEE/ACM Transactions on Networking 16(1), 25–36 (2008)
Walter, J.A., Ritter, H.: On interactive visualization of high-dimensional data using the hyperbolic plane. In: KDD (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, W., Fang, W., Hu, G., Mahoney, M.W. (2012). On the Hyperbolicity of Small-World and Tree-Like Random Graphs. In: Chao, KM., Hsu, Ts., Lee, DT. (eds) Algorithms and Computation. ISAAC 2012. Lecture Notes in Computer Science, vol 7676. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35261-4_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-35261-4_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35260-7
Online ISBN: 978-3-642-35261-4
eBook Packages: Computer ScienceComputer Science (R0)