Isospectral Graph Transformations, Spectral Equivalence, and Global Stability of Dynamical Networks

Details Isospectral Graph Transformations, Spectral Equivalence, and Global Stability of Dynamical Networks Isospectral Graph Transformations, Spectral Equivalence, and Global Stability of Dynamical Networks

2010-10-15

arxiv.org/abs/1010.3272v2

Mathematics

Dynamical Systems

Contains extensions of some results from the previous Arxiv submission "Isospectral Graph Reductions"

Scientific paper

In this paper we present a general procedure that allows for the reduction or expansion of any network (considered as a weighted graph). This procedure maintains the spectrum of the network's adjacency matrix up to a set of eigenvalues known beforehand from its graph structure. This procedure can be used to establish new equivalence relations on the class of all weighted graphs (networks) where two graphs are equivalent if they can be reduced to the same graph. Additionally, dynamical networks (or any finite dimensional, discrete time dynamical system) can be analyzed using isospectral transformations. By so doing we obtain stronger results regarding the global stability (strong synchronization) of dynamical networks when compared to other standard methods.

Affiliated with

Also associated with

No associations

Rating

Isospectral Graph Transformations, Spectral Equivalence, and Global Stability of Dynamical Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Isospectral Graph Transformations, Spectral Equivalence, and Global Stability of Dynamical Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Isospectral Graph Transformations, Spectral Equivalence, and Global Stability of Dynamical Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-181443