title | date |
---|---|
Class 4 |
January 13, 2023 |
$X(t) : \Omega \rightarrow \mathcal{S}$ -
$T$ and$\mathcal{S}$ are parameter and state space respectively
- Obeys Markov Property
Consider Transition Probability Matrix
Now if we consider
-
$\overline{\mu}$ : Initial Distribution over$\mathcal{S}$
- This follows only for homogeneous DTMCs
- For non-homogeneous,
$P$ depends on$n$ (the timestep).
- For non-homogeneous,
-
$j$ is accessible from$i$ if$p^n_{ij} > 0$ for some$n$ - Denoted as
$i \rightarrow j$ -
$i \rightarrow j$ and$j \rightarrow i$ then we say that$i$ and$j$ communicate. This is denoted by$i \leftrightarrow j$ .
Communication is an equivalence relation.
States which communicate belong to the same equivalence class
Irreducible when
- State
$i$ is recurrent if$F_{ii} = 1$ - If
$F_{ii} < 1$ then State$i$ is transient- Each communicating class share recurrence or transience
The dependence on initial distribution starts to vanish after long time.
$$ \pi_j = \lim_{n\rightarrow \infty} p^{(n)}{ij} = [\lim{n \rightarrow \infty} P^n]_{ij} $$
$$
\pi = \pi P
$$
\begin{proof}
Stochastic Matrices always have an eigenvalue
-
$\pi P$ is essentially the pmf of$X_1$ having picked$X_0$ according to$\pi$ -
$\pi = \pi P$ says that the distribution of$X_1$ will also be$\pi$ (if initial distribution was$\pi$ )
\begin{remark} If Limiting Distribution exists, then it is same as stationary distribution. \end{remark}