Digraph Laplacian and the degree of asymmetry
From MaRDI portal
Publication:4905093
Recommendations
- Random walks on digraphs, the generalized digraph Laplacian and the degree of asymmetry
- Laplacians and the Cheeger inequality for directed graphs
- Commute times for a directed graph using an asymmetric Laplacian
- The diameter and Laplacian eigenvalues of directed graphs
- Normalized graph Laplacians for directed graphs
Cited in
(20)- Diffusion and consensus on weakly connected directed graphs
- Representation of functions on big data associated with directed graphs
- Random walks on digraphs, the generalized digraph Laplacian and the degree of asymmetry
- Adaptive directional Haar tight framelets on bounded domains for digraph signal representations
- Discrepancy inequalities for directed graphs
- Polynomial-time algorithms for submodular Laplacian systems
- A metric on directed graphs and Markov chains based on hitting probabilities
- Resistance distances in directed graphs: definitions, properties, and applications
- The Moore-Penrose inverse of the normalized graph Laplacian
- Generalized Green's functions for \(m\)th-order discrete nonlocal problems
- Laplacian matrices and Alexandrov topologies of digraphs
- Graph Fourier transform based on singular value decomposition of the directed Laplacian
- scientific article; zbMATH DE number 7800538 (Why is no real title available?)
- Diffusion operator and spectral analysis for directed hypergraph Laplacian
- Voter model on signed social networks
- Laplacians and the Cheeger inequality for directed graphs
- Doubly regular asymmetric digraphs
- A primer on Laplacian dynamics in directed graphs
- Clustering and community detection in directed networks: a survey
- Markov fundamental tensor and its applications to network analysis
This page was built for publication: Digraph Laplacian and the degree of asymmetry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4905093)
