josia-notes/s23-probability-theory
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

some small changes

Browse source
This commit is contained in:
Josia Pietsch 2023-07-06 00:50:07 +02:00
parent 84a65bcfd9
commit 0a5131f313
Signed by untrusted user who does not match committer: josia
GPG key ID: E70B571D66986A2D
1 changed files with 7 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

11
inputs/lecture_22.tex
View file

@ -41,7 +41,7 @@
\end{question} \end{question}
We have We have
\begin{IEEEeqnarray*}{rCl} \begin{IEEEeqnarray*}{rCl}
\bP[X_1 = 0, X_2 = 0, X_3 = 1] &&\bP[X_1 = 0, X_2 = 0, X_3 = 1]\\
&=& \bP[X_3 = 0 | X_2 = 0, X_1 = 0] \bP[X_2 = 0, X_1 = 0]\\ &=& \bP[X_3 = 0 | X_2 = 0, X_1 = 0] \bP[X_2 = 0, X_1 = 0]\\
&=& \bP[X_3 = 0 | X_2 = 0] \bP[X_2 = 0, X_1 = 0]\\ &=& \bP[X_3 = 0 | X_2 = 0] \bP[X_2 = 0, X_1 = 0]\\
&=& \bP[X_3 = 0 | X_2 = 0] \bP[X_2 = 0 | X_1 = 0] \bP[X_1 = 0]\\ &=& \bP[X_3 = 0 | X_2 = 0] \bP[X_2 = 0 | X_1 = 0] \bP[X_1 = 0]\\
@ -63,7 +63,8 @@
More generally, consider a Matrix $P \in (0,1)^{n \times n}$ More generally, consider a Matrix $P \in (0,1)^{n \times n}$
whose rows sum up to $1$. whose rows sum up to $1$.
Then we get a Markov Chain with $n$ states Then we get a Markov Chain with $n$ states
by defining $\bP[X_{n+1} = i | X_{n} = j] = P_{i,j}$. by defining
\[\bP[X_{n+1} = i | X_{n} = j] = P_{i,j}.\]
\end{example} \end{example}
\begin{definition} \begin{definition}
@ -89,8 +90,10 @@
\item $\bP[X_0 = i] = \alpha(i)$ \item $\bP[X_0 = i] = \alpha(i)$
for all $i \in E$, for all $i \in E$,
\item $\bP[X_{n+1} = i_{n+1} | X_0 = i_0, X_1 = i_1, \ldots, X_{n} = i_{n}] \item \begin{IEEEeqnarray*}{rCl}
= \bP[X_{n+1} = i_{n+1} | X_n = i_n]$ &&\bP[X_{n+1} = i_{n+1} | X_0 = i_0, X_1 = i_1, \ldots, X_{n} = i_{n}]\\
&=& \bP[X_{n+1} = i_{n+1} | X_n = i_n]
\end{IEEEeqnarray*}
for all $n = 0, \ldots$, $i_0,\ldots, i_{n+1} \in E$ for all $n = 0, \ldots$, $i_0,\ldots, i_{n+1} \in E$
(provided $\bP[X_0 = i_0, X_1 = i_1, \ldots, X_n = i_n] \neq 0$ ). (provided $\bP[X_0 = i_0, X_1 = i_1, \ldots, X_n = i_n] \neq 0$ ).
\end{enumerate} \end{enumerate}