Unit name | Monte Carlo Methods |
---|---|
Unit code | MATHM6001 |
Credit points | 10 |
Level of study | M/7 |
Teaching block(s) |
Teaching Block 1B (weeks 7 - 12) |
Unit director | Professor. Nick Whiteley |
Open unit status | Not open |
Pre-requisites |
None |
Co-requisites |
None |
School/department | School of Mathematics |
Faculty | Faculty of Science |
Unit aims
The unit aims to provide students with sufficient background to undertake research in scientific areas that require the use of Monte Carlo methods, by equipping them with the knoweldge and skills to understand, design and apply these techniques. Applications to Bayesian statistics will be discussed.
General Description of the Unit
Modern statistics and connected areas very often require the numerical approximation of quantities that are crucial to the understanding of scientific problems as diverse as robot navigation target tracking, wireless communications, epidemiology or genomics to name a few. The Monte Carlo method can be traced back to Babylonian and Old Testament times, but has been systematically used and known under this name since the times of the "Los Alamos School" of physicists and mathematicians in the 1940's-50's. The method is by nature probabilistic and has proved to be a very efficient tool to approximate quantities of interest in various scientific areas.
The main idea of Monte Carlo methods consists of reinterpreting mathematical objects, e.g. an integral or a partial differential equation, in terms of the expected behaviour of a random quantity. For example p = 3.14 can be thought of as being four times the probability that raindrops falling uniformly on a 2cmx2cm square hit an inscribed disc of radius 1cm. Hence provided that realisations (drops in the example) of the random process (here the uniform rain) can be observed, it is then possible estimate the quantity of interest by simple averaging.
The unit will consist of: (i) showing how numerous important quantities of interest in mathematics and related areas can be related to random processes, and (ii) the description of general probabilistic methods that allow one to simulate realisations of such processes on a standard PC.
Relation to Other Units
Part of this unit expands upon and applies some of the Markov chain theory studied in "Applied Probability 2". The introductions to Bayesian statistics given in "Statistics 2" and "Bayesian Modelling A" will be very useful for students taking this unit. Students may find that the level 6 unit "Bayesian Modelling B" and the Level 7 unit "Graphical Modelling" fit well with this unit, and the APTS courses on "Statistical Computing" and "Computer Intensive Statistics" provide complementary material.
Further information is available on the School of Mathematics website: http://www.maths.bris.ac.uk/study/undergrad/
Learning Objectives
The students will be able to:
Transferable Skills:
In addition to the general skills associated with other mathematical units, students will also have the opportunity to gain practice in the implementation of algorithms in R.
Lectures, (theory and practical problems) supported by example sheets, some of which involve computer practical work with R or Matlab.
80% Examination and 20% Coursework.
Raw scores on the examinations will be determined according to the marking scheme written on the examination paper. The marking scheme, indicating the maximum score per question, is a guide to the relative weighting of the questions. Raw scores are moderated as described in the Undergraduate Handbook.