[機統] Markov chain
consider the two-state Markov chain with one-step transition matrix
[ c 1-c]
P=| |
[ 1-d d ]
Determine values for c and d so that,in steady state,the probability
of being in state 1 is p, and the probability of changing state in
any one-step transition is a.
不好意思又來問問題了
先謝謝大家抽空看題目..
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 61.227.198.139
討論串 (同標題文章)
完整討論串 (本文為第 1 之 2 篇)：
機統
2
28