Pith. sign in

REVIEW

Distributed algorithms to determine eigenvectors of matrices on spatially distributed networks

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2011.11223 v1 pith:ZULJMXZO submitted 2020-11-23 cs.DC cs.ITmath.IT

Nazar Emirov , Cheng Cheng , Qiyu Sun , Zhihua Qu This is my paper · ORCID
classification cs.DCcs.ITmath.IT
keywords distributedeigenvectorsmatricesalgorithmnetworkspatiallyvertexagent
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Pith tools