Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Attractors of Isospectral Compressions of Networks

Published 31 Mar 2018 in math.DS and cs.DM | (1804.00976v1)

Abstract: In the recently developed theory of isospectral transformations of networks isospectral compressions are performed with respect to some chosen characteristic (attribute) of nodes (or edges) of networks. Each isospectral compression (when a certain characteristic is fixed) defines a dynamical system on the space of all networks. It is shown that any orbit of such dynamical system which starts at any finite network (as the initial point of this orbit) converges to an attractor. Such attractor is a smaller network where a chosen characteristic has the same value for all nodes (or edges). We demonstrate that isospectral contractions of one and the same network defined by different characteristics of nodes (or edges) may converge to the same as well as to different attractors. It is also shown that spectrally equivalent with respect to some characteristic networks could be non-spectrally equivalent for another characteristic of nodes (edges). These results suggest a new constructive approach to analysis of networks structures and to comparison of topologies of different networks.

Authors (2)
Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.