Network Topology Mapping from Partial Virtual Coordinates and Graph Geodesics [article]

Anura P. Jayasumana and Randy Paffenroth and Sridhar Ramasamy
2018 arXiv   pre-print
For many important network types (e.g., sensor networks in complex harsh environments and social networks) physical coordinate systems (e.g., Cartesian), and physical distances (e.g., Euclidean), are either difficult to discern or inappropriate. Accordingly, Topology Preserving Maps (TPMs) derived from a Virtual-Coordinate (VC) system representing the distance to a small set of anchors is an attractive alternative to physical coordinates for many network algorithms. Herein, we present an
more » ... h, based on the theory of low-rank matrix completion, to recover geometric properties of a network with only partial information about the VCs of nodes. In particular, our approach is a combination of geodesic recovery concepts and low-rank matrix completion, generalized to the case of hop-distances in graphs. Distortion evaluated using the change of distance among node pairs shows that even with up to 40% to 60% of random coordinates missing, accurate TPMs can be obtained. TPM generation can now also be based on different context appropriate VC systems or measurements as long as they characterize each node with distances to a small set of random nodes (instead of a global set of anchors). The proposed method is a significant generalization that allows the topology to be extracted from a random set of graph geodesics, making it applicable in contexts such as social networks where VC generation may not be possible.
arXiv:1712.10063v2 fatcat:wmw2nmkavnhczjr62eed2g3yha