Random walks on finitely structured transfinite networks

DOI10.1007/BF00276698zbMath0858.60062MaRDI QIDQ1924460

Armen H. Zemanian

Publication date: 23 March 1997

Published in: Potential Analysis (Search for Journal in Brave)

zbMATH Keywords

Markov chainsrandom walkstransfinite graphstransfinite networksNash-Williams rule

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Analytic circuit theory (94C05) Graph theory (05C99)

Related Items (4)

Frames and factorization of graph Laplacians ⋮ A maximum principle for node voltages in finitely structured, transfinite, electrical networks ⋮ Random walks on finitely structured transfinite networks ⋮ Shortest paths in distance-regular graphs

Cites Work

• Connectedness in transfinite graphs and the existence and uniqueness of node voltages
• Random walks on finitely structured transfinite networks
• Charakterisierung der Graphen ohne unendliche Wege
• Transfinite Graphs and Electrical Networks
• Über die Maximalzahl fremder unendlicher Wege in Graphen

This page was built for publication: Random walks on finitely structured transfinite networks