MATH-332 / 5 credits
Teacher: Mountford Thomas
The course follows the text of Norris and the polycopie (which will be distributed chapter by chapter).
We will follow the book of Norris beginning with a recap of basic probability. Then we pass to the definition of Markov chains and the definition of irreducible. We analyze notions of recurrence and transcience, particularly for irreducible chains. We then define positive recurrence and stationary distributions before proving the convergence theorem for aperiodic positive recurrent markov chains. The last two topics are continuous times Markov Chains and renewal theorms.
Stationary distributions. Irreducibility. Aperiodicity. Communicating classes. Transcience and recurrance. Transition matrices. Operators.
Second year probability.
By the end of the course, the student must be able to:
- Compute stationary distributions
- Classify communicating classes
- Solve hitting probabilities
- Use the renewal theorem
- Check irreducibility
- Demonstrate the capacity for critical thinking
Lectures followed by exercise sessions
The greater part of the note will be determined by the final (written) exam. There will also be small contribution by a "midterm" exam and by exercises.
Dans le cas de l'art. 3 al. 5 du Règlement de section, l'enseignant décide de la forme de l'examen qu'il communique aux étudiants concernés.
Markov Chains by J. Norris is recommended but not obligatory.
Ressources en bibliothèque
Notes will be made available
In the programs
- Semester: Spring
- Exam form: Written (summer session)
- Subject examined: Stochastic processes
- Lecture: 2 Hour(s) per week x 14 weeks
- Exercises: 2 Hour(s) per week x 14 weeks