Issue 01: The Markov Files
The world is always changing.
At first glance, it looks like chaos.
But hidden inside that chaos…
are patterns.
Patterns we can model

I protect the system… one transition at a time.
His superpower lies in one simple rule …
Markov Man’s Superpower
\[ P(X_{t+1} = j \; \vert \; X_t = i, X_{t-1} = i_{t-1}, \dots X_0 = i_0) = P(X_{t+1} = j \; \vert \; X_t = i) \]
No history. No memory. Only the present.
BUT WAIT!
In regression, the suspect leaves behind a trail.
BUT WAIT!
But Markov models leave no such trail.
They predict probabilities
\[ P = \begin{bmatrix} P(A \rightarrow A) \quad P(A \rightarrow B) \\ P(B \rightarrow A) \quad P(B \rightarrow B) \end{bmatrix} = \begin{bmatrix} 0.6 \quad 0.4 \\ 0.7 \quad 0.3 \end{bmatrix} \]
How do you compute residuals from probabilities?
Do the stories match?
If residuals fail us…
we need to find another way.
To solve the mystery…
Markov Man ran thousands of simulated investigations.
… specifically 54,000!
The Suspects
Base model: \(y \sim x_1 + x_2 + x_3\)
Additive model: \(y \sim x_1 + x_2 + x_3 + y_{t-1}\)
Multiplicative Model: \(y \sim (x_1 + x_2 + x_3) \times y_{t-1}\)
For every fitted model:
The greater the difference, the greater the suspicion.
Markov Man assembled his specialist detective squad:
As well as some of his most trusted veterans
The Veteran Detectives
AIC and BIC
The investigation revealed:
For small samples, we have a couple of good detectives!
“When sample sizes are small and states are few, Manhattan Distance is your best detective!”