An Extension of Foster's Network Theorem

DOI10.1017/S0963548300001309zbMath0806.60057OpenAlexW1968775287MaRDI QIDQ4314158

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

time-reversiblereciprocity theoremergodic Markov chainsreversible Markov chains

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) Circuits, networks (94C99) Continuous-time Markov processes on discrete state spaces (60J27)

Related Items

Unnamed Item ⋮ Random walks and the effective resistance sum rules ⋮ Hitting time quasi-metric and its forest representation ⋮ A note on expected hitting times for birth and death chains ⋮ The discrete Einstein relation ⋮ On resistance distance of Markov chain and its sum rules ⋮ Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs ⋮ Resistance between two vertices of almost complete bipartite graphs ⋮ Sum rules for effective resistances in infinite graphs ⋮ Resistance distances in vertex-weighted complete multipartite graphs ⋮ Sum rules for hitting times of Markov chains ⋮ A New Proof of Foster’s First Theorem ⋮ The combinatorics of effective resistances and resistive inverses ⋮ Improved approximation of the minimum cover time

Cites Work

• Random walks and the effective resistance of networks
• Collisions Among Random Walks on a Graph
• Representation Theory for Denumerable Markov Chains
• Unnamed Item
• Unnamed Item