Principal minors of effective-resistance matrices and local resistance radii
Abstract
Let G be a finite connected weighted graph and let R be its effective-resistance matrix. For every nonempty vertex set S, we factor the cofactor sum and determinant of the principal resistance submatrix R[S] into an enumerative term and a boundary potential-theoretic term. If τ(G) is the weighted spanning tree enumerator and κG(S) is the weighted enumerator of S-rooted spanning forests, then \[ R[S]=(-2)|S|-1κG(S)/τ(G). \] After Kron reduction to S, with reduced Laplacian K=LS, Q=K+, and q=(Q), the remaining normalized factor is \[ R[S]/ R[S] =2|S| Q+12 q TKq. \] The cofactor factor is a principal specialization of known resistance-minor identities; the contribution here is the boundary/Kron-reduction factorization and local radius calculus. Equivalently, the normalized factor is the maximum of u TR[S]u over all u∈S satisfying Tu=1. This optimization viewpoint yields monotonicity under enlargement of S, an exact one-point update formula, and a support criterion for equality. Small star examples show that the resulting set function is neither submodular nor supermodular in general.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.