The combinatorics of effective resistances and resistive inverses

DOI10.1006/inco.1998.2716zbMath0936.68057OpenAlexW2045429806MaRDI QIDQ1281506

Stephen J. Ponzio

Publication date: 18 May 2000

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/95d7316fab11651eb09596c99c908147241707b3

zbMATH Keywords

random walkeffective resistancesresistive inverse

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random walks and the effective resistance of networks
• Matrix tree theorems
• On the k-server conjecture
• Random walks on weighted graphs and applications to on-line algorithms
• An Algebraic Proof of Kirchhoff's Network Theorem
• Competitive algorithms for server problems
• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• An Extension of Foster's Network Theorem
• On the Algebra of Networks

This page was built for publication: The combinatorics of effective resistances and resistive inverses