MATH 691 Course Syllabus

NJIT HONOR CODE:  All Students should be aware that the Department of Mathematical Sciences takes the NJIT Honor Code very seriously and enforces it strictly.  This means that there must not be any forms of plagiarism, i.e., copying of homework, class projects, or lab assignments, or any form of cheating in quizzes and exams.  Under the Honor Code, students are obligated to report any such activities to the Instructor.

 

Math 691-101:  Stochastic Processes with Applications

FALL 2009

 

Instructor:  Prof. Bhattacharjee

Textbook:  Introduction to Probability Models, 9th Edition by S. M. Ross. Academic Press © 2007; ISBN: 0-12-598062-0.

Prerequisites:  Math 662.

Grading Policy:  The final grade in this course will be determined using the following weight distributions over the performance components: (H),(M),(F). The weight distribution is subject to marginal modification. 

Homework (H):

35%

Midterm Examination (M):

30%

Final Examination (F):

35%


 

Drop Date:  Please note that the University Drop Date November 2, 2009 deadline will be strictly enforced.

Attendance Policy:  Students must attend all classes. Absences from class will inhibit your ability to fully participate in class discussions. Tardiness to class is very disruptive to the instructor and students and will not be tolerated.

Examinations:  One in-class midterm examination and one final examination will be given on the following days:

Midterm Examination:

October 15, 2009

Final Examination:

December 17, 2009

 

Makeup Exam Policy:  There will be No make-up EXAMS during the semester. In the event the Final Exam is not taken, under rare circumstances where the student has a legitimate reason for missing the final exam, a makeup exam will be administered by the math department. In any case the student must notify the Math Department Office and the Instructor that the exam will be missed and present written verifiable proof of the reason for missing the exam, e.g., a doctors note, police report, court notice, etc., clearly stating the date AND time of the mitigating problem.

Further Assistance:  For further questions, students should contact their Instructor. All Instructors have regular office hours during the week. These office hours are listed at the link above by clicking on the Instructor’s name. Teaching Assistants are also available in the math learning center.

Cellular Phones:  All cellular phones and beepers must be switched off during all class times.


 

MATH DEPARTMENT CLASS POLICIES LINK 

All DMS students must familiarize themselves with and adhere to the Department of Mathematical Sciences Course Policies, in addition to official university-wide policies. DMS takes these policies very seriously and enforces them strictly. For DMS Course Policies, please click here.

September 7, 2009

M

Labor Day Holiday ~ University Closed

November 2, 2009

M

Last Day to Withdraw from this course

November 24, 2009

T

Classes follow a Thursday Schedule

November 25, 2009

W

Classes follow a Friday Schedule

November 26-29, 2009

R-Su

Thanksgiving Recess ~ University Closed


 

Course Outline:

 

Week
Dates

Topics

Notes

 

Week 1
9/3

Poisson Processes - I

Introductory examples, definitions, properties

Typical applications

 

Week 2
9/10

Poisson Processes - II

Relationship to exponential distribution

Interarrival and waiting times

 

Week 3
9/17

Poisson Processes - III

Nonhomogenious Poisson processes

Compound and mixed Poisson processes

 

Week 4
9/24

Renewal Processes - I

The Renewal function

Examples and Applications

Associated renewal theorems

 

Week 5
10/1

Renewal Processes - II

The Poisson process as a renewal process

Computing the renewal function

Renewal reward processes

 

Week 6
10/8

Renewal Processes - III

Alternating renewal processes

Replacement problems

 

Week 7
10/15

└►  MIDTERM EXAM:  Thursday ~ October 15, 2009

Week 8
10/22

Discrete Time Finite / Countable Markov Chains - I

Introductory examples, definitions, time homogeneous chains

Transition probability, probability matrix

Communicating classes, classification of states

 

Week 9
10/29

Discrete Time Finite / Countable Markov Chains - II

Recurrence and Transience

Return times

 

└►

(Mon. Nov. 2) Last Day to Withdraw from this course

Week 10
11/5

Discrete Time Finite / Countable Markov Chains - III

Long run behavior, Stationary distribution

Absorbing chains, time to absorption

 

Week 11
11/12

Continuous Time Markov Chains - I

Definitions, Motivating examples,

Application: Poisson process

Applications: special cases of Birth and death processes

 

Week 12
11/19

Continuous Time Markov Chains - II

Finite time transition probabilities

Backward and forward Kolmoroff differential equations

Infinitesimal generators, the embedded Markov chain and classification of states

 

└►

(Tues. Nov. 24) Classes Follow A Thursday Schedule

Week 13
11/24

Continuous Time Markov Chains - III

Basic limit theorem for continuous time Markov chains

General Birth and Death Processes

Applications: queues, epidemic models

 

└►

(Thurs.-Sun. Nov. 26-29) Thanksgiving Recess ~ University Closed

Week 14
12/3

Final Review

└► Review for Final

└► Study for Final

 

Final

Final EXAM:  Thursday ~ December 17, 2009

 

 

Prepared By:  Prof. Manish Bhattacharjee

Last revised:  August 3, 2009

TOP     Print-friendly page