Name | Role | Office | Office hours | Zoom link | |
Yuriy Nemish | Instructor | - | ynemish@ucsd.edu |
|
link |
Jiaqi Liu | Teaching Assistant | - | jil1131@ucsd.edu |
| link |
Please, check the following calendar for possible reschedulings of the office hours.
Date | Time | Zoom link | |
Live Q&A (YN) | Monday, Wednesday, Friday | 5:00 - 5:30pm | link |
Discussion A01 (Liu) | Thursday | 1:00 - 1:50pm | link |
Discussion A02 (Liu) | Thursday | 2:00 - 2:50pm | link |
Top
Week | Date | Time | |
Quiz 1 | 2 | Wednesday, Oct 14 | see Quizzes |
Quiz 2 | 3 | Wednesday, Oct 21 | see Quizzes |
Midterm Exam 1 | 4 | Wednesday, Oct 28 | see Midterm Exams |
Quiz 3 | 5 | Wednesday, Nov 4 | see Quizzes |
Quiz 4 | 7 | Wednesday, Nov 18 | see Quizzes |
Midterm Exam 2 | 8 | Monday, Nov 23 | see Midterm Exams |
Quiz 5 | 10 | Wednesday, Dec 9 | see Quizzes |
Final Exam | Finals | Thursday, Dec 17 | 7pm - 10pm; see Final Exam |
Top
Welcome to Math 180C: a one quarter course introduction to stochastic processes (II). According to the UC San Diego Course Catalog, the topics covered are Markov chains in discrete and continuous time, random walk, recurrent events and other topics.
Here is a more detailed listing of course topics, in the sequence they will be covered, together with the relevant section(s) of the textbook. While each topic corresponds to approximately one lecture, there will be some give and take here. This is a rough schedule that will be updated during the term.
Q&A | Week | Topic | PK | Durrett | Slides | Lecture videos | Additional videos | Empty slides |
---|---|---|---|---|---|---|---|---|
10/2 | 0 | Administrivia | 1.1 | - | - | - | - | - |
10/5 | 1 | Birth processes | 6.1 | - | Slides 1 | Lecture 1 | - | - |
10/7 | 1 | Birth processes | 6.1 | - | Slides 2 | Lecture 2 | - | Slides 2 |
10/9 | 1 | Birth and death processes | 6.2 - 6.3 | - | Slides 3 | Lecture 3 | - | Slides 3 |
10/12 | 2 | Strong Markov property. Hitting probabilities | 6.5 | - | Slides 4 | Lecture 4 | - | Slides 4 |
10/14 | 2 | General continuous-time Markov chains. Q-matrices. Matrix exponentials | 6.6 | 4.1 | Slides 5 | Lecture 5 | - | Slides 5 |
10/16 | 2 | General continuous-time Markov chains. Q-matrices. Matrix exponentials | 6.6 | 4.1 | Slides 6 | Lecture 6 | - | Slides 6 |
10/19 | 3 | First step analysis for general Markov chains | 6.5, 6.6 | 4.4 | Slides 7 | Lecture 7 | - | Slides 7 |
10/21 | 3 | Kolmogorov forward and backward equations | 6.3, 6.6 | 4.2 | Slides 8 | Lecture 8 | - | Slides 8 |
10/23 | 3 | Stationary distributions and long-run behavior | 6.4, 6.6 | 4.3 | Slides 9 | Lecture 9 | - | Slides 9 |
10/26 | 4 | Review | - | - | Practice Midterm 1 | Solutions | - | |
10/28 | 4 | Midterm 1 | ||||||
10/30 | 4 | Conditioning on a continuous random variable | 2.4 | - | Slides 10 | Lecture 10 | - | Slides 10 |
11/2 | 5 | Introduction to renewal processes | 7.1 | 3.1 | Slides 11 | Lecture 11 | - | Slides 11 |
11/4 | 5 | Poisson process as a renewal processes | 7.3 | 3.1 | Slides 12 | Lecture 12 | - | Slides 12 |
11/6 | 5 | Examples of renewal processes | 7.2 - 7.3 | 3.1 | Slides 13 | Lecture 13 | - | Slides 13 |
11/9 | 6 | Asymptotic results for renewal processes | 7.4 | 3.1, 3.3 | Slides 14-15 | Lectures 14-15 | - | Slides 14-15 |
11/11 | 6 | Veterans Day | ||||||
11/13 | 6 | Asymptotic results for renewal processes | 7.4 | 3.1, 3.3 | Slides 14-15 | Lectures 14-15 | - | Slides 14-15 |
11/16 | 7 | Generalizations of renewal processes | 7.5 | 3.1, 3.3 | Slides 16 | Lecture 16 | - | Slides 16 |
11/18 | 7 | Generalizations of renewal processes | 7.5 | 3.1, 3.3 | Slides 17 | Lecture 17 | - | Slides 17 |
11/20 | 7 | Review | - | - | Practice Midterm 2 | Solutions | - | |
11/23 | 8 | Midterm 2 | ||||||
11/25 | 8 | Martingales | 2.5 | 5.1 - 5.2 | Slides 18 | Lecture 18 | - | Slides 18 |
11/27 | 8 | Thanksgiving | ||||||
11/30 | 9 | Definition of Brownian motion | 8.1 | - | Slides 19 | Lecture 19 | - | Slides 19 |
12/2 | 9 | Basic properties of Brownian motion | 8.1 | - | Slides 20 | Lecture 20 | - | Slides 20 |
12/4 | 9 | The reflection principle | 8.2 | - | Slides 21 | Lecture 21 | - | Slides 21 |
12/7 | 10 | Processes derived from Brownian motion | 8.3-8.4 | - | Slides 22-23 | Lecture 22-23 | - | Slides 22-23 |
12/9 | 10 | Processes derived from Brownian motion | 8.3-8.4 | - | - | - | - | |
12/11 | 10 | Review | - | - | - | - | - |
Prerequisite: MATH 180B or concent of instructor.
Lecture: You are responsible for material presented in the lecture whether or not it is discussed in the textbook. You should expect questions on the exams that will test your understanding of concepts discussed in the lecture.
Homework: Homework assignments are posted below, and will be due at 11:59pm on the indicated due date. You must turn in your homework through Gradescope; if you have produced it on paper, you can scan it or simply take clear photos of it to upload. Your lowest homework score will be dropped. It is allowed and even encouraged to discuss homework problems with your classmates and your instructor and TA, but your final write up of your homework solutions must be your own work.
Quizzes: The quizzes will take place on the dates listed above.
Midterm Exams: The midterm exams will take place on October 28 and November 23 as listed above.
Final Exam: The final examination will be held at the officially scheduled time: 7pm - 10pm (PST) on December 17.
Exam policies
Administrative Links: Here are two links regarding UC San Diego policies on exams:
Regrade Policy:
Grading: Your cumulative average will be computed as the best of the following weighted averages:
Your course grade will be determined by your cumulative average at the end of the quarter, and will be based on the following scale:
A+ | A | A- | B+ | B | B- | C+ | C | C- |
97 | 93 | 90 | 87 | 83 | 80 | 77 | 73 | 70 |
The above scale is guaranteed: for example, if your cumulative average is 80, your final grade will be at least B-. However, your instructor may adjust the above scale to be more generous.
Academic Integrity: UC San Diego code of academic integrity outlines the expected academic honesty of all studentd and faculty, and details the consequences for academic dishonesty. The main issues are cheating and plagiarism, of course, for which we have a zero-tolerance policy. (Penalties for these offenses always include assignment of a failing grade in the course, and usually involve an administrative penalty, such as suspension or expulsion, as well.) However, academic integrity also includes things like giving credit where credit is due (listing your collaborators on homework assignments, noting books or papers containing information you used in solutions, etc.), and treating your peers respectfully in class. In addition, here are a few of our expectations for etiquette in and out of class.
Top
Weekly homework assignments are posted here. Homework is due by 11:59pm on the posted date, through Gradescope. Late homework will not be accepted.