Effective Resistance Preserving Directed Graph Symmetrization
From MaRDI portal
Publication:4615300
DOI10.1137/18M1172892zbMath1406.05029arXiv1802.09829OpenAlexW2908815208MaRDI QIDQ4615300
Publication date: 4 February 2019
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.09829
Lyapunov equationgraph partitioningspectral graph theoryeffective resistancedirected graph analysisgraph symmetrizationkron reduction
Lyapunov and other classical stabilities (Lagrange, Poisson, (L^p, l^p), etc.) in control theory (93D05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)
Related Items
Kron Reduction and Effective Resistance of Directed Graphs, Pseudoinverses of Signed Laplacian Matrices, Hubs-biased resistance distances on graphs and networks, A Metric on Directed Graphs and Markov Chains Based on Hitting Probabilities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The communicability distance in graphs
- Graph clustering
- Clustering and community detection in directed networks: a survey
- A class of graph-geodetic distances generalizing the shortest-path and the resistance distances
- Detection of structurally homogeneous subsets in graphs
- Random walks and the effective resistance of networks
- The electrical resistance of a graph captures its commute and cover times
- On the spectra of nonsymmetric Laplacian matrices
- Laplacians and the Cheeger inequality for directed graphs
- Spectral bisection of graphs and connectedness
- Analysis and synthesis of stability matrices
- A New Notion of Effective Resistance for Directed Graphs—Part I: Definition and Properties
- A New Notion of Effective Resistance for Directed Graphs—Part II: Computing Resistances
- On the Quality of Spectral Separators
- A Multiscale Pyramid Transform for Graph Signals
- Kron Reduction of Graphs With Applications to Electrical Networks
- Minimizing Effective Resistance of a Graph
- Machine Learning: ECML 2004
- Structural, Syntactic, and Statistical Pattern Recognition
- Expander flows, geometric embeddings and graph partitioning
- Graph Sparsification by Effective Resistances