An Extension of Foster's Network Theorem

DOI10.1017/S0963548300001309MaRDI QIDQ4314158zbMATH OpenOpenAlexFDO

Authors Prasad Tetali

Publication date 14 February 1995

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548300001309

zbMATH Keywords

ergodic Markov chainsreciprocity theoremreversible Markov chainstime-reversible

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Continuous-time Markov processes on discrete state spaces (60J27) Circuits, networks (94C99)

Recommendations

• A new proof of Foster's first theorem
• Resistance networks, random walks, and network theorems
• Random walks and the effective resistance of networks
• Random walks and the effective resistance sum rules
• scientific article; zbMATH DE number 39368

Cites work

• Collisions Among Random Walks on a Graph
• scientific article; zbMATH DE number 3854137 (Why is no real title available?)
• scientific article; zbMATH DE number 3934150 (Why is no real title available?)
• Random walks and the effective resistance of networks
• Representation Theory for Denumerable Markov Chains

Cited in

(16)

• A note on expected hitting times for birth and death chains
• The combinatorics of effective resistances and resistive inverses
• The discrete Einstein relation
• Resistance between two vertices of almost complete bipartite graphs
• Extension of Foster's averaging formula to infinite networks with moderate growth
• Hitting time quasi-metric and its forest representation
• Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs
• Resistance distances in vertex-weighted complete multipartite graphs
• On resistance distance of Markov chain and its sum rules
• Improved approximation of the minimum cover time
• Sum rules for effective resistances in infinite graphs
• scientific article; zbMATH DE number 1416163 (Why is no real title available?)
• A new proof of Foster's first theorem
• Random walks and the effective resistance sum rules
• Recurrent networks and a theorem of Nash-Williams
• Sum rules for hitting times of Markov chains

This page was built for publication: An Extension of Foster's Network Theorem

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