matrix - Finding transition probabilities from N-state probabilities (Where N is 'a long time') -


i'm confused theory , need advice

789

456

123

this grid represents basic house 9 rooms.

a mouse, m, in room i, , after time interval, "t", moves adjacent room, j. example, mouse can in room 1, , after t, either not move, or move either room 2, or 4. let's moved room 2. after "t" interval, either move 1/3/5 or stay in 2. , on. it's markov chain.

what method use calculate transition probabilities between each state rules above valid , resulting probability of, after long time, being in bottom row (1/2/3) 1/6, being in middle 3 row (4/5/6) 2/6 (1/3), , top row (7/8/9) 3/6 (1/2)?


Comments

Popular posts from this blog

java - SSE Emitter : Manage timeouts and complete() -

jquery - uncaught exception: DataTables Editor - remote hosting of code not allowed -

java - How to resolve error - package com.squareup.okhttp3 doesn't exist? -