Hyperbolicity measures democracy in real-world networks

Physical Review E - Statistical, Nonlinear, and Soft Matter Physics

Volumn 92, Issue 3, 2015, Pages

  Borassi, Michele ^a   Chessa, Alessandro ^a,b   Caldarelli, Guido ^a,c,d  

^a IMT SCHOOL FOR ADVANCED STUDIES LUCCA   (Italy)

^b Linkalab   (Italy)

^c ISC CNR   (Italy)

^d LONDON INSTITUTE FOR MATHEMATICAL SCIENCES   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; LOCAL AREA NETWORKS;

AUTONOMOUS SYSTEMS; GEOMETRIC QUANTITIES; HYPERBOLIC NETWORKS; HYPERBOLICITY; METABOLIC NETWORK; POWER GRIDS; REAL NETWORKS; REAL-WORLD NETWORKS;

PEER TO PEER NETWORKS;

EID: 84943338669     PISSN: 15393755     EISSN: 15502376     Source Type: Journal    
DOI: 10.1103/PhysRevE.92.032812     Document Type: Article

References (37)

1. B. Bollobás and O. Riordan, The diameter of a scale-free random graph, Combinatorica 24, 5 (2004). COMBDI 0209-9683 10.1007/s00493-004-0002-2
2. B. Bollobás, Graph Theory, An Introductory Course, 1st ed. (Springer-Verlag, New York/Heidelberg/Berlin, 1979).
3. P. Erdös and A. Rényi, On random graphs, Publ. Math. Debrecen 6, 290 (1959).
4. P. Erdös and A. Rényi, On the evolution of random graphs, Bull. Inst. Internat. Statist. 38, 343 (1961).
5. R. Albert and A.-L. Barabási, Statistical mechanics of complex networks, Rev. Mod. Phys. 74, 47 (2002). RMPHAT 0034-6861 10.1103/RevModPhys.74.47
6. A. Barrat, M. Barthlemy, and A. Vespignani, Dynamical Processes on Complex Networks (Cambridge University Press, New York, 2008).
7. L. A. N. Amaral, A. Scala, M. Barthélémy, and H. E. Stanley, Classes of small-world networks, Proc. Natl. Acad. Sci. 97, 11149 (2000). PNASA6 0027-8424 10.1073/pnas.200327197
8. A. Bashan, Y. Berezin, S. V. Buldyrev, and S. Havlin, The extreme vulnerability of interdependent spatially embedded networks, Nat. Phys. 9, 667 (2013). 1745-2473 10.1038/nphys2727
9. G. Caldarelli, Scale-Free Networks: Complex Webs in Nature and Technology, Oxford Finance Series (Oxford University Press, Oxford, 2007).
10. R. Cohen and S. Havlin, Complex Networks: Structure, Robustness and Function (Cambridge University Press, Cambridge, 2010).
11. A.-L. Barabási and R. Albert, Emergence of scaling in random networks, Science 286, 509 (1999). SCIEAS 0036-8075 10.1126/science.286.5439.509
12. A. Barrat, M. Barthélemy, R. Pastor-Satorras, and A. Vespignani, The architecture of complex weighted networks, Proc. Natl. Acad. Sci. 101, 3747 (2004). PNASA6 0027-8424 10.1073/pnas.0400087101
13. G. Caldarelli, A. Capocci, P. De Los Rios, and M. A. Muñoz, Scale Free Networks from Varying Vertex Intrinsic Fitness, Phys. Rev. Lett. 89, 258702 (2002). PRLTAO 0031-9007 10.1103/PhysRevLett.89.258702
14. D. Krioukov, F. Papadopoulos, M. Kitsak, A. Vahdat, and M. Boguñá, Hyperbolic geometry of complex networks, Phys. Rev. E 82, 036106 (2010). PLEEE8 1539-3755 10.1103/PhysRevE.82.036106
15. M. Gromov, in Essays in Group Theory, edited by S. M. Gersten (Springer, New York, 1987), Vol. 8, Chap. 3, pp. 75-265.
16. S. Bermudo, J. M. Rodríguez, and J. M. Sigarreta, Computing the hyperbolicity constant, Comp. Math. App. 62, 4592 (2011). CMAPDK 0898-1221 10.1016/j.camwa.2011.10.041
17. S. Bermudo, J. M. Rodríguez, J. M. Sigarreta, and E. Tourís, Hyperbolicity and complement of graphs, App. Math. Lett. 24, 1882 (2011). AMLEEL 0893-9659 10.1016/j.aml.2011.05.011
18. W. Carballosa, R. M. Casablanca, A. de la Cruz, and J. M. Rodríguez, Gromov hyperbolicity in strong product graphs, Electronic Journal of Combinatorics 20, P2 (2013).
19. N. Cohen, D. Coudert, and A. Lancin, Exact and approximate algorithms for computing the hyperbolicity of large-scale graphs, Technical Report, HAL, 2013.
20. W. S. Kennedy, O. Narayan, and I. Saniee, On the hyperbolicity of large-scale networks, arXiv:1307.0031.
21. R. Albert, B. DasGupta, and N. Mobasheri, Topological implications of negative curvature for biological and social networks, Phys. Rev. E 89, 032811 (2014). PLEEE8 1539-3755 10.1103/PhysRevE.89.032811
22. Y. Shang, Lack of Gromov-hyperbolicity in small-world networks, Cent. Euro. J. Math. 10, 1152 (2012). 1895-1074 10.2478/s11533-012-0032-8
23. M. Abu-ata and F. F. Dragan, Metric tree-like structures in real-life networks: An empirical study, arXiv:1307.0031.
24. M. A. Javarone and G. Armano, Perception of similarity: A model for social network dynamics, J. Phys. A: Math. Theor. 46, 455102 (2013). 1751-8113 10.1088/1751-8113/46/45/455102
25. E. Jonckheere, M. Lou, F. Bonahon, and Y. Baryshnikov, Euclidean versus hyperbolic congestion in idealized versus experimental networks, Internet Mathematics 7, 1 (2011). 1542-7951 10.1080/15427951.2010.554320
26. M. Lou and E. Jonckheere, Load balancing by network curvature control, Journal of Computers, Communications and Control (IJCCC) 6, 134 (2011).
27. Y. Baryshnikov and G. Tucci, Asymptotic Traffic Flow in a Hyperbolic Network: Non-uniform Traffic, in Proceedings of 5th International Symposium on Communications Control and Signal Processing (ISCCSP), 2012 (IEEE, Piscataway, NJ, 2012), pp. 1-11.
28. S. Li and G. H. Tucci, Traffic congestion in expanders and (Equation presented)-hyperbolic spaces, Internet Mathematics 11, 134 (2015). 1542-7951 10.1080/15427951.2014.884513
29. M. E. J. Newman, Assortative Mixing in Networks, Phys. Rev. Lett. 89, 208701 (2002). 10.1103/PhysRevLett.89.208701
30. M. E. J. Newman, Mixing patterns in networks, Phys. Rev. E 67, 026126 (2003). 10.1103/PhysRevE.67.026126
31. N. Cohen, D. Coudert, G. Ducoffe, and A. Lancin, Applying clique-decomposition for computing Gromov hyperbolicity, Technical Report, HAL, 2014.
32. W. Fang, On Hyperbolic Geometry Structure of Complex Networks, Technical Report, Microsoft Research Asia, 2011.
33. M. Borassi, D. Coudert, P. Crescenzi, and A. Marino, On Computing the Hyperbolicity of Real-World Graphs, in Proceedings of the 23rd European Symposium on Algorithms (ESA) (Springer, Berlin, 2015).
34. W. Hoeffding, Probability inequalities for sums of bounded random variables, J. American Statistical Association 58, 13 (1963). JSTNAL 0162-1459 10.1080/01621459.1963.10500830
35. S. M. Ross, Introductory Statistics (Academic Press, Elsevier Burlington MA USA, 2010).
36. See Supplemental Material at http://link.aps.org/supplemental/10.1103/PhysRevE.92.032812 for detailed results on the average hyperbolicity and the influence area of the most central vertex.
37. A. Lancichinetti and S. Fortunato, Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities, Phys. Rev. E 80, 016118 (2009). PLEEE8 1539-3755 10.1103/PhysRevE.80.016118