SB3.1 Applied Probability (2019-2020)

Prof. Julien Berestycki
General Prerequisites: 

Part A Probability.

Course Term: 
Course Lecture Information: 

16 lectures

[Teaching responsibility of the Department of Statistics. Please note, this course is offered from the schedule of Mathematics Department Units]

Course Weight: 
1.00 unit(s)
Course Level: 

Assessment type:

Course Overview: 

This course is intended to show the power and range of probability by considering real examples in which probabilistic modelling is inescapable and useful. Theory will be developed as required to deal with the examples.

Course Synopsis: 

Poisson processes and birth processes. Continuous-time Markov chains. Transition rates, jump chains and holding times. Forward and backward equations. Class structure, hitting times and absorption probabilities. Recurrence and transience. Invariant distributions and limiting behaviour. Time reversal. Renewal theory. Limit theorems: strong law of large numbers, strong law and central limit theorem of renewal theory, elementary renewal theorem, renewal theorem, key renewal theorem. Excess life, inspection paradox.

Applications in areas such as: queues and queueing networks - M/M/s queue, Erlang's formula, queues in tandem and networks of queues, M/G/1 and G/M/1 queues; insurance ruin models; applications in applied sciences.

Reading List: 
  1. J. R. Norris, Markov Chains (Cambridge University Press, 1997).
  2. G. R. Grimmett and D. R. Stirzaker, Probability and Random Processes (3rd edition, Oxford University Press, 2001).
  3. G. R. Grimmett and D. R. Stirzaker, One Thousand Exercises in Probability (Oxford University Press, 2001).
  4. S. M. Ross, Introduction to Probability Models (4th edition, Academic Press, 1989).
  5. D. R. Stirzaker, Elementary Probability (2nd edition, Cambridge University Press, 2003).

Please note that e-book versions of many books in the reading lists can be found on SOLO and ORLO.