STAT/MATH 6402, Advanced Probability II, Winter 2005

Instructor: Prof. Jaimie Kwon (Homepage)

Lecture: MW ScN 207, 4-5:50 PM

The book website

Syllabus

Week Date

Homeworks (Usually due in a week) * Only some of the problems will be graded.

Solutions to HW will be posted on the blackboard, "Course Materials" tab

Notes
1

1/2

We will finalize group/project assignment next Wed

HW #1, Exercises 26, 30, 32, 46 in Chapter 1
Exercises 13, 25, 46, 56(difficult) in Chapter 2
Due next Wed (1/11)

Chapter 1. Introduction to Probability Theory

Chpater 2. Random Variables

Chapter 3. Conditional Probability and Conditional Expectation

 

2

1/9

HW #2, Exercises 2, 7, 9, 17, 19, 21, 22 (optional), 40, 56 in Chapter 3

Due next Wed (1/18, extended to a week after that, 1/25)

 
3 1/16

No class (MLK Holiday) on Monday

Chapter 4. Markov Chains

Erik Medeiros, Joseph Rickert, (Xuemei Lin),

Markov Chains.ppt
(Erik Medeiros)

4 1/23

No class on Monday

HW #3: Exercises 1 & 27, 2 & 3, 7 & 19, 14, 16, 20 & 22 in Chapter 4
Due next Fri (1/27)

Reading Assignments:
Lecture 5: Markov models given at Centre for Integrative Bioinformatics in Universiteit amsterdam (pdf) Copied from http://ibivu.cs.vu.nl/teaching/masters/bi_tools/2005/tools_lec4_2005.pdf

It talks about estimation of Markov chain transition probabilities, higher order Markov chains as well as hidden Markov models. Let me know if you find other interesting materials!

MarkovChain.pdf (Joseph Rickert)

Branch code_v2.doc

Gibbs-disease_test_ex.doc

 

5 1/30

Chapter 5. The Exponential Distribution and the Poisson Process

Ying Qin, Sarada Pasumaithi

Poisson Profess.ppt
(Ying Qin)
6 2/6

Chpater 6. Continuous-Time Markov Chains

Dan Sultana, Kim Bui, Calvin Elam

HW #4: Chapter 5, Exercises 4, 8, 14, 18, 24, 29, 37, 39, 42, 45, 58, 64
Due next Monday (2/13)

7 2/13

Chapter 8. Queueing

Clem, Roanna

HW #5: (Chapter 6; Due next Monday, 2/20)

1. Book problems #4,5 (use simulation to confirm your
answer),12,24

2. M/M/1 Queue with lambda=30 and mu=40

(a) Read example 6.5. Explain why an M/M/1 queue is a
birth/death process.
(b) Read example 6.12. Write out forward equations for
an M/M/1 queue with lambda=30 and mu=40
(c) Read example 6.14 and notice that N (the steady
state number of people in the system) is almost a
geometric random variable and that N-1 is a geometric
random variable. For an M/M/1 queue with lambda=30
and mu=40, answer the following questions: What is the
most likely number of people in the system at steady
state? What is the expected number of people in the
system at steady state? What is the variance of the
number of people in the system at steady state?
(d) Read corollary 6.6 Is an an M/M/1 queue with
lambda=30 and mu=40 time reversible? Interpret what
time reversible means.

3. Is the 3 state process from class time reversible?

Queueing.pdf (Roanna Gee)
8 2/20

Chapter 9. Reliability Theory

Clem Charway, David Schlessinger, Erica Wong

 

 
9 2/27

Chapter 10. Brownian Motion and Stationary Processes

Cheng Su, Joseph Rickert

Reference: The (Mis)Behavior of Markets, Benoit Mandelbrot and Richard L.Hudson, Basic Books, 2004

HW #6. Do the following exercises in Ross, Chapter 9
Problems 16, 18, 20, 22.
(Due next Monday, 3/6)

Simulation of Geometric Brownian Motion.doc

Ross Example.xls

10 3/6

About 6310/4401 and 6402

