Representation of denumerable Markov chains with multiple states by weighted circuits
Keyword(s):
The constructive solution to the problem of representing a strictly stationary Markov chainζwith a countable infinity ofr-sequences (i1,i2, · ··,ir),r> 1, as states by a class of directed weighted circuits is given. Associating the chainζwith its dual chainηhaving reversed states and the same transition law, a connection with physical laws that govern diffusion of electrical current through a directed planar network withr-series-connected nodes is shown.
1989 ◽
Vol 26
(01)
◽
pp. 23-35
◽
Keyword(s):
1990 ◽
Vol 27
(03)
◽
pp. 545-556
◽
Keyword(s):
1968 ◽
Vol 5
(03)
◽
pp. 669-678
◽
1991 ◽
Vol 11
(3)
◽
pp. 501-513
◽
Keyword(s):
1994 ◽
Vol 26
(03)
◽
pp. 756-774
◽
2001 ◽
Vol 10
(4)
◽
pp. 293-308
◽
2020 ◽
Vol 23
(1)
◽
pp. 71-83
Keyword(s):