On the hyperbolicity of small-world and tree-like random graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7676 LNCS, Issue , 2012, Pages 278-288

  Chen, Wei ^a   Fang, Wenjie ^b   Hu, Guangda ^c   Mahoney, Michael W ^d  

^a MICROSOFT RESEARCH ASIA   (China)

^b ECOLE NORMALE SUPÉRIEURE   (France)

^c PRINCETON UNIVERSITY   (United States)

^d STANFORD UNIVERSITY   (United States)

Author keywords

Complex networks; Decentralized navigation; Graph hyperbolicity; Random graphs; Small world networks

Indexed keywords

COMPLEX NETWORKS; FORESTRY; GRAPHIC METHODS; SMALL-WORLD NETWORKS; STRUCTURES (BUILT OBJECTS);

ANALYTICAL RESULTS; DATA APPLICATION; DECENTRALIZED NAVIGATION; HYPERBOLICITY; PROBABILITY FUNCTIONS; RANDOM GRAPH MODELS; RANDOM GRAPHS; SMALL WORLD GRAPHS;

TREES (MATHEMATICS);

ALGORITHMS; FORESTRY; MATHEMATICS; RANDOM PROCESSES; STRUCTURES; TREES;

EID: 84871565603     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-35261-4_31     Document Type: Conference Paper

References (31)

1. Abraham, I., Balakrishnan, M., Kuhn, F., Malkhi, D., Ramasubramanian, V., Talwar, K.: Reconstructing approximate tree metrics. In: PODC (2007)
2. Baryshnikov, Y.: On the curvature of the Internet. In:Workshop on Stochastic Geometry and Teletraffic, Eindhoven, The Netherlands (April 2002)
3. 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)
4. Bridson, M.R., Haefliger, A.: Metric Spaces of Non-Positive Curvature. Springer (1999)
5. 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)
6. Chepoi, V., Dragan, F.: A note on distance approximating trees in graphs. European Journal of Combinatorics 21(6), 761-766 (2000)
7. 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)
8. 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)
9. 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)
10. de Montgolfier, F., Soto, M., Viennot, L.: Treewidth and hyperbolicity of the internet. In: IEEE Networks Computing and Applications 2011. IEEE (2011)
11. 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)
12. Gromov, M.: Hyperbolic groups. Essays in Group Theory 8, 75-263 (1987)
13. Jonckheere, E., Lohsoonthorn, P.: Hyperbolic geometry approach to multipath routing. In: MED (2002)
14. Jonckheere, E., Lou, M., Bonahon, F., Baryshnikov, Y.: Euclidean versus hyperbolic congestion in idealized versus experimental networks. Technical Report Preprint: arXiv:0911.2538 (2009)
15. Jonckheere, E.A., Lou, M., Hespanha, J., Barooah, P.: Effective resistance of Gromovhyperbolic graphs: Application to asymptotic sensor network problems. In: CDC (2007)
16. Kleinberg, J.: The small-world phenomenon: an algorithm perspective. In: STOC (2000)
17. Kleinberg, J.: Small-world phenomena and the dynamics of information. In: NIPS (2002)
18. Kleinberg, J.: Complex networks and decentralized search algorithms. In: ICM (2006)
19. Kleinberg, R.: Geographic routing using hyperbolic space. In: Infocom (2007)
20. Krioukov, D., Claffy, K.C., Fall, K., Brady, A.: On compact routing for the Internet. Computer Communication Review 37(3), 41-52 (2007)
21. Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A., Boguñá, M.: Hyperbolic geometry of complex networks. Physical Review E 82, 036106 (2010)
22. Lamping, J., Rao, R.: Laying out and visualizing large trees using a hyperbolic space. In: UIST (1994)
23. Lohsoonthorn, P.: Hyperbolic Geometry of Networks. PhD thesis, University of Southern California (2003)
24. Lou, M.: Traffic pattern in negatively curved network. PhD thesis, University of Southern California (2008)
25. Martel, C.U., Nguyen, V.: Analyzing Kleinberg's (and other) small-world models. In: PODC (2004)
26. Munzner, T., Burchard, P.: Visualizing the structure of theWorldWideWeb in 3D hyperbolic space. In: Web3D-VRML (1995)
27. Narayan, O., Saniee, I.: The large scale curvature of networks. Technical Report Preprint: arXiv:0907.1478 (2009)
28. Narayan, O., Saniee, I., Tucci, G.H.: Lack of spectral gap and hyperbolicity in asymptotic Erdo{combining double acute accent}s-Rényi random graphs. Technical Report Preprint: arXiv:1009.5700 (2010)
29. Nguyen, V., Martel, C.U.: Analyzing and characterizing small-world graphs. In: SODA (2005)
30. Shavitt, Y., Tankel, T.: Hyperbolic embedding of Internet graph for distance estimation and overlay construction. IEEE/ACMTransactions on Networking 16(1), 25-36 (2008)
31. Walter, J.A., Ritter, H.: On interactive visualization of high-dimensional data using the hyperbolic plane. In: KDD (2002)