Example 1 for Markov Chain ‘weather model’

This note is purely in English for my final exam, please be calm down if you are in trouble.

Lets use Markov Chain to solve a very simple problem - 'Weather Problem',  we have the following assumptions:

  • If it is raining today, then the probability of raining tomorrow is 70%, and the probability of not raining tomorrow is 30% ;
  • If it is not raining today, then the probability of raining tomorrow is 40%, and the probability of not raining tomorrow is 60% .

Therefore, we have the following finite state machine:



According to the state machine, we can get the one-step transition matrix as follows:


Now, lets use the stationary probability of Markov Chain, for computing the statistical probability of raining or not raining for someday.
  • At first, we make the staring distribution in Day 0 is 
  • Then, the distribution in Day 1 is
 
  • Then, the distribution in Day 2 is
  • Finally, for given transition matrix and the staring distribution, the stationary distribution can be computed as


Actually, we have already got our goal, the final stationary distribution can describe the statistical probability.

In conclusion, just need 3 steps for analysis of practical example using Markov Chain.

  • Draw the State Machine through the existing conditions;
  • Compute the one-step transition matrix;
  • Compute the stationary distribution according to the existing conditions.

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值