Communicability Angle and the Spatial Efficiency of Networks

We introduce the concept of communicability angle between a pair of nodes in a graph. We provide strong analytical and empirical evidence that the average communicability angle for a given network accounts for its spatial efficiency on the basis of the communications among the nodes in a network. We determine characteristics of the spatial efficiency of more than a hundred real-world networks that represent complex systems arising in a diverse set of scenarios. In particular, we find that the communicability angle correlates very well with the experimentally measured value of the relative packing efficiency of proteins that are represented as residue networks. We finally show how we can modulate the spatial efficiency of a network by tuning the weights of the edges of the networks. This allows us to predict the effects of external stresses on the spatial efficiency of a network as well as to design strategies to improve important parameters in real-world systems.

[1]  Tony White,et al.  The Structure of Complex Networks , 2011 .

[2]  Marc Barthelemy,et al.  Spatial Networks , 2010, Encyclopedia of Social Network Analysis and Mining.

[3]  Daniel A. Spielman.  Graphs and networks , 2007 .

[4]  A. Atilgan,et al.  Small-world communication of residues and significance for protein dynamics. , 2003, Biophysical journal.

[5]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[6]  Elmar Teufl,et al.  The number of spanning trees of finite Sierpi´ nski graphs , 2006 .

[7]  Christophe Claramunt,et al.  Topological Analysis of Urban Street Networks , 2004 .

[8]  Alexander Lubotzky,et al.  Expander graphs in pure and applied mathematics , 2011, 1105.2389.

[9]  Massimo Marchiori,et al.  Economic small-world behavior in weighted networks , 2003 .

[10]  Kinkar Chandra Das,et al.  On Harary index of graphs , 2011, Discret. Appl. Math..

[11]  V. Latora,et al.  Structural properties of planar graphs of urban street patterns. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[13]  Ulrike von Luxburg,et al.  Getting lost in space: Large sample analysis of the resistance distance , 2010, NIPS.

[14]  Ernesto Estrada,et al.  Statistical-mechanical approach to subgraph centrality in complex networks , 2007, 0905.4098.

[15]  R. Osserman.  The isoperimetric inequality , 1978 .

[16]  T. N. Bhat,et al.  The Protein Data Bank , 2000, Nucleic Acids Res..

[17]  David S. Wishart,et al.  VADAR: a web server for quantitative evaluation of protein structure quality , 2003, Nucleic Acids Res..

[18]  Desmond J. Higham,et al.  Network Properties Revealed through Matrix Functions , 2010, SIAM Rev..

[19]  Ernesto Estrada.  The communicability distance in graphs , 2012 .

[20]  Edward T. Bullmore,et al.  Efficiency and Cost of Economical Brain Functional Networks , 2007, PLoS Comput. Biol..

[21]  Gábor Szabó,et al.  Structure of complex networks , 2005 .

[22]  M. Randic,et al.  Resistance distance , 1993 .

[23]  Lucas Antiqueira,et al.  Analyzing and modeling real-world phenomena with complex networks: a survey of applications , 2007, 0711.3199.

[24]  Stephen P. Boyd,et al.  Minimizing Effective Resistance of a Graph , 2008, SIAM Rev..

[25]  I. Anderson,et al.  Graphs and Networks , 1981, The Mathematical Gazette.

[26]  V Latora,et al.  Efficient behavior of small-world networks. , 2001, Physical review letters.

[27]  N. Alon,et al.  il , , lsoperimetric Inequalities for Graphs , and Superconcentrators , 1985 .

[28]  W. Marsden.  I and J , 2012 .

[29]  Ernesto Estrada,et al.  Hyperspherical embedding of graphs and networks in communicability spaces , 2014, Discret. Appl. Math..

[30]  Michele Benzi,et al.  The Physics of Communicability in Complex Networks , 2011, ArXiv.

[31]  Richard F. Betzel,et al.  Exploring the Morphospace of Communication Efficiency in Complex Networks , 2013, PloS one.

[32]  F M Richards,et al.  Protein packing: dependence on protein size, secondary structure and amino acid composition. , 2000, Journal of molecular biology.

[33]  Ernesto Estrada,et al.  Communicability in complex networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[34]  N. J. A. Sloane,et al.  Penny-packing and two-dimensional codes , 1990, Discret. Comput. Geom..

[35]  Walter Schnyder,et al.  Embedding planar graphs on the grid , 1990, SODA '90.

[36]  N. Trinajstic,et al.  On the Harary index for the characterization of chemical graphs , 1993 .

[37]  J. A. Rodríguez-Velázquez,et al.  Subgraph centrality in complex networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[38]  B. Mohar.  Isoperimetric inequalities, growth, and the spectrum of graphs , 1988 .

[39]  P. Sarnak.  What is . . . An expander , 2004 .

[40]  O. Sporns,et al.  Complex brain networks: graph theoretical analysis of structural and functional systems , 2009, Nature Reviews Neuroscience.

[41]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[42]  Ernesto Estrada,et al.  The Structure of Complex Networks: Theory and Applications , 2011 .

[43]  Ernesto Estrada,et al.  Characterization of the folding degree of proteins , 2002, Bioinform..

[44]  Bo Zhou,et al.  On Harary index , 2008 .

[45]  Ernesto Estrada.  Complex networks in the Euclidean space of communicability distances. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[46]  Christopher R. Myers,et al.  Software systems as complex networks: structure, function, and evolvability of software collaboration graphs , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[47]  I. Gutman,et al.  Resistance distance and Laplacian spectrum , 2003 .

[48]  Jonathan L. Gross,et al.  Topological Graph Theory , 1987, Handbook of Graph Theory.