[Paper Review] Geometry of Complex Networks and Topological Centrality

Gyan Ranjan, Zhi-Li Zhang|arXiv (Cornell University)|Jul 5, 2011

Complex Network Analysis Techniques29 references4 citations

TL;DR

This paper introduces a geometric approach to network robustness using the Moore-Penrose pseudo-inverse of the graph Laplacian to define topological centrality $\mathcal{C}^*(i) = 1/l^{+}_{ii}$, where $l^{+}_{ii}$ is the squared distance from node $i$ to the origin in an $n$-dimensional embedding. The method links centrality to random walk detour overheads, voltage distributions in electrical networks, and average connectedness under edge failures, demonstrating superior sensitivity to structural perturbations and improved node ranking compared to traditional metrics.

ABSTRACT

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 $(\bb L^+)$. The squared distance of a node $i$ to the origin in this n-dimensional space $(l^+_{ii})$, yields a topological centrality index $(\mathcal{C}^{*}(i) = 1/l^+_{ii})$ for node $i$. In turn, the sum of reciprocals of individual node structural centralities, $\sum_{i}1/\mathcal{C}^*(i) = \sum_{i} l^+_{ii}$, i.e. the trace of $\bb L^+$, yields the well-known Kirchhoff index $(\mathcal{K})$, an overall structural descriptor for the network. In addition to this geometric interpretation, we provide alternative interpretations of the proposed indices to reveal their true topological characteristics: first, in terms of 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 $(\mathcal{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 node $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/rewirings in the network.

Motivation & Objective

• To develop a geometric framework for assessing network robustness beyond traditional graph-theoretic metrics.
• To define a new node centrality measure based on the Moore-Penrose pseudo-inverse of the graph Laplacian.
• To establish topological centrality as a robust indicator of a node’s structural role and resilience to multiple edge failures.
• To demonstrate that the proposed centrality and Kirchhoff index are sensitive to network rewirings and perturbations, outperforming existing metrics.

Proposed method

• Embed the network into an $n$-dimensional Euclidean space using the Moore-Penrose pseudo-inverse of the graph Laplacian $\mathbf{L}^+$.
• Define topological centrality as $\mathcal{C}^*(i) = 1/l^{+}_{ii}$, where $l^{+}_{ii}$ is the diagonal entry of $\mathbf{L}^+$, representing squared distance from node $i$ to the origin.
• Relate $\mathcal{C}^*(i)$ to average detour overhead in random walks forced through node $i$, linking it to global position and connectivity.
• Establish equivalence between $\mathcal{C}^*(i)$ and recurrence probability in random walks, drawing analogy to voltage distributions in equivalent electrical networks.
• Connect $\mathcal{C}^*(i)$ to the average size of the connected component containing $i$ in bi-partitions of the network, reflecting robustness to edge failures.
• Use the trace of $\mathbf{L}^+$, $\sum_i l^{+}_{ii} = \mathcal{K}$, to define the Kirchhoff index as a global structural descriptor of network compactness and robustness.

Experimental results

Research questions

• RQ1 How can the Moore-Penrose pseudo-inverse of the graph Laplacian be used to define a geometric centrality measure that reflects a node’s structural role in complex networks?
• RQ2 What are the physical and probabilistic interpretations of topological centrality in terms of random walk detours and electrical network analogies?
• RQ3 How does topological centrality compare to classical centrality measures in distinguishing nodes by structural role?
• RQ4 To what extent is topological centrality and the Kirchhoff index sensitive to local network perturbations such as edge rewiring?
• RQ5 Can the diagonal of $\mathbf{L}^+$ be computed efficiently, especially in sparse real-world networks?

Key findings

• Topological centrality $\mathcal{C}^*(i) = 1/l^{+}_{ii}$ effectively ranks nodes by their global position and connectedness, distinguishing core, gateway, and peripheral nodes more accurately than degree or betweenness centrality.
• The Kirchhoff index $\mathcal{K} = \sum_i l^{+}_{ii}$ serves as a geometric measure of overall network compactness and robustness, with lower values indicating higher structural resilience.
• Empirical evaluations on synthetic and real-world networks show that $\mathcal{C}^*(i)$ and $\mathcal{K}$ are appropriately sensitive to local perturbations and rewirings, a property not consistently observed in other centrality measures.
• The centrality measure is computationally feasible at $O(n^3)$, comparable to geodesic and subgraph centrality, and can be accelerated via sparse matrix techniques and Monte Carlo approximations.
• For dense graphs, topological centrality can be approximated using only node degrees, as $H_{ij} \approx \text{Vol}(G) \cdot d(i)^{-1}$, implying centrality is largely determined by local connectivity.
• The method establishes a rigorous link between network topology, random walk recurrence, and electrical network theory, providing multiple intuitive interpretations for the same geometric quantity.