"... , I think we should encourage any MS student who has not taken 4401 to
take 6310. Almost all MS Exams have a probem on Markov chains, Poisson processes, or simple queues. This has always been a required part of the MS curriculum. .... "

Chapter 11. Simulation

Sung Kim, Anthony Britto

 
11 3/13

Final take home (pdf)

Table of Contents of the textbook (for Project Assignments)

Contents
Preface
1. Introduction to Probability Theory
1.1. Introduction
1.2. Sample Space and Events
1.3. Probabilities Defined on Events
1.4. Conditional Probabilities
1.5. Independent Events
1.6. Bayes' Formula
Exercises
References
2. Random Variables
2.1. Random Variables
2.2. Discrete Random Variables
2.3. Continuous Random Variables
2.4. Expectation of a Random Variable
2.5. Jointly Distributed Random Variables
2.6. Moment Generating Functions
2.7. Limit Theorems
2.8. Stochastic Processes
3. Conditional Probability and Conditional
Expectation
3.1. Introduction
3.2. The Discrete Case
3.3. The Continuous Case
3.4. Computing Expectations by Conditioning
3.5. Computing Probabilities by Conditioning
3.6. Some Applications
Exercises
4. Markov Chains
4.1. Introduction
4.2. Chapman-Kolmogorov Equations
4.3. Classification of States
4.4. Limiting Probabilities
4.5. Some Applications
4.6. Mean Time Spent in Transient States
4.7. Branching Processes
4.8. Time Reversible Markov Chains
4.9. Markov Chain Monte Carlo Methods
4.10. Markov Decision Processes
Exercises
References
5. The Exponential Distribution and the Poisson
Process
5.1. Introduction
5.2. The Exponential Distribution
5.3. The Poisson Process
5.4. Generalizations of the Poisson Process
Exercises
References
6. Continuous-Time Markov Chains
6.1. Introduction
6.2. Continuous-Time Markov Chains
6.3. Birth and Death Processes
6.4. The Transition Probability Function Pij (t)
6.5. Limiting Probabilities
6.6. Time Reversibility
6.7. Uniformization
6.8. Computing the Transition Probabilities
Exercises
References
7. Renewal Theory and Its Applications
7.1. Introduction
7.2. Distribution of N(t)
7.3. Limit Theorems and Their Applications
7.4. Renewal Reward Processes
7.5. Regenerative Processes
7.6. Semi-Markov Processes
7.7. The Inspection Paradox
7.8. Computing the Renewal Function
7.9. Applications to Patterns
7.10. The Insurance Ruin Problem
Exercises
References
8. Queueing Theory
8.1. Introduction
8.2. Preliminaries
8.3. Exponential Models
8.4. Network of Queues
8.5. The System M/G/1
8.6. Variations on the M/G/1
8.7. The Model G/M/1
8.8. A Finite Source Model
8.9. Multiserver Queues
Exercises
References
9. Reliability Theory
9.1. Introduction
9.2. Structure Functions
9.3. Reliability of Systems of Independent Components
9.4. Bounds on the Reliability Function
9.5. System Life as a Function of Component Lives
9.6. Expected System Lifetime
9.7. Systems with Repair
Exercises
References
10. Brownian Motion and Stationary Processes
10.1. Brownian Motion
10.2. Hitting Times, Maximum Variable, and the Gambler's Ruin Problem
10.3. Variations on Brownian Motion
10.4. Pricing Stock Options
10.5. White Noise
10.6. Gaussian Processes
10.7. Stationary andWeakly Stationary Processes
10.8. Harmonic Analysis of Weakly Stationary Processes
Exercises
References
11. Simulation
11.1. Introduction
11.2. General Techniques for Simulating Continuous Random Variables
11.3. Special Techniques for Simulating Continuous Random Variables
11.4. Simulating from Discrete Distributions
11.5. Stochastic Processes
11.6. Variance Reduction Techniques
11.7. Determining the Number of Runs
11.8. Coupling from the Past
Exercises
References
Appendix: Solutions to Starred Exercises
Index


Last updated 03/07/2006