Problem 501. Let's do Markov Chains!

Created by Stephen

Solve Later

{"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","targetMode":"","relationshipId":"rId1","target":"/matlab/document.xml"},{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/output","targetMode":"","relationshipId":"rId2","target":"/matlab/output.xml"}],"parts":[{"partUri":"/matlab/document.xml","relationship":[],"contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?>\n<w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:hyperlink w:docLocation=\"http://en.wikipedia.org/wiki/Markov_chain\"><w:r><w:t>Markov Chains</w:t></w:r></w:hyperlink><w:r><w:t> are really useful in a lot of fields. This problem will ask a question about a simple system with 3 states: A,B and C. The probability that one state will go to another can be given in a matrix such as:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[mc = [0.5 0.2  0;\n      0.2  0  0.6;\n      0.3 0.8 0.4];]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>So, the first element is the probability that something in state A will remain in state A (0.5 here). The zero as the 5th element means nothing in state B will remain in state B. Now, if you are given the current state of the system, say state=[1 0 0], you can get the next state.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>In this problem, I will given an incomplete matrix (A zero in place of one value), and then an initial state and the next state like:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"code\"/></w:pPr><w:r><w:t><![CDATA[states=[1 0.5;\n        0 0.2;\n        0 0.3]]]></w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/></w:pPr><w:r><w:t>You will have to provide the correct markov matrix as the output.</w:t></w:r></w:p></w:body></w:document>"},{"partUri":"/matlab/output.xml","contentType":"text/xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\" standalone=\"no\" ?><embeddedOutputs><metaData><evaluationState>manual</evaluationState><layoutState>code</layoutState><outputStatus>ready</outputStatus></metaData><outputArray type=\"array\"/><regionArray type=\"array\"/></embeddedOutputs>"}]}

Solve

Solution Stats

55 Solutions
12 Solvers

Last Solution submitted on Dec 22, 2018

Last 200 Solutions

Problem Comments

4 Comments

4 Comments

Show 1 older comment

@bmtran (Bryant Tran) on 15 Mar 2012

test case 2 is underconstrained (either of the two zeros could be changed) and test case 3 doesn't account for increased precision.

Stephen on 15 Mar 2012

hmm, sorry man. This was just for fun so people might get interested in markov chains, so I didn't think too hard about the test cases :)

Alfonso Nieto-Castanon on 15 Mar 2012

perhaps it's been changed already, test 2 does not look underconstrained (one additional constrain of mc is that its columns should add up to 1)

Alfonso Nieto-Castanon on 16 Mar 2012

In fact tests 2 and 3 are 'overconstrained' (you do not need the 'states' information to solve these)

Problem Recent Solvers12

Problem Tags

linear algebra markov chain

Problem 501. Let's do Markov Chains!

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers12

Suggested Problems

More from this Author3

Problem Tags

Problem 501. Let's do Markov Chains!

Solution Stats

Last 200 Solutions

Problem Comments

Problem Recent Solvers12

Suggested Problems

More from this Author3

Problem Tags

Players