
Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
The connection between the continuous-time system and the discrete-time system in the context of stochastic processes. The text derives the relationship between the invariant probability vectors and the transition matrices of both systems, and discusses the physical interpretation of this result. Additionally, it covers the stability condition for the discrete-time markov chain.
Typology: Assignments
1 / 1
This page cannot be seen from the preview
Don't miss anything!

Math 171 Homework #
The continuous-time system obeys the eigenvector equation πA = 0. Ex- panded out, this gives ∑
k 6 =x
π(k)α(k, x) − π(x)α(x) = 0
Solving for π(x) yields
π(x) =
α(x)
k 6 =x
π(k)α(k, x)
Let the invariant probability vector for the discrete-time system be φ(x) and the transition matrix be Bx,y = α(x, y)/α(x). Then φ(x) satisfies φB = φ:
φ(x) =
k 6 =x
φ(k)
α(k, x) α(k)
Divide the above equation by α(x) to get
φ(x) α(x)
α(x)
k 6 =x
φ(k) α(k)
α(k, x)
Comparing this last equation with the equation for π(x) we see that π(x) = φ(x)/α(x).
This has a nice physical interperetation. It says that the amount of time spent in state x (π(x)) is the number of visits to x (φ(x)) times the length of time to leave state x (1/α(x)).
We require that
∑^ ∞
n=
μ 1 · · · μn λ 1 · · · λn
Because λn = nλ and μn = nμ, we have
∑^ ∞
n=
n!λn n!μn^
n=
( (^) λ μ
)n < ∞
which is true when λ < μ.