Skip to main navigation Skip to search Skip to main content

Markov Chains on a Discrete State Space

  • Sorbonne Université
  • Université Paris-Nanterre

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

In this chapter we will discuss the case in which the state space X is discrete, which means either finite or countably infinite. In this case, it will always be assumed that (Formula Presented), the set of all subsets of X. Since every state is an atom, we will first apply the results of Chapter 6 and then highlight the specificities of Markov chains on countable state spaces. In particular, in Section 7.5 we will obtain simple drift criteria for transience and recurrence, and in Section 7.6 we will make use for the first time of coupling arguments to prove the convergence of the iterates of the kernel to the invariant probability measure.

Original languageEnglish
Title of host publicationSpringer Series in Operations Research and Financial Engineering
PublisherSpringer Nature
Pages145-164
Number of pages20
DOIs
Publication statusPublished - 1 Jan 2018

Publication series

NameSpringer Series in Operations Research and Financial Engineering
ISSN (Print)1431-8598
ISSN (Electronic)2197-1773

Fingerprint

Dive into the research topics of 'Markov Chains on a Discrete State Space'. Together they form a unique fingerprint.

Cite this