联系方式

  • QQ:99515681
  • 邮箱:99515681@qq.com
  • 工作时间:8:00-21:00
  • 微信:codinghelp

您当前位置:首页 >> Algorithm 算法作业Algorithm 算法作业

日期:2024-12-23 10:23

PSTAT 160A Fall 2024 - Assignment-4

(Due by November 30 (Saturday), midnight 11:59 pm.)

1. Find the communication classes of a Markov chain with transition matrix

Rewrite the transition matrix in canonical form.

2. Show that the stationary distribution for the modified Ehrenfest chain is binomial with param-eters N and 1/2.

3. Consider a Markov chain with transition matrix

Identify the communication classes. Classify the states as recurrent or transient, and determine the period of each state.

4. Markov chains are used to model nucleotide substitutions and mutations in DNA sequences. Kimura gives the following transition matrix for such a model.

Find a vector x that satisfies the detailed-balance equations. Show that the chain is reversible and find the stationary distribution.

5. Consider a Markov chain with transition matrix

where 0 < α, β, γ < 1. Find the transition matrix of the time reversal chain.

6. Classify the states of a Markov chain, with S = {0, 1, 2, 3}, given by the transition probability matrix

Write the matrix in the form.

where PC = (pij )i,j∈C, Q = (pij )i∈T,j∈C, R = (pij )i,j∈T . Here T the set of transient states and by C the set of recurrent states such that S = C ∪ T. Compute the matrix U = (I1 − R) −1Q of absorption probabilities into the set of recurrent states.





版权所有:编程辅导网 2021 All Rights Reserved 联系方式:QQ:99515681 微信:codinghelp 电子信箱:99515681@qq.com
免责声明:本站部分内容从网络整理而来,只供参考!如有版权问题可联系本站删除。 站长地图

python代写
微信客服:codinghelp