| STATISTICS OF A CLASS OF MARKOV CHAINS |
| |
| 作者姓名： | DENGYingchun CAOXianbing |
| |
| 作者单位： | DENG Yingchun(Department of Mathematics，Hunan Normal University，Changsha 410081，China) CAO Xianbing(Department of Basic Sciences，Beijing Technology and Business University，Beijing 100037，China) |
| |
| 基金项目： | This research is supported by Hunan Province Natural Science Foundation of China(OOJJY2003)，Doctoral Program Foundation of Institute of Higher Education of China, and Beijing Natural Science Foundation of China(1042007 ). |
| |
| 摘 要： | In this paper we prove that the distributions of their sojourn time and hitting time at one special state for random walks which are allowed to be finite or infinite and Markov chains on star-graphs with discrete time can uniquely determine the probability distribution of the whole chains. This result also suggests a new statistical method for Markov chains.
|
| 关 键 词： | 马尔可夫链 逗留时间 随机移动 星形图 命中时间 离散时间 |
STATISTICS OF A CLASS OF MARKOV CHAINS |
| |
| DENGYingchun CAOXianbing.STATISTICS OF A CLASS OF MARKOV CHAINS[J].Journal of Systems Science and Complexity,2004,17(3):387-398. |
| |
| Authors: | DENG Yingchun |
| |
| Abstract: | In this paper we prove that the distributions of their sojourn time and hitting time at one special state for random walks which are allowed to be finite or infinite and Markov chains on star-graphs with discrete time can uniquely determine the probability distribution of the whole chains. This result also suggests a new statistical method for Markov chains. |
| |
| Keywords: | Hitting time sojourn time random walk star-graph |
| 本文献已被 CNKI 维普 等数据库收录！ |
