Random walks on finitely structured transfinite networks

DOI10.1007/BF00276698MaRDI QIDQ1924460zbMATH OpenFDO

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

Recommendations

• scientific article; zbMATH DE number 1577195
• scientific article; zbMATH DE number 833370
• Walk-based transfinite graphs and networks
• scientific article; zbMATH DE number 640775

Cites work

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

Cited in

(10)

• Eigentime identities for random walks on a family of treelike networks and polymer networks
• Random walks on generalized Loch networks
• scientific article; zbMATH DE number 833370 (Why is no real title available?)
• 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
• scientific article; zbMATH DE number 39368 (Why is no real title available?)
• Walk-based transfinite graphs and networks
• Recurrent networks and a theorem of Nash-Williams

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

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