Hermitian normalized Laplacian matrix for directed networks
DOI10.1016/j.ins.2019.04.049zbMath1451.05150OpenAlexW2943547981MaRDI QIDQ2215051
Frank Emmert-Streib, Matthias Dehmer, Guihai Yu, Herbert Jodlbauer
Publication date: 10 December 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2019.04.049
characteristic polynomialdirected networksCourant-Fischer theoremeigenvalue interlacing inequalityHermitian normalized Laplacian matrix
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Normalized graph Laplacians for directed graphs
- Hermitian-adjacency matrices and Hermitian energies of mixed graphs
- Clustering in diffusively coupled networks
- Hermitian Laplacian matrix and positive of mixed graphs
- The diameter and Laplacian eigenvalues of directed graphs
- Hermitian adjacency spectrum and switching equivalence of mixed graphs
- Spectra of digraphs
- Leader-following consensus of multi-agent systems under fixed and switching topologies
- Synchronization in networks of identical linear systems
- Singularity of Hermitian (quasi-)Laplacian matrix of mixed graphs
- Principal minor version of matrix-tree theorem for mixed graphs
- Laplacians and the Cheeger inequality for directed graphs
- Some further development on the eigensystem approach for graph isomorphism detection
- Sarymsakov Matrices and Asynchronous Implementation of Distributed Coordination Algorithms
- Synchronization in discrete-time networks with general pairwise coupling
- Reaching a Consensus in a Dynamically Changing Environment: Convergence Rates, Measurement Delays, and Asynchronous Events
- Synchronization of networks with prescribed degree distributions
- An Interlacing Result on Normalized Laplacians
- Coordination of groups of mobile autonomous agents using nearest neighbor rules
- Consensus seeking in multiagent systems under dynamically changing interaction topologies
This page was built for publication: Hermitian normalized Laplacian matrix for directed networks