Effective resistance is more than distance: Laplacians, simplices and the Schur complement

DOI10.1016/J.LAA.2022.01.002zbMATH Open1482.05083arXiv2010.04521OpenAlexW3092066601MaRDI QIDQ2074965FDOQ2074965

Authors: Karel Devriendt 

Publication date: 11 February 2022

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: This article discusses a geometric perspective on the well-known fact in graph theory that the effective resistance is a metric on the nodes of a graph. The classical proofs of this fact make use of ideas from electrical circuits or random walks; here we describe an alternative approach which combines geometric (using simplices) and algebraic (using the Schur complement) ideas. These perspectives are unified in a matrix identity of Miroslav Fiedler, which beautifully summarizes a number of related ideas at the intersection of graphs, Laplacian matrices and simplices, with the metric property of the effective resistance as a prominent consequence.

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

Recommendations

• Resistance distance and the normalized Laplacian spectrum
• Some results on resistance distances and resistance matrices
• Simplicial networks and effective resistance
• A Hilbert space approach to effective resistance metric
• The combinatorics of effective resistances and resistive inverses
• A characterization of effective resistance metrics
• Some results on the resistance-distance spectrum
• scientific article; zbMATH DE number 2121257
• Recursive calculation of effective resistances in distance-regular networks based on Bose-Mesner algebra and Christoffel-Darboux identity

zbMATH Keywords

simplexLaplacianSchur complementeffective resistance

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Distance geometry (51K99) Polytopes and polyhedra (52B99)

Cites Work

• The Schur complement and its applications
• Random walks on graphs
• Matrices and graphs in geometry
• Note on the Generalized Inverse of a Matrix Product
• Distance matrix polynomials of trees
• Laplacian matrices of graphs: A survey
• Planar electric networks. II
• Some results on resistance distances and resistance matrices
• Spectral sparsification of graphs
• The curl of a weighted network
• Title not available (Why is that?)
• Title not available (Why is that?)
• Circular planar graphs and resistor networks
• Some characterizations of symmetric inverse \(M\)-matrices
• Algebraic Potential Theory on Graphs
• Title not available (Why is that?)
• An Identity for the Schur Complement of a Matrix
• Metric and ultrametric spaces of resistances
• On a conjecture concerning spanning tree invariants and loop systems
• Kron Reduction of Graphs With Applications to Electrical Networks
• Title not available (Why is that?)
• The magnitude of metric spaces
• The electrical resistance of a graph captures its commute and cover times
• Title not available (Why is that?)
• Minimizing Effective Resistance of a Graph
• Effective graph resistance
• A Compositional Framework for Passive Linear Networks
• Basic Category Theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Toward a spectral theory of cellular sheaves
• Hodge Laplacians on graphs
• The simplex geometry of graphs

Cited In (14)

• Total positivity in multivariate extremes
• Effective graph resistance
• Metric and ultrametric spaces of resistances
• Resistance distances on networks
• Resistance distance and the normalized Laplacian spectrum
• Shift operators from the simplex representation in momentum-space CFT
• Variance and covariance of distributions on graphs
• Simplicial networks and effective resistance
• Algorithmic techniques for finding resistance distances on structured graphs
• Title not available (Why is that?)
• Minimal hexagonal chains with respect to the Kirchhoff index
• Metric graphs, cross ratios, and Rayleigh's laws
• Effective resistance on graphs and the epidemic quasimetric
• Every nonsingular spherical Euclidean distance matrix is a resistance distance matrix

This page was built for publication: Effective resistance is more than distance: Laplacians, simplices and the Schur complement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2074965)