Insegnamento a.a. 2024-2025

30561 - STOCHASTIC PROCESSES AND SIMULATION IN NATURAL SCIENCES

Department of Computing Sciences

Course taught in English

Class timetable
Exam timetable
Go to class group/s: 27
BAI (8 credits - II sem. - OB  |  4 credits FIS/02  |  4 credits MAT/06)
Course Director:
GIACOMO ZANELLA

Classes: 27 (II sem.)
Instructors:
Class 27: GIACOMO ZANELLA


Suggested background knowledge

Linear algebra, calculus, probability, basic statistics Basic Python and some familiarity with numpy

Mission & Content Summary

MISSION

The aim of the course is to introduce the theoretical and numerical tools for the analysis and simulation of stochastic and natural processes, which are ubiquitous in many of the program's other subjects.

CONTENT SUMMARY

  • Discrete-time Markov chains
  • Poisson processes and other continuous-time stochastic models
  • Stochastic simulation and Monte Carlo methods
  • Numerical methods for ordinary differential equations

Intended Learning Outcomes (ILO)

KNOWLEDGE AND UNDERSTANDING

At the end of the course student will be able to...
  • Characterize and describe Monte Carlo and Markov Chain Monte Carlo methods
  • Formulate probabilistic models based on Markov chains, Poisson processes and other continuous time processes
  • Analyze the above stochastic processes using probability theory and other mathematical tools
  • List and explain fundamental methods to solve numerically differential equations
  • Recognize numerical issues and identify workaround strategies
  • Estimate the computational cost of implementing all of the above

APPLYING KNOWLEDGE AND UNDERSTANDING

At the end of the course student will be able to...
  • Translate phenomena involving randomness and uncertainty into appropriate probabilistic models
  • Characterize the average and long-run behavior of a given stochastic process
  • Determine whether a Monte Carlo method is appropriate for a task, and if so choose the best approach
  • Develop a Markov Chain Monte Carlo algorithm for a given problem
  • Simulate a process described by a set of differential equations

Teaching methods

  • Lectures
  • Practical Exercises
  • Collaborative Works / Assignments

DETAILS

The teaching method is face-to-face lectures.


Assessment methods

  Continuous assessment Partial exams General exam
  • Written individual exam (traditional/online)
  x x
  • Collaborative Works / Assignment (report, exercise, presentation, project work etc.)
x    

ATTENDING AND NOT ATTENDING STUDENTS

The written exam will contain theoretical questions and exercises, intended to verify that the students have acquired both the basic mathematical knowledge (about discrete and continuous time stochastic processes) and the analytical skills to relate the different techniques to given problem instances. For the written exam, students can either take the two partial exams or directly the general exam. After (optionally) taking the first partial exam, students can decide whether to take the second partial exam or to ignore the grade of the first partial exam and directly take the general exam.

 

The group project will consist in implementing from scratch a simulation or a numerical method for a problem that was not discussed in class. The students can demonstrate that they have internalized the theoretical aspects, that they can design a strategy and implement it in code.

 

The written exam (either general or partials) will form 80% of the final grade, and the group project the remaining 20%. The final grade will be the sum of the two grades.


Teaching materials


ATTENDING AND NOT ATTENDING STUDENTS

The main teaching material for the first half of the course (dealing with stochastic processes) will be typesetted lecture notes. Additional textbook references for that part will be: "Markov Chains" by J.Norris; Cambridge University Press; "Introduction to probability models" by S.M. Ross; 12th edition, Academic Press; "Essentials of Stochastic Processes" by R.Durrett; 3rd edition, Springer.

The material for the second part of the course (dealing with numerical methods and more elaborate examples) will be determined later on.

Last change // :