The Course Outline contains information about text, topics, grading.

Office hours with G. Slade in MATX 1211: Monday 15:00-15:50, Wednesday 13:00-13:50, Friday 10:00-10:50.

Regular office hours will cease on Friday April 10.
There will be office hours on Monday April 20 and Wednesday April 22, 14:00-15:00 in MATX 1102.

Office hours with Benjamin Wallace in the
Math Learning Centre:
Thursdays 12:30-15:30.

Exceptions: Benjamin Wallace's hours are cancelled
on Thursday February 12, Thursday March 26, and Thursday April 9, and are replaced instead by
Tuesday February 10, Tuesday March 24, and Tuesday April 7 at 12:30-15:30 on these days, due to the
tests on February 11 and March 25, and the due date of Wednesday April 8 for Assignment 9.

There are TAs available
whenever the MLC is open, and in addition to Benjamin Wallace there are other TAs
who can help with probability questions; the schedule is posted on the MLC website.

Octave resources are available
here.
You should instal Octave on your computer as soon as possible (or MATLAB if you prefer).

For Assignment 8, a short tutorial on linear regression is
here.

Course Evaluation: Please take a few minutes now and complete the evaluation for MATH 318. Your evaluations really do make a difference. We use your feedback to assess and improve our teaching; Heads and Deans look at evaluation results as an important component of decisions about reappointment, tenure, promotion and merit for faculty members; and evaluations are used to shape Departmental curriculum. Please help us make the course effective by telling us what works well and what can be improved.

On tests and the final exam you will be provided with
tables and, when appropriate,
Student-T table.

Example for the Student-T table: If T has 3 degrees of freedom then P(T<2.353)=0.95 and P(|T|<2.353) = 0.9.

References for self-avoiding walks:

Pivot algorithm simulations and more at Nathan Clisby's
website.

G. Slade. Self-avoiding walks. *The Mathematical Intelligencer* **16**:29--35, (1994).
PDF file .

Chapter 9 of N. Madras and G. Slade, *The
Self-Avoiding Walk* , Birkhäuser, Boston, (1996) (can be downloaded from
UBC library).

More advanced: N. Clisby,
Accurate estimation of the critical exponent nu for self-avoiding walks via a fast implementation
of the pivot algorithm,
Physical Review Letters **104**:055702,
February 5, 2010.

Interesting animations demonstrating the central limit theorem.

An article on Markov and the origins of the theory of Markov chains, by Brian Hayes.

A good reference for random walks is the book: Random Walks and Electric Networks by Doyle and Snell.

Recommended, fun, and accessible general reading about probability: Struck by Lightning by J.S. Rosenthal, and The Improbability Principle by D.J. Hand.

Gaussian distribution on the German 10 mark note.