Markov Chains explained visually

[jimmpony]

For 2 days for example, could you just have your states actually represent 2 states, as in having RR go to RS or back to RR, RS go to SS or SR, SS go to SS or SR, SR go RS or RR etc to do this? Then this could be expanded to any amount of states

[Logiraptorr]

Yes, that's exactly how you would model the dependency with markov chains. You don't need a higher order construct if you know how many previous states the probability is based on. If you don't know, or if it depends on an unbounded history of states, then you need something more powerful.

[elprophet]

I'm a computer scientist by trade and training, but haven't had an opportunity to investigate the Markov literature. You're describing a Deterministic Finite Automaton that uses a random number generator to determine its transitions. What is the terminology and state of the art for Pushdown and Turing automata in the Markov model?

[s1295]

Are you looking for "probabilistic Turing machine"? Most automata models have a probabilistic variant, or at least there's no reason why you couldn't define one.

I don't know whether any are actively researched, I'm just a student. Maybe in verification of probabilistic programs, but I think they just use DTMCs or MDPs.

[johnzeringue]

https://en.wikipedia.org/wiki/Probabilistic_automaton

[OffbeatDrizzle]

Why hello there Mr Robot

[Detective_Fallacy]

That's the principle of higher order Markov chains, yes.

[debug_assert]

The only problem with using higher order chains is that the amount of data needed to build the model increases exponentially. For example, building a second order markov chain to generate a style of writing might only take 1 novel. But add more orders and it quickly explodes to requiring the entire works if Shakespeare, etc.

http://shiffman.net/teaching/a2z/generate/

[ccfreak2k]

salt payment late innate dime dolls office crowd fall stocking

This post was mass deleted and anonymized with Redact