Kron Reduction and Effective Resistance of Directed Graphs

DOI10.1137/22M1480823MaRDI QIDQ5885814

Unnamed Author, Kazuhiro Sato

Publication date: 30 March 2023

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

directed graphalgebraic graph theoryeffective resistanceKron reduction

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20) Linear equations (linear algebraic aspects) (15A06)

Related Items (1)

Pseudoinverses of Signed Laplacian Matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph clustering
• The electrical resistance of a graph captures its commute and cover times
• On resistance distance of Markov chain and its sum rules
• Distributed algorithms for reaching consensus on general functions
• Potential theory for Schrödinger operators on finite networks
• On the matrix equation \(Ax =\lambda Bx\)
• A New Notion of Effective Resistance for Directed Graphs—Part I: Definition and Properties
• Effective Resistance Preserving Directed Graph Symmetrization
• A Metric on Directed Graphs and Markov Chains Based on Hitting Probabilities
• Kron Reduction of Graphs With Applications to Electrical Networks
• Graph-Theoretical Matrices in Chemistry
• Controllability Metrics, Limitations and Algorithms for Complex Networks
• Minimizing Effective Resistance of a Graph

This page was built for publication: Kron Reduction and Effective Resistance of Directed Graphs