pith. sign in

arxiv: 1412.7130 · v2 · pith:E2DLYGFQnew · submitted 2014-12-22 · 🧮 math.DS

Eigenvectors of isospectral graph transformations

classification 🧮 math.DS
keywords grapheigenvectorsisospectralreductiontheoryalgorithmapplicationassociated
0
0 comments X
read the original abstract

L.A. Bunimovich and B.Z. Webb developed a theory for isospectral graph reduction. We make a simple observation regarding the relation between eigenvectors of the original graph and its reduction, that sheds new light on this theory. As an application we propose an updating algorithm for the maximal eigenvector of the Markov matrix associated to a large sparse dynamical network.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.