Kron Reduction of Graphs with Applications to Electrical Networks
Florian Dorfler, Francesco Bullo

TL;DR
This paper introduces a comprehensive graph-theoretic framework for Kron reduction, providing new insights and analysis applicable to electrical networks and various engineering problems, with a focus on practical applications.
Contribution
It develops a general framework for Kron reduction that offers novel mathematical and physical insights, along with detailed analyses relevant to engineering and computational applications.
Findings
Unified graph-theoretic perspective on Kron reduction
Deep topological, algebraic, and spectral analysis of the process
Applicability to practical engineering problems and computation
Abstract
Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements corresponding to the self-loops. The Kron reduction of this graph is again a graph whose Laplacian matrix is obtained by the Schur complement of the original Laplacian matrix with respect to a subset of nodes. The Kron reduction process is ubiquitous in classic circuit theory and in related disciplines such as electrical impedance tomography, smart grid monitoring, transient stability assessment in power networks, or analysis and simulation of induction motors and power electronics. More general applications of Kron reduction occur in sparse matrix algorithms, multi-grid solvers, finite--element analysis, and Markov chains. The Schur complement of a Laplacian matrix and related concepts have also been studied under different…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
