MATH 171

Stochastic Processes

Description: Lecture, three hours; discussion, one hour. Requisites: courses 33A, 170E (or 170A or Statistics 100A). Discrete Markov chains, continuous-time Markov chains, renewal theory. P/NP or letter grading.

Units: 4.0
2 of 2

M Palmer

Overall Rating N/A
Easiness N/A/ 5
Clarity N/A/ 5
Workload N/A/ 5
Helpfulness N/A/ 5
Most Helpful Review
No reviews have been written yet.

Elizaveta Rebrova

Overall Rating N/A
Easiness N/A/ 5
Clarity N/A/ 5
Workload N/A/ 5
Helpfulness N/A/ 5
Most Helpful Review
No reviews have been written yet.
AD

Thomas Richthammer

Overall Rating 3.4
Easiness 1.0/ 5
Clarity 3.8/ 5
Workload 1.0/ 5
Helpfulness 3.8/ 5
Most Helpful Review
No reviews have been written yet.

Pierre Rodriguez

Overall Rating N/A
Easiness N/A/ 5
Clarity N/A/ 5
Workload N/A/ 5
Helpfulness N/A/ 5
Most Helpful Review
No reviews have been written yet.

Palina Salanevich

Overall Rating N/A
Easiness N/A/ 5
Clarity N/A/ 5
Workload N/A/ 5
Helpfulness N/A/ 5
Most Helpful Review
No reviews have been written yet.

Martin Tassy

Overall Rating N/A
Easiness N/A/ 5
Clarity N/A/ 5
Workload N/A/ 5
Helpfulness N/A/ 5
Most Helpful Review
No reviews have been written yet.
AD

Moritz Voss

Overall Rating N/A
Easiness N/A/ 5
Clarity N/A/ 5
Workload N/A/ 5
Helpfulness N/A/ 5
Most Helpful Review
No reviews have been written yet.

Chuntian Wang

Overall Rating N/A
Easiness N/A/ 5
Clarity N/A/ 5
Workload N/A/ 5
Helpfulness N/A/ 5
Most Helpful Review
No reviews have been written yet.

TIANQI WU

Overall Rating N/A
Easiness N/A/ 5
Clarity N/A/ 5
Workload N/A/ 5
Helpfulness N/A/ 5
Most Helpful Review
No reviews have been written yet.

Changyong Yin

Overall Rating N/A
Easiness N/A/ 5
Clarity N/A/ 5
Workload N/A/ 5
Helpfulness N/A/ 5
Most Helpful Review
No reviews have been written yet.
AD
2 of 2