Random walks and the effective resistance sum rules

DOI10.1016/j.dam.2010.05.020zbMath1208.05136OpenAlexW2083951382MaRDI QIDQ602687

Hai-Yan Chen

Publication date: 5 November 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.05.020

zbMATH Keywords

random walkhitting timeeffective resistancesubdivision network

Mathematics Subject Classification ID

Random walks on graphs (05C81)

Related Items

Two-point resistances and random walks on stellated regular graphs, Resistance distances and Kirchhoff index of graphs with an involution, Two-point resistances in a family of self-similar \((x, y)\)-flower networks, Algorithmic techniques for finding resistance distances on structured graphs, Resistance characterizations of equiarboreal graphs, Resistance between two nodes of a ring clique network, Modeling spatial networks by contact graphs of disk packings, Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs, On sum of powers of normalized Laplacian eigenvalues and resistance distances of graphs, Complete characterization of resistance distance for linear octagonal networks, The Kirchhoff index of subdivisions of graphs, Resistance distance-based graph invariants of subdivisions and triangulations of graphs, Effective resistances and spanning trees in the complete bipartite graph plus a matching, Hitting times for random walks on subdivision and triangulation graphs, Resistance distances in vertex-weighted complete multipartite graphs, Resistance distance in subdivision-vertex join and subdivision-edge join of graphs, Green's function in partial subdivision networks, A New Proof of Foster’s First Theorem, Resistance distance in potting networks, Resistance distance and Kirchhoff index of \(R\)-vertex join and \(R\)-edge join of two graphs, Group inverse matrix of the normalized Laplacian on subdivision networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Resistance distance local rules
• Random walks and the effective resistance of networks
• Resistance distance and the normalized Laplacian spectrum
• Bounds on the cover time
• Random walks on weighted graphs and applications to on-line algorithms
• Theory of resistor networks: the two-point resistance
• An Extension of Foster's Network Theorem
• Markov Chains
• Metric and ultrametric spaces of resistances