Kernels of directed graph Laplacians
Summary: Let \(G\) denote a directed graph with adjacency matrix \(Q\) and in-degree matrix \(D\). We consider the Kirchhoff matrix \(L=D-Q\), sometimes referred to as the directed Laplacian. A classical result of Kirchhoff asserts that when \(G\) is undirected, the multiplicity of the eigenvalue 0 equals the number of connected components of \(G\). This fact has a meaningful generalization to directed graphs, as was recently observed by Chebotarev and Agaev in 2005. Since this result has many important applications in the sciences, we offer an independent and self-contained proof of their theorem, showing in this paper that the algebraic and geometric multiplicities of 0 are equal, and that a graph-theoretic property determines the dimension of this eigenspace -- namely, the number of reaches of the directed graph. We also extend their results by deriving a natural basis for the corresponding eigenspace. The results are proved in the general context of stochastic matrices, and apply equally well to directed graphs with non-negative edge weights.
- Recent problems and results about kernels in directed graphs
- scientific article; zbMATH DE number 4095496
- Graph kernels
- Graph kernels
- scientific article; zbMATH DE number 579329
- Normalized graph Laplacians for directed graphs
- On the existence of kernels and h-kernels in directed graphs
- On the existence of (k,k-1)-kernels in directed graphs
- Orientations of graphs in kernel theory
- Graph kernels: a survey
- Dominant vertices in regulatory networks dynamics
- Coordination in multiagent systems and Laplacian spectra of digraphs
- On the spectra of certain directed paths
- Further results on digraphs with completely real Laplacian spectra
- Consensus of noisy multiagent systems with Markovian switching topologies and time-varying delays
- On multi-consensus and almost equitable graph partitions
- Hybrid consensus for multi-agent systems with time-driven jumps
- Cluster partitioning of heterogeneous multi-agent systems
- Equilibria and control of metabolic networks with enhancers and inhibitors
- Diffusion and consensus on weakly connected directed graphs
- Stability of metabolic networks via linear-in-flux-expressions
- On eigenvalues of Laplacian matrix for a class of directed signed graphs
- Topology-induced containment for general linear systems on weakly connected digraphs
- A Mixed Weisfeiler-Lehman Graph Kernel
- DIRECTED GRAPHS AND KRONECKER INVARIANTS OF PAIRS OF MATRICES
- Sliding mode cooperative control for multirobot systems: a finite-time approach
- Finite-time coordination in multiagent systems using sliding mode control approach
- Radon transforms, laplacaians, and flows for directed graphs
- Kernels on Graphs as Proximity Measures
- Three conjectures of Ostrander on digraph Laplacian eigenvectors
- A new distributed protocol for consensus of discrete-time systems
- Topological approach and analysis of clustering in consensus networks
- Multi‐consensus recovery of multi‐agent system with cyber‐attack based on topology reconstruction controller
- Geometric and spectral analysis on weighted digraphs
- Consensus and multi-consensus for discrete-time LTI systems
- Multi-consensus problems in hybrid multi-agent systems
- Metapopulation models with anti-symmetric Lotka–Volterra systems
- The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization
- Equivalent conditions for the synchronization of identical linear systems over arbitrary interconnections
- A distributed influence measurement algorithm in leader-follower networks
- Which digraphs with ring structure are essentially cyclic?
This page was built for publication: Kernels of directed graph Laplacians
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500958)
