STAT 333 Tutorial Files

1. Cards.png - Choose a card from X, an ordered stack of cards $X \in \{1,2,\dots,N\}$. Take all cards below this value and call this new stack Y. From Y, you now pick a card. Find the ranges of both $(X|Y), (Y|X).$
2. Tennis Program - A visual for tutorial 4's first question.
3. Tennis Program Fixed - 2 paths were missing
4. Directed Graph - How to draw directed graphs ($P_{i,j} = P(X_{n+1}=j|X_{n}=i)$)
5. Reflecting Boundaries - Tutorial 6 Question 2 Illustration
6. Tutorial 7 - Irreducible and Infinite - We see our first processes which take values in $\mathbb{N}=\{0,1,\dots\}$ and observe a case for which the entire chain is irreducible and another where it there exists $\mathbb{N}$ communication clases (see the bottom figure).
7. Squashed Processes - Tutorial 8
8. Gamblers Ruin  - Tutorial 9

Class: 

STAT 333: Applied Probability

Attach Files: 

cards.png

Tennis Program

Tennis Program 2

Fixed Tennis 2

Fixed Tennis

Directed Graph

Reflecting Boundaries

Tutorial 7 - Irreducible and Infinite

Squashed Processes

Gamblers Ruin