Search arXivSearch

arXiv · 2603.29675

Generalized Resistance Geometry from Kron Reduction and Effective Resistance

Abstract

We develop a generalized resistance geometry for unsigned directed graphs and signed undirected graphs based on Kron reduction and effective resistance. For unsigned strongly connected weight-balanced directed graphs, we establish a generalized Fiedler--Bapat identity involving an associated signed undirected Laplacian constructed from the symmetrized pseudoinverse. We identify this Laplacian as the sum of the symmetrized directed Laplacian and a positive-semidefinite correction induced by graph asymmetry. This decomposition yields an effective-resistance comparison that extends a previous normality-based result, and we prove that the construction commutes with Kron reduction. For general unsigned strongly connected directed graphs satisfying a positivity condition, we define resistance curvature and resistance radius through a weight-balanced representation. Motivated by the associated signed undirected graphs, we introduce a class whose effective resistances form a metric and show that the resulting resistance matrices are precisely the strict negative type metric matrices. Within this framework, we characterize the unique solution of the maximum graph-variance problem and develop generalized resistive embeddings into Euclidean space.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yosuke Kajiura, Kazuhiro Sato. 2026-08-07. Generalized Resistance Geometry from Kron Reduction and Effective Resistance. https://arxiv.org/abs/2603.29675

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Factorisability of Low Dimensional Non-Negative Integer Matrices

We consider the problem of determining if a given two-dimensional nonnegative integer matrix $M$ is the product of two such matrices, excluding trivial units. A matrix $M$ with no such factorisation is called prime and therefore belongs to the minimal (infinite rank) generator of $2 \times 2$ matrices over the natural numbers, otherwise it is called composite. We also consider the problem of finding a (non-unique) factorisation of a composite matrix. Our results have applications in computational group theory and the theory of codes, where such matrices are called incidence matrices. We analyse the complexity of primality and finding a factorisation for a composite matrix, providing a first efficient algorithm.

cs.DM

Three Hardness Results for Graph Similarity Problems

Notions of graph similarity provide alternative perspective on the graph isomorphism problem and vice-versa. In this paper, we consider measures of similarity arising from mismatch norms as studied in Gervens and Grohe: the edit distance $δ_{\mathcal{E}}$, and the metrics arising from $\ell_p$-operator norms, which we denote by $δ_p$ and $δ_{|p|}$. We address the following question: can these measures of similarity be used to design polynomial-time approximation algorithms for graph isomorphism? We show that computing an optimal value of $δ_{\mathcal{E}}$ is \NP-hard on pairs of graphs with the same number of edges. In addition, we show that computing optimal values of $δ_p$ and $δ_{|p|}$ is \NP-hard even on pairs of $1$-planar graphs with the same degree sequence and bounded degree. These two results improve on previous known ones, which did not examine the restricted case where the pairs of graphs are required to have the same number of edges. Finally, we study similarity problems on strongly regular graphs and prove some near optimal inequalities with interesting consequences on the computational complexity of graph and group isomorphism.

cs.DM