Cycle Representations of Recurrent Denumerable Markov Chains
This chapter deals with the cycle generating equations defined by the transition probabilities of denumerable Markov chains ξ which are recurrent. The solutions (𝒞, w c ) of cycles and weights to these equations will be called cycle representations of ξ.
KeywordsMarkov Chain Weak Convergence Deterministic Algorithm Stochastic Matrix Probabilistic Algorithm
Unable to display preview. Download preview PDF.