Distributed algorithms to determine eigenvectors of matrices on spatially distributed networks
Distributed, Parallel, and Cluster Computing
2020-11-24 v1 Information Theory
math.IT
Abstract
Eigenvectors of matrices on a network have been used for understanding spectral clustering and influence of a vertex. For matrices with small geodesic-width, we propose a distributed iterative algorithm in this letter to find eigenvectors associated with their given eigenvalues. We also consider the implementation of the proposed algorithm at the vertex/agent level in a spatially distributed network.
Cite
@article{arxiv.2011.11223,
title = {Distributed algorithms to determine eigenvectors of matrices on spatially distributed networks},
author = {Nazar Emirov and Cheng Cheng and Qiyu Sun and Zhihua Qu},
journal= {arXiv preprint arXiv:2011.11223},
year = {2020}
}