This is an introduction to stochastic processes without any measure theory requirements (the little measure theorey we use will be covered in lecture.) The main focus of the course will be Markov chains (discrete and continuous time) including queueing and branching processes. We will cover theoretical properties, how to design chains, and how to simulate them on computers. Other topics include martingles; Brownian motion and stochastic integration. No prior programming knowledge will be assumed, and although any programming language (C, R, Turbo Pascal, Logo, whatever) can be used in the course for simulation we will cover the basics of programming in MATLAB.
There will be weekly assignments. Assignments will be roughly 2/3 problem solving, and 1/3 computer work. There will also be three in class quizes and a final exam as well.
Math 104 and Math 135 or the equivalent.
Introduction to Stochastic Processes, by Greg Lawler (Chapman & Hall/CRC).
Return to: Course List * Math Graduate Program * Department of Mathematics * Duke University
Last modified: 09 October 2003