Abstract
Let be a Markov chain with transition probability , where provided , , and . Let . It's known that is positive recurrent when ; is null recurrent when ; and is transient when . In this paper, we shall discuss the first returning speed and the last exit speed more precisely by means of
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.