2019
DOI: 10.1017/s0269964819000354
|View full text |Cite
|
Sign up to set email alerts
|

Some Limit Theorems of Delayed Averages for Countable Nonhomogeneous Markov Chains

Abstract: The purpose of this paper is to establish some limit theorems of delayed averages for countable nonhomogeneous Markov chains. The definition of the generalized C-strong ergodicity and the generalized uniformly C-strong ergodicity for countable nonhomogeneous Markov chains is introduced first. Then a theorem about the generalized C-strong ergodicity and the generalized uniformly C-strong ergodicity for the nonhomogeneous Markov chains is established, and its applications to the information theory are given. Fin… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 17 publications
0
1
0
Order By: Relevance
“…e Markov process refers to the division of a system into several small systems with different states, and each state can be transferred to another corresponding state according to its inherent transition probability. It is concluded that the Markov chain represents a process between one state and another, and that the probability of this process depends only on the corresponding preceding and following states [26]; its basic definition is as follows: let the random variable in discrete space I � (Xn, n ≥ 0), if any random variable n and any state i 0 , i 1 , i 2, i 3…”
Section: Markov Chainmentioning
confidence: 99%
“…e Markov process refers to the division of a system into several small systems with different states, and each state can be transferred to another corresponding state according to its inherent transition probability. It is concluded that the Markov chain represents a process between one state and another, and that the probability of this process depends only on the corresponding preceding and following states [26]; its basic definition is as follows: let the random variable in discrete space I � (Xn, n ≥ 0), if any random variable n and any state i 0 , i 1 , i 2, i 3…”
Section: Markov Chainmentioning
confidence: 99%