Hyperbolicity Measures "Democracy" in Real-World Networks

In this work, we analyze the hyperbolicity of real-world networks, a geometric quantity that measures if a space is negatively curved. We provide two improvements in our understanding of this quantity: first of all, in our interpretation, a hyperbolic network is "aristocratic", since few elements "connect" the system, while a non-hyperbolic network has a more "democratic" structure with a larger number of crucial elements. The second contribution is the introduction of the average hyperbolicity of the neighbors of a given node. Through this definition, we outline an "influence area" for the vertices in the graph. We show that in real networks the influence area of the highest degree vertex is small in what we define "local" networks (i.e., social or peer-to-peer networks), and large in "global" networks (i.e., power grid, metabolic networks, or autonomous system networks).

[1]  Frank Harary,et al.  Graph Theory , 2016 .

[2]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[3]  William Sean Kennedy,et al.  On the Hyperbolicity of Large-Scale Networks , 2013, ArXiv.

[4]  A. O. Houcine.  On hyperbolic groups , 2006 .

[5]  Jose Maria Sigarreta,et al.  Hyperbolicity and complement of graphs , 2011, Appl. Math. Lett..

[6]  Guido Caldarelli,et al.  Scale-Free Networks , 2007 .

[7]  Stephen A. McGuire,et al.  Introductory Statistics , 2007, Technometrics.

[8]  Bhaskar DasGupta,et al.  Topological implications of negative curvature for biological and social networks , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  M. Newman,et al.  Mixing patterns in networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Jose Maria Sigarreta,et al.  Computing the hyperbolicity constant , 2011, Comput. Math. Appl..

[11]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[12]  M. A. Muñoz,et al.  Scale-free networks from varying vertex intrinsic fitness. , 2002, Physical review letters.

[13]  B. Bollobás.  The evolution of random graphs , 1984 .

[14]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[15]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[16]  Amin Vahdat,et al.  Hyperbolic Geometry of Complex Networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Andrea Lancichinetti,et al.  Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Feodor F. Dragan,et al.  Metric tree‐like structures in real‐world networks: an empirical study , 2016, Networks.

[19]  D. Coudert,et al.  Exact and approximate algorithms for computing the hyperbolicity of large-scale graphs , 2012 .

[20]  Béla Bollobás,et al.  Graph Theory: An Introductory Course , 1980, The Mathematical Gazette.

[21]  A. Rbnyi.  ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .

[22]  Feodor F. Dragan,et al.  Metric tree-like structures in real-life networks: an empirical study , 2014, ArXiv.

[23]  José M. Rodríguez,et al.  Gromov Hyperbolicity in Strong Product Graphs , 2013, Electron. J. Comb..

[24]  Béla Bollobás,et al.  The Diameter of a Scale-Free Random Graph , 2004, Comb..

[25]  Guangda Hu,et al.  On Hyperbolic Geometry Structure of Complex Networks Wenjie Fang Report of M 1 internship in , 2011 .

[26]  M E J Newman.  Assortative mixing in networks. , 2002, Physical review letters.

[27]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[28]  Yilun Shang,et al.  Lack of Gromov-hyperbolicity in small-world networks , 2012 .