On the hyperbolicity of small-world and treelike random graphs

Internet Mathematics

Volumn 9, Issue 4, 2013, Pages 434-491

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

^a MICROSOFT RESEARCH ASIA   (China)

^b UNIVERSITÉ PARIS DIDEROT   (France)

^c Princeton University   (United States)

^d STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84901589105     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2013.828336     Document Type: Article

References (45)

1. I. Abraham, M. Balakrishnan, F. Kuhn, D. Malkhi, V. Ramasubramanian, and K. Talwar. “Reconstructing Approximate Tree Metrics.” In Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing, pp. 43–52, 2007.
2. Y. Baryshnikov. “On the Curvature of the Internet.” In Workshop on Stochastic Geometry and Teletraffic, Eindhoven, The Netherlands, 2002.
3. Y. Baryshnikov and G. H. Tucci. “Asymptotic Traffic Flow in an Hyperbolic Network I: Definition and Properties of the Core.” arXiv:1010.3304, 2010.
4. S. Bermudo, J. M. Rodríguez, J. M. Sigarreta, and J.-M. Vilaire. “Mathematical Properties of Gromov Hyperbolic Graphs.” In Proceedings of the 2010 International Conference of Numerical Analysis and Applied Mathematics, pp. 575–578, 2010.
5. M. Boguñá, D. Krioukov, and K. C. Claffy. “Navigability of Complex Networks.” Nature Physics 5 (2009), 74–80.
6. Brian H. Bowditch. “Notes on Gromov’s Hyperbolicity Criterion for Path-Metric Spaces.” In Group Theory from a Geometrical Viewpoint (Trieste, 1990), pp. 64–167, 1991.
7. Martin R. Bridson and André Haefliger. Metric Spaces of Non-positive Curvature. Springer, 1999.
8. V. Chepoi and F. Dragan. “A Note on Distance Approximating Trees in Graphs.” European Journal of Combinatorics 21 (2000), 761–766.
9. V. Chepoi and B. Estellon. “Packing and Covering δ- Hyperbolic Spaces by Balls.” In Proceedings of the 10th International Workshop on Approximation, pp. 59–73, 2007.
10. Victor Chepoi, Feodor. F. Dragan, Bertrand Estellon, Michel Habib, and Yann Vaxès. “Diameters, Centers, and Approximating Trees of δ-Hyperbolic Geodesic Spaces and Graphs.” In Proceedings of the 24th Annual Symposium on Computational Geometry, pp. 59–68. ACM, 2008.
11. V. Chepoi, F. F. Dragan, B. Estellon, M. Habib, Y. Vaxès, and Y. Xiang. “Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs.” Algorithmica 62 (2012), 713–732.
12. C. Gavoille and O. Ly. “Distance Labeling in Hyperbolic Graphs.” In Proceedings of the 16th Annual International Symposium on Algorithms and Computation, pp. 1071–1079, 2005.
13. étienne Ghys and Pierre de La Harpe. “Sur les groupes hyperboliques d’après Mikhael Gromov.” Birkhäuser, 1990.
14. Mikhael Gromov. “Hyperbolic Groups.” Essays in Group Theory 8 (1987), 75–263.
15. Edward Howorka. “On Metric Properties of Certain Clique Graphs.” Journal of Combinatorial Theory, Series B 27 (1979), 67–74.
16. E. Jonckheere and P. Lohsoonthorn. “Hyperbolic Geometry Approach to Multipath Routing.” In Proceedings of the 10th Mediterranean Conference on Control and Automation, 2002.
17. E. Jonckheere and P. Lohsoonthorn. “Geometry of Network Security,” In Proceedings of the 2004 American Control Conference, pp. 976–981, 2004.
18. E. A. Jonckheere, M. Lou, J. Hespanha, and P. Barooah. “Effective Resistance of Gromov-Hyperbolic Graphs: Application to Asymptotic Sensor Network Problems.” In Proceedings of the 46th IEEE Conference on Decision and Control, pp. 1453–1458, 2007.
19. E. Jonckheere, P. Lohsoonthorn, and F. Bonahon. “Scaled Gromov Hyperbolic Graphs.” Journal of Graph Theory 57 (2008), 157–180.
20. Edmond Jonckheere, Mingji Lou, Francis Bonahon, and Yuliy Baryshnikov. “Euclidean versus Hyperbolic Congestion in Idealized versus Experimental Networks.” Internet Mathematics 7 (2011), 1–27.
21. J. Kleinberg. “The Small-World Phenomenon: An Algorithm Perspective.” In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 163–170, 2000.
22. J. Kleinberg. “Small-World Phenomena and the Dynamics of Information.” Proceedings of Annual Advances in Neural Information Processing Systems, pp. 431–438, 2002.
23. J. Kleinberg. “Complex Networks and Decentralized Search Algorithms.” In Proceedings of the International Congress of Mathematicians, 2006.
24. R. Kleinberg. “Geographic Routing Using Hyperbolic Space.” In Proceedings of the 26th IEEE International Conference on Computer Communications, pp. 1902–1909, 2007.
25. D. Krioukov, K. C. Claffy, K. Fall, and A. Brady. “On Compact Routing for the Internet.” Computer Communication Review 37 (2007), 41–52.
26. D. Krioukov, F. Papadopoulos, A. Vahdat, and M. Boguñá. “Curvature and Temperature of Complex Networks.” Physical Review E 80 (2009), 035101(R).
27. D. Krioukov, F. Papadopoulos, M. Kitsak, A. Vahdat, and M. Boguñá, “Hyperbolic Geometry of Complex Networks.” Physical Review E 82 (2010), 036106.
28. J. Lamping and R. Rao. “Laying Out and Visualizing Large Trees Using a Hyperbolic Space.” In Proceedings of the 7th Annual ACM Symposium on User Interface Software and Technology, pp. 13–14, 1994.
29. J. Lamping, R. Rao, and P. Pirolli. “A Focus + Context Technique Based on Hyperbolic Geometry for Visualizing Large Hierarchies.” In Proceedings of CHI’95: Conference on Human Factors in Computing, pp. 401–408, 1995.
30. P. Lohsoonthorn. “Hyperbolic Geometry of Networks.” PhD thesis, University of Southern California, 2003.
31. M. Lou. “Traffic Pattern in Negatively Curved Network.” PhD thesis, University of Southern California, 2008.
32. Charles U. Martel and Van Nguyen. “Analyzing Kleinberg’s (and Other) Small-World Models.” In Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing, pp. 179–188, 2004.
33. Fabien de Montgolfier, Mauricio Soto, and Laurent Viennot. “Treewidth and Hyperbolicity of the Internet.” In IEEE Networks Computing and Applications 2011. IEEE, 2011.
34. T. Munzner. “Exploring Large Graphs in 3D Hyperbolic Space.” IEEE Computer Graphics and Applications 18 (1998), 18–23.
35. T. Munzner and P. Burchard. “Visualizing the Structure of the World Wide Web in 3D Hyperbolic Space.” In Proceedings of the First Symposium on Virtual Reality Modeling Language, pp. 33–38, 1995.
36. Onuttom Narayan and Iraj Saniee. “Large-Scale Curvature of Networks.” Phys. Rev. E 84 (2011), 066108.
37. O. Narayan, I. Saniee, and G. H. Tucci. “Lack of Spectral Gap and Hyperbolicity in Asymptotic Erdős–Rényi Random Graphs.” In Proceedings of the 5th International Symposium on Communications Control and Signal Processing (ISCCSP), pp. 1–4, 2012.
38. M. E. J. Newman and D. J. Watts. “Scaling and Percolation in the Small-World Network Model.” Physical Review E 60 (1999), 7332–7342.
39. Van Nguyen and Charles U. Martel. “Analyzing and Characterizing Small-World Graphs.” In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 311–320, 2005.
40. Fragkiskos Papadopoulos, Dmitri V. Krioukov, Marían Boguñá, and Amin Vahdat. “Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces.” In Proceedings of the 29th IEEE International Conference on Computer Communications (INFOCOM), pp. 2973–2981, 2010.
41. C. Papazian and E. Rémila. “Some Properties of Hyperbolic Networks.” In Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery, pp. 149–158, 2000.
42. Yilun Shang. “Lack of Gromov-Hyperbolicity in Small-World Networks.” Central European Journal of Mathematics 10 (2012), 1152–1158.
43. Y. Shavitt and T. Tankel. “Hyperbolic Embedding of Internet Graph for Distance Estimation and Overlay Construction.” IEEE/ACM Transactions on Networking 16 (2008), 25–36.
44. Gabriel H. Tucci. “Random Regular Graphs Are Not Asymptotically Gromov Hyperbolic.” arXiv:1203.5069, 2012.
45. J. A. Walter and H. Ritter. “On Interactive Visualization of High-Dimensional Data Using the Hyperbolic Plane.” Proceedings of the 8th Annual ACM SIGKDD Conference, pp. 123–132, 2002.