English

The first returning speed and the last exit speed of a type of Markov chain

Probability 2011-01-07 v1

Abstract

Let {Xn}\{X_n\} be a Markov chain with transition probability pij=aj(i1)+,i,j0p_{ij}=a_{j-(i-1)^+},\forall i,j\ge 0, where aj=0a_j=0 provided j<0j<0, a0>0a_0>0, a0+a1<1a_0+a_1<1 and n=0an=1\sum_{n=0}^\infty a_n=1. Let μ=n=1nan\mu=\sum_{n=1}^\infty na_n. It's known that {Xn}\{X_n\} is positive recurrent when μ<1\mu<1; is null recurrent when μ=1\mu=1; and is transient when μ>1\mu>1. In this paper, we shall discuss the first returning speed and the last exit speed more precisely by means of {an}\{a_n\}

Keywords

Cite

@article{arxiv.1101.1161,
  title  = {The first returning speed and the last exit speed of a type of Markov chain},
  author = {Huizeng Zhang and Minzhi zhao and Lei wang},
  journal= {arXiv preprint arXiv:1101.1161},
  year   = {2011}
}