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

preprint2011arXivOpen access

Abstract

Let {Xn}\{X_n\} be a Markov chain with transition probability pij=aj−(i−1)+,∀i,j≥0p_{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=0∞an=1\sum_{n=0}^\infty a_n=1. Let μ=∑n=1∞nanμ=\sum_{n=1}^\infty na_n. It's known that {Xn}\{X_n\} is positive recurrent when μ<1μ<1; is null recurrent when μ=1μ=1; and is transient when μ>1μ>1. In this paper, we shall discuss the first returning speed and the last exit speed more precisely by means of {an}\{a_n\}

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.