MS&E 321

Stochastic Systems (Spring 2014)


| General Info | Announcements | Course Topics | Handouts | Assignments | References | Links |



General Information

Course Description 

This course addresses fundamental topics in the modern theory of stochastic processes, with emphasis on a broad spectrum of applications in engineering, economics, finance, and the sciences. The course carefully treats Markov chains in discrete and continuous time, Perron-Frobenius theory, Markov processes in general state space (including Harris chains), Lyapunov functions and supermartingale arguments for establishing stability, theory of regenerative processes and related coupling ideas, rare event analysis via large deviations, renewal theory, martingales, Brownian motion, and associated diffusion approximations. At the conclusion of this course, students will have a working knowledge of the mathematical tools and models that represent the cutting edge in the theory and application of stochastic processes to complex systems. The ideas will be illustrated by appealing to examples chosen from queueing theory, inventory theory, and finance.

Contact Information

Instructor:

Professor Peter Glynn
Office:
Huang Engineering Center 326
Email:
glynn@stanford.edu

Rob Wang (Course Assistant)
Office:
Huang Engineering Center 314M
Email:
robjwang [at] stanford [dot] edu

Lectures

Time :  M/W/F 11:00 AM - 12:15 PM (Note: Not all class periods will be used.)

Location :
Thornton 110


Office Hours

Professor Glynn: TBA

Rob Wang: Tues. and Thurs 1:30 PM-3:00 PM, Huang 219

Prerequisites

Students taking this course are expected to have taken a basic course on stochastic processes at the level of MS&E 221 or STATS 217, and should have a familiarity with basic linear algebra. Students should also have an understanding of basic real analysis (i.e. rigorous understanding of limits, continuity, sequences and series, etc.).

Textbook

Applied Probability and Queues, 2nd Ed (Soren Asmussen)

Homework

There will be four assignments due roughly every two weeks. Collaboration among students is encouraged. You should feel free to discuss problems with your fellow students (please document on each assignment with whom you worked). However, you must write your own solutions, and copying homework from another student (past or present) is forbidden. The Stanford Honor Code will apply to all assignments, both in and out of class.

Late Policy: Late assignment submissions are NOT accepted. All homeworks are due in class or by 5 PM on the CA's desk on the indicated due date. Hard-copies are preferred; electronic submissions will be graded without comments.

Exams

There will be no midterm.  The final will be 48-hour take-home.

Grading

The course grade will be based on assignments (50%) and final exam (50%).




| Management Science & Engineering Dept | Stanford University |