An Extension of Foster's Network Theorem
From MaRDI portal
Publication:4314158
DOI10.1017/S0963548300001309zbMath0806.60057MaRDI QIDQ4314158
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
60G50: Sums of independent random variables; random walks
60J20: Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.)
94C99: Circuits, networks
60J27: Continuous-time Markov processes on discrete state spaces
Related Items
Unnamed Item, A New Proof of Foster’s First Theorem, Random walks and the effective resistance sum rules, Sum rules for hitting times of Markov chains, 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, 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
Cites Work
