Dimension reduction of dynamical systems on networks with leading and non-leading eigenvectors of adjacency matrices

Abstract

Dimension reduction techniques for dynamical systems on networks are considered to promote our understanding of the original high-dimensional dynamics. One strategy of dimension reduction is to derive a low-dimensional dynamical system whose behavior approximates the observables of the original dynamical system that are weighted linear summations of the state variables at the different nodes. Recently proposed methods use the leading eigenvector of the adjacency matrix of the network as the mixture weights to obtain such observables. In the present study, we explore performances of this type of one-dimensional reductions of dynamical systems on networks when we use non-leading eigenvectors of the adjacency matrix as the mixture weights. Our theory predicts that non-leading eigenvectors can be more efficient than the leading eigenvector and enables us to select the eigenvector minimizing the error. We numerically verify that the optimal non-leading eigenvector outperforms the leading eigenvector for some dynamical systems and networks. We also argue that, despite our theory, it is practically better to use the leading eigenvector as the mixture weights to avoid misplacing the bifurcation point too distantly and to be resistant against dynamical noise.

arXiv comment7 figures

References in corpus (19)

• Finding community structure in networks using the eigenvectors of matrices
• Epidemic processes in complex networks
• Synchronization in complex networks
• Stability Criteria for Complex Ecosystems
• Growing Scale-Free Networks with Tunable Clustering
• Reaction-diffusion processes and metapopulation models in heterogeneous networks
• Spontaneous synchrony in power-grid networks
• Localization and Spreading of Diseases in Complex Networks
• Localization and centrality in networks
• Distinct types of eigenvector localization in networks
• Emergence of cascading dynamics in interacting tipping elements of ecology and climate
• Dynamics of Tipping Cascades on Complex Networks
• Eigenvector localization in real networks and its implications for epidemic spreading
• Coupled catastrophes: sudden shifts cascade and hop among interdependent systems
• Spectral dimension reduction of complex dynamical networks
• Collapse of Resilience Patterns in Generalized Lotka-Volterra Dynamics and Beyond
• How motifs condition critical thresholds for tipping cascades in complex networks: Linking Micro- to Macro-scales
• Accuracy of a one-dimensional reduction of dynamical systems on networks
• Threefold way to the dimension reduction of dynamics on networks: an application to synchronization

Cited by in corpus (2)

• Mean-field theory for double-well systems on degree-heterogeneous networks
• Observing network dynamics through sentinel nodes