3 research outputs found
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
complex 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 effects of
external stresses on the spatial efficiency of a network as well as to design
strategies to improve important parameters in real-world complex systems.Comment: Revised. 27 pages, 14 figure
Hyperspherical embedding of graphs and networks in communicability spaces
Let GG be a simple connected graph with nn nodes and let fαk(A)fαk(A) be a communicability function of the adjacency matrix AA, which is expressible by the following Taylor series expansion: ∑k=0∞αkAk. We prove here that if fαk(A)fαk(A) is positive semidefinite then the function ηp,q=(fαk(A)pp+fαk(A)qq−2fαk(A)pq)12 is a Euclidean distance between the corresponding nodes of the graph. Then, we prove that if fαk(A)fαk(A) is positive definite, the communicability distance induces an embedding of the graph into a hyperdimensional sphere (hypersphere) such as the distances between the nodes are given by ηp,qηp,q. In addition we give analytic results for the communicability distances for the nodes in paths, cycles, stars and complete graphs, and we find functions of the adjacency matrix for which the main results obtained here are applicable. Finally, we study the ratio of the surface area to volume of the hyperspheres in which a few real-world networks are embedded. We give clear indications about the usefulness of this embedding in analyzing the efficacy of geometrical embeddings of real-world networks like brain networks, airport transportation networks and the Internet