Spectral complexity of directed graphs and application to structural decomposition

DOI10.1155/2019/9610826zbMath1417.05121arXiv1808.06004OpenAlexW2887083922MaRDI QIDQ2424711

Vladimir A. Fonoberov, Tuhin Sahai, Igor Mezić, Maria A. Fonoberova

Publication date: 25 June 2019

Published in: Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.06004

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Koopman operator approach for computing structure of solutions and observability of nonlinear dynamical systems over finite fields ⋮ Taxicab geometry in table of higher-order elements ⋮ Koopman Resolvent: A Laplace-Domain Analysis of Nonlinear Autonomous Dynamical Systems

Uses Software

• SNAP
• GVF
• GenLouvain

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hearing the clusters of a graph: A distributed algorithm
• Graph clustering
• A history of graph entropy measures
• An efficient algorithm for the parallel solution of high-dimensional differential equations
• Spectra of digraphs
• Role models for complex networks
• Laplacians and the Cheeger inequality for directed graphs
• Comparison of systems with complex behavior
• Entanglement and the complexity of directed graphs
• Circular law theorem for random Markov matrices
• Uncertainty propagation in dynamical systems
• Applied Koopmanism
• Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
• Spectral clustering algorithms for the detection of clusters in block-cyclic and block-acyclic graphs
• A SPECTRAL METHOD FOR AGGREGATING VARIABLES IN LINEAR DYNAMICAL SYSTEMS WITH APPLICATION TO CELLULAR AUTOMATA RENORMALIZATION
• A Complexity Measure
• Hamiltonian Systems and Transformation in Hilbert Space
• Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs
• A spectral assignment approach for the graph isomorphism problem
• A decentralized algorithm for spectral analysis

This page was built for publication: Spectral complexity of directed graphs and application to structural decomposition