Random walks and the effective resistance sum rules

DOI10.1016/J.DAM.2010.05.020zbMATH Open1208.05136OpenAlexW2083951382MaRDI QIDQ602687FDOQ602687

Haiyan 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)

Cites Work

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

Cited In (26)

• Resistance distances in vertex-weighted complete multipartite graphs
• Complete characterization of resistance distance for linear octagonal networks
• Resistance distance-based graph invariants of subdivisions and triangulations of graphs
• Resistance distance in potting networks
• Modeling spatial networks by contact graphs of disk packings
• Two-point resistances and random walks on stellated regular graphs
• Resistance between two nodes of a ring clique network
• Title not available (Why is that?)
• On sum of powers of normalized Laplacian eigenvalues and resistance distances of graphs
• A New Proof of Foster’s First Theorem
• Resistance distance in subdivision-vertex join and subdivision-edge join of graphs
• Resistance distances and Kirchhoff index of graphs with an involution
• 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
• Resistance characterizations of equiarboreal graphs
• The Kirchhoff index of subdivisions of graphs
• Resistance distances and the Moon-type formula of a vertex-weighted complete split graph
• Algorithmic techniques for finding resistance distances on structured graphs
• Effective resistances and spanning trees in the complete bipartite graph plus a matching
• Resistance distance and Kirchhoff index of two kinds of double join operations on graphs
• Two-point resistances in a family of self-similar \((x, y)\)-flower networks
• Hitting times for random walks on subdivision and triangulation graphs
• Resistance distances in stretched Cantor product networks
• On resistance distance of Markov chain and its sum rules
• Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
• Green's function in partial subdivision networks

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Random walks and the effective resistance of networks 👍 👎
• Electrical resistance of the low dimensional critical branching random walk 👍 👎
• Speed of random walk and resistance 👍 👎
• Stochastic random walk summability 👍 👎
• Random-walk model for equilibrium resistance fluctuations 👍 👎
• On resistance distance of Markov chain and its sum rules 👍 👎
• A new finite-size scaling approach to random walks 👍 👎

This page was built for publication: Random walks and the effective resistance sum rules

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