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

Abstract

Let \Xn\ be a Markov chain with transition probability pij=aj-(i-1)+,∀ i,j 0, where aj=0 provided j<0, a0>0, a0+a1<1 and Σn=0∞ an=1. Let μ=Σn=1∞ nan. It's known that \Xn\ is positive recurrent when μ<1; is null recurrent when μ=1; and is transient when μ>1. In this paper, we shall discuss the first returning speed and the last exit speed more precisely by means of \an\

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…