Breadcrumbs Section. Click here to navigate to respective pages.

Chapter

Chapter

# is m(x) for each , j in S = 2, N}.

DOI link for is m(x) for each , j in S = 2, N}.

is m(x) for each , j in S = 2, N}. book

# is m(x) for each , j in S = 2, N}.

DOI link for is m(x) for each , j in S = 2, N}.

is m(x) for each , j in S = 2, N}. book

Edition 1st Edition

First Published 2004

Imprint CRC Press

Pages 3

eBook ISBN 9780429223976

## ABSTRACT

Theorem 5.1 Suppose P is the 1-step transition probability matrix of a Markov chain on a finite state space. Also suppose P is diagonalizable over the real numbers. Then

Remarks.

take values in the interval [-1,1]. Moreover, one of these roots is always 1. If the steady state distribution exists, the roots are in the interval (-1,1] and the coefficient of root 1 is the steady state probability of the Markov chain.