Geometry of complex networks and topological centrality

We explore the geometry of complex networks in terms of an n-dimensional Euclidean embedding represented by the Moore–Penrose pseudo-inverse of the graph Laplacian (L+). The squared distance of a node i to the origin in this n-dimensional space (lii+), yields a topological centrality index, defined as C∗(i)=1/lii+. In turn, the sum of reciprocals of individual node centralities, ∑i1/C∗(i)=∑ilii+, or the trace of L+, yields the well-known Kirchhoff index (K), an overall structural descriptor for the network. To put into context this geometric definition of centrality, we provide alternative interpretations of the proposed indices that connect them to meaningful topological characteristics — first, as forced detour overheads and frequency of recurrences in random walks that has an interesting analogy to voltage distributions in the equivalent electrical network; and then as the average connectedness of i in all the bi-partitions of the graph. These interpretations respectively help establish the topological centrality (C∗(i)) of node i as a measure of its overall position as well as its overall connectedness in the network; thus reflecting the robustness of i to random multiple edge failures. Through empirical evaluations using synthetic and real world networks, we demonstrate how the topological centrality is better able to distinguish nodes in terms of their structural roles in the network and, along with Kirchhoff index, is appropriately sensitive to perturbations/re-wirings in the network.