On computing the hyperbolicity of real-world graphs

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

Volumn 9294, Issue , 2015, Pages 215-226

  Borassi, Michele ^a   Coudert, David ^b   Crescenzi, Pierluigi ^c   Marino, Andrea ^d  

^a IMT INSTITUTE FOR ADVANCED STUDIES LUCCA   (Italy)

^b INRIA   (France)

^c UNIVERSITY OF FLORENCE   (Italy)

^d UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIG DATA; BIOINFORMATICS; COMPLEX NETWORKS; COMPUTATIONAL EFFICIENCY; GRAPH THEORY; GRAPHIC METHODS; NETWORK SECURITY;

COMPUTATIONAL BIOLOGY; CONFIGURATION MODEL; GRAPH ALGORITHMS; REAL-WORLD GRAPHS; REAL-WORLD NETWORKS; ROUTING SCHEME; TOPOLOGICAL PROPERTIES; WORST-CASE COMPLEXITY;

TOPOLOGY;

EID: 84945557067     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-662-48350-3_19     Document Type: Conference Paper

References (29)

1. Albert, R., DasGupta, B., Mobasheri, N.: Topological implications of negative curvature for biological and social networks. Physical Review E 89(3), 32811 (2014)
2. Alrasheed, H., Dragan, F.F.: Core-Periphery Models for Graphs based on their delta-Hyperbolicity: An Example Using Biological Networks. Studies in Computational Intelligence 597, 65-77 (2015)
3. Bavelas, A.: Communication patterns in task-oriented groups. Journal of the Acoustical Society of America 22, 725-730 (1950)
4. Boguna, M., Papadopoulos, F., Krioukov, D.: Sustaining the Internet with Hyperbolic Mapping. Nature Communications 62 (October 2010)
5. Borassi, M., Chessa, A., Caldarelli, G.: Hyperbolicity Measures “Democracy” in Real-World Networks. Preprint on arXiv, pp. 1-10 (March 2015)
6. Chen, W., Fang, W., Hu, G., Mahoney, M.: On the hyperbolicity of small-world and treelike random graphs. Internet Mathematics, pp. 1-40 (2013)
7. Chepoi, V., Dragan, F.F., Estellon, B., Habib, M., Vaxès, Y.: Notes on diameters, centers, and approximating trees of δ-hyperbolic geodesic spaces and graphs. Electronic Notes in Discrete Mathematics 31, 231-234 (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.) RANDOM 2007 and APPROX 2007. LNCS, vol. 4627, pp. 59-73. Springer, Heidelberg (2007)
10. Cohen, N., Coudert, D., Ducoffe, G., Lancin, A.: Applying clique-decomposition for computing Gromov hyperbolicity. Research Report RR-8535, HAL (2014)
11. Cohen, N., Coudert, D., Lancin, A.: On computing the Gromov hyperbolicity. ACM J. Exp. Algor. (2015)
12. Dress, A., Huber, K., Koolen, J., Moulton, V., Spillner, A.: Basic Phylogenetic Combinatorics. Cambridge University Press, Cambridge (2011)
13. Fang, W.: On Hyperbolic Geometry Structure of Complex Networks. Master’s thesis, MPRI at ENS and Microsoft Research Asia (2011)
14. Fournier, H., Ismail, A., Vigneron, A.: Computing the Gromov hyperbolicity of a discrete metric space. Information Processing Letters 115(6-8), 576-579 (2015)
15. Gromov, M.: Hyperbolic groups. In: Essays in Group Theory, Springer, Heidelberg (1987)
16. Havlin, S., Cohen, R.: Complex networks: structure, robustness and function. Cambridge University Press, Cambridge (2010)
17. Hofstad, R.V.D.: Random Graphs and Complex Networks (2014)
18. Jonckheere, E.A., Lohsoonthorn, P.: Geometry of network security. In: American Control Conference, vol. 2, pp. 976-981. IEEE, Boston (2004)
19. Kennedy, W.S., Narayan, O., Saniee, I.: On the Hyperbolicity of Large-Scale Networks. CoRR, abs/1307.0031:1-22 (2013)
20. Krauthgamer, R., Lee, J.R.: Algorithms on negatively curved spaces. In: IEEE Symposium on Foundations of Computer Science (FOCS), pp. 119-132 (2006)
21. Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A.: Hyperbolic Geometry of Complex Networks. Physical Review E 82(3), 36106 (2010)
22. Mitche, D., Pralat, P.: On the hyperbolicity of random graphs. The Electronic Journal of Combinatorics 21(2), 1-24 (2014)
23. Narayan, O., Saniee, I.: The Large Scale Curvature of Networks. Physical Review E 84, 66108 (2011)
24. Narayan, O., Saniee, I., Tucci, G.H.: Lack of Hyperbolicity in Asymptotic Erdös- Renyi Sparse Random Graphs. Internet Mathematics, 1-10 (2015)
25. Newman, M.E.J.: The Structure and Function of Complex Networks. SIAM Review 45(2), 167-256 (2003)
26. Papadopoulos, F., Krioukov, D., Boguna, M., Vahdat, A.: Greedy forwarding in scale-free networks embedded in hyperbolic metric spaces. ACM SIGMETRICS Performance Evaluation Review 37(2), 15-17 (2009)
27. Shang, Y.: Non-Hyperbolicity of Random Graphs with Given Expected Degrees. Stochastic Models 29(4), 451-462 (2013)
28. Soto Gómez, M.A.: Quelques propriétés topologiques des graphes et applications à internet et aux réseaux. PhD thesis, Univ. Paris Diderot, Paris 7 (2011)
29. Wu, Y., Zhang, C.: Hyperbolicity and chordality of a graph. The Electronic Journal of Combinatorics 18(1), 1-22 (2011)