Of Notes

Markov Property

1 min read · revised 5 November 2026 · referred to by 2 notes · ·

The key idea is that it's fully memoryless, where any future state is dependent only on the current state and none of the preceding ones. Any process with this property bears Andrey Markov's name.

We say that almost surely:

\begin{equation} P(X_n \in A \mid X_0, X_1, \dots, X_{n-1}) = P(X_n \in A \mid X_{n-1})} \end{equation}
/ or Ctrl K
search; empty, it shows notes to revise and lately read
m
mark this note to revise, or unmark it
c
cover maths, proofs and solutions to test yourself
n
uncover the next covered item
y
copy this note’s org-roam link
e
copy this note as markdown, LaTeX kept as TeX
p
the next problem to work; there h hints, s shows the solution, x passes it for today
→ ← j k space
turn the page, when reading in pages
l
on the map, trace the greatest distance, then the longest path
double-click
a formula, to copy its TeX
rest on maths
bind a part of a formula and open the wheel of notes it comes from; scroll or ↑ ↓ widens it, 1–6 goes
?
this card