Font Size: a A A

Computation for Markov chains

Posted on:2001-06-08Degree:Ph.DType:Thesis
University:North Carolina State UniversityCandidate:Cho, Grace Eun HeaFull Text:PDF
GTID:2460390014459355Subject:Mathematics
Abstract/Summary:
A finite, homogeneous, irreducible Markov chain C with transition probability matrix P possesses a unique stationary distribution vector piT. The questions one can pose in the area of computation of Markov chains include the following: (1) How does one compute the stationary distributions? (2) How accurate is the resulting answer? In this thesis, we try to provide answers to these questions.;The thesis is divided in two parts. The first part deals with the perturbation theory of finite, homogeneous, irreducible Markov Chains, which is related to the first question above. The purpose of this part is to analyze the sensitivity of the stationary distribution vector piT to perturbations in the transition probability matrix P. The second part gives answers to the question of computing the stationary distributions of nearly uncoupled Markov chains (NUMC).
Keywords/Search Tags:Markov, Stationary
Related items