首页 | 本学科首页   官方微博 | 高级检索  
     

随机环境中马氏链的强遍历性
引用本文:李应求,晏小兵,李明亮. 随机环境中马氏链的强遍历性[J]. 湘潭大学自然科学学报, 2003, 25(3): 126-130
作者姓名:李应求  晏小兵  李明亮
作者单位:长沙理工大学应用数学研究所,长沙,410077
基金项目:Supported Natural Science Foundation of China(10271020),Mile一Youth Foundation of Hunan(00JJEY2141)
摘    要:对随机环境中马氏链,Cogbum(1984,1990)首先引入了初始时间在原点的弱遍历的概念。并且给出了链是弱遍历的一些条件,李应求,晏小兵,汪和松(2003)引入了初始时间在任意点的一致弱遍历的概念,并且给出了链是一致弱遍历的一些条件。借鉴上述思想。引入了初始时问在任意点的强遍历的概念.并且给出了链是强遍历的一些条件。

关 键 词:随机环境中马氏链 一致弱遍历性 强遍历性 θ链

Strong Ergodicity of Markov Chains in Random Environments
LI Ying - qiu,YAN Xiao - bing,LI Ming - liang. Strong Ergodicity of Markov Chains in Random Environments[J]. Natural Science Journal of Xiangtan University, 2003, 25(3): 126-130
Authors:LI Ying - qiu  YAN Xiao - bing  LI Ming - liang
Abstract:For Markov chains in random environments, Cogbum(1984, 1990) firstly introduced weakly ergodic concept that "starting time" is original point, and gave some conditions ensuring that the chains are weakly ergodic; Li Yingqiu, Yan Xiaobing, Wang He - song(2003) introduced uniformly weakly ergodic concept that "starting time" is any point, and gave some conditions ensuring that the chains are uniformly weakly ergodic. The definitions of strongly ergodic-ity that "starting time" is any point are introduced. Some conditions ensuring that the chains are strongly ergodic are giv-
Keywords:Markov chains in random environments  Uniformly weak ergodicity  Strong ergodicity  B-chain
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号