On Attractors of Isospectral Compressions of Networks

03/31/2018
by   Leonid Bunimovich, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/27/2022

Investigating the Origins of Fractality Based on Two Novel Fractal Network Models

Numerous network models have been investigated to gain insights into the...
research
03/08/2022

The infinity norm bounds and characteristic polynomial for high order RK matrices

This paper shows that t_m ≤𝐀_∞≤√(t_m) holds, when 𝐀∈ℝ^m × m is a Runge-K...
research
06/03/2019

Implication Avoiding Dynamics for Externally Observed Networks

Previous network models have imagined that connections change to promote...
research
09/15/2022

On the Edges of Characteristic Imset Polytopes

The edges of the characteristic imset polytope, CIM_p, were recently sho...
research
03/27/2019

Characteristic-Dependent Linear Rank Inequalities via Complementary Vector Spaces

A characteristic-dependent linear rank inequality is a linear inequality...
research
05/13/2019

Transtemporal edges and crosslayer edges in incompressible high-order networks

This work presents some outcomes of a theoretical investigation of incom...
research
07/31/2022

What Do Deep Neural Networks Find in Disordered Structures of Glasses?

Glass transitions are widely observed in a range of types of soft matter...

Please sign up or login with your details

Forgot password? Click here to reset