Start Free Trial
Come for the solution, stay for everything else.
Start Free Trial
markov chain sequence
In markov chain you have a transition matrix and initial state.
It is easy to work out the probability on the nth event but what about a sequence of events .
the 1st column .75 is prob a day is wet today given it was wet yesterday .
the 1st column .7 is prob a day is not wet given it was not wet yesterday .
t= .75 .3
what is the probability of a at least 2 days being wet out of the next 3 if it was wet yesterday.
using a markov chain how do i do this?
Math / Science
8/22/2022 - Mon
Start from the state of it was wet yesterday and then work out all the possible final states for the next 3 days (you should have 8 of them). Now find the paths that have 2 or more wet days and add up the probabilities.
This is a three level tree with eight possible outcomes.
You care about four of them.
I started with Experts Exchange in 2004 and it's been a mainstay of my professional computing life since. It helped me launch a career as a programmer / Oracle data analyst
ASKER CERTIFIED SOLUTION
Log in or sign up to see answer
Become an EE member today
7-DAY FREE TRIAL
Members can start a 7-Day Free trial then enjoy unlimited access to the platform
Sign up - Free for 7 days
Learn why we charge membership fees
We get it - no one likes a content blocker. Take one extra minute and find out why we block content.
See how we're fighting big data
Not exactly the question you had in mind?
Sign up for an EE membership and get your own personalized solution. With an EE membership, you can ask unlimited troubleshooting, research, or opinion questions.
ask a question
ok so what is the answer and the s0 matrix as it goes along?
You know that we can't just solve the whole problem for you. This is an academic question.
What do you have for it so far?
Plans and Pricing
Certified Expert Program
© 1996-2022 Experts Exchange, LLC. All rights reserved. Covered by US Patent