A Geometric Approach to Robustness in Complex Networks

@article{Ranjan2011AGA,
  title={A Geometric Approach to Robustness in Complex Networks},
  author={Gyan Ranjan and Zhi-Li Zhang},
  journal={2011 31st International Conference on Distributed Computing Systems Workshops},
  year={2011},
  pages={146-153}
}
We explore the geometry of networks in terms of an n-dimensional Euclidean embedding represented by the Moore-Penrose pseudo-inverse of the graph Laplacian (L+). The reciprocal of squared distance from each node i to the origin in this n-dimensional space yields a structural centrality index (C*(i)) for the node, while the harmonic sum of individual node… CONTINUE READING