Markov chains
MATH-332
- Lectures: Monday 13:15 -- 15:00 CE 5Exercises: Wed... (Text and media area)
- Announcements (Forum)
- Markov Chains- Norris (chapters 1-2-3) (File)
- Polycopie (File)
- Practice Final (File)
- Solution- Practice Exam (File)
- Text and media area (Text and media area)
- Practice midterm (File)
- Solutions to midterm (File)
- Markov Chains- Norris (chapters 1-2-3) (File)
- 2021 SOLs A (File)
- 2021 SOLNs B (File)
- 2021 SOLNs C (File)
- Practice exam for review (File)
- Solutions to Review midterm (File)
- Practice Exam (File)
- SOLUTIONS TO PRACTICE FINAL (File)
- Practice Final for review june 26 (File)
- Corrections for Question 1 (File)
This week we reviewed basic elements of probability, in particular conditional probability and conditional
independence. We also recalled useful distributions:
binomial, geometric, exponential and Poisson.
We introduced probability vectors and transition matrices. We defined a (lambda, P ) Markov chain and established basic equivalences before the most important result:
conditional on X_m being equal to state i, the future is a (\delta_i, P) markov chain independent of the vector
(X_0,X_1, . . ._m). We then defined communicating classes and irreducible Markov chains.
We discuss communicating classes and the notion of irreducibility and why it is important.
We then discuss various hitting probability questions, giving the recursive
equations for hitting probabilities and the abstract result that the hittinng probabilities are
the minimal solutions to these equations.
17 march-23 march
Probably the most important week of the course.
24 March-30'th March
and the link with positive recurrence.
THIS WEEK IS THE SECOND EXERCISE TEST (AGAIN IN THE EXERCISE SESSION)
7'th April-14'th April
21'st April-27'th April
We finish off discrete time Markov chain theory and begin continuous time chains.
We first describe a continuous time chain and discuss why holding time smust be Exponential. We start with Poisson processes
28'th April-4'th May
the censoring theorem
may 5-may 11
12'th May- 18'th May
26'th May-31'st May
We end by discussing invaraince and positive recurrence.
Then we discuss two Markov processes "on" countable state spaces
that are not Markov chains in our sense.
We complete the proofs of the results stated in the previous lecture and then give the (simple) proof of the convergence to equilibrium result for positive recurrent irreducible Markov chains . For the exercises ignore the last two questions which depend on renewal theory which is not in the course this year. For the same reason for the practice exam, question 3 need not be attempted as it deals with renewal theory.
Disclaimer. The choice of subjects and emphasis need not be the same as for this exam.