You are here

Home » Programs » Faculty and Departments » Computing the Fundamental Matrix for a Reducible Markov Chain

Computing the Fundamental Matrix for a Reducible Markov Chain

by Theodore J. Sheskin (Cleveland State University)

This article originally appeared in:
Mathematics Magazine
December, 1995

Subject classification(s): Linear Algebra | Statistics and Probability | Probability | Stochastic Processes
Applicable Course(s): 3.8 Linear/Matrix Algebra | 7.2 Probability | 7.3 Stochastic Processes

A Markov chain with 9 states is used to illustrate a technique for finding the fundamental matrix.


A pdf copy of the article can be viewed by clicking below. Since the copy is a faithful reproduction of the actual journal pages, the article may not begin at the top of the first page.

To open this file please click here.

These pdf files are furnished by JSTOR.

Classroom Capsules would not be possible without the contribution of JSTOR.

JSTOR provides online access to pdf copies of 512 journals, including all three print journals of the Mathematical Association of America: The American Mathematical Monthly, College Mathematics Journal, and Mathematics Magazine. We are grateful for JSTOR's cooperation in providing the pdf pages that we are using for Classroom Capsules.

Capsule Course Topic(s):
Linear Algebra | Application: Markov
Probability | Stochastic Processes, Discrete Markov Chains
Average: 2.7 (20 votes)