Stochastic Processes (FSI-SSP)

Academic year 2023/2024
Supervisor: doc. Mgr. Zuzana Hübnerová, Ph.D.  
Supervising institute: ÚM all courses guaranted by this institute
Teaching language: Czech
Aims of the course unit:
The course objective is to make students familiar with the principles of the theory of stochastic processes and models used for the analysis of time series as well as with estimation algorithms of their parameters. At seminars, students apply theoretical procedures on simulated or real data using suitable software. The semester is concluded with a project of analysis and prediction of a real stochastic process.
Learning outcomes and competences:

The course provides students with basic knowledge of modeling stochastic processes (Markov chain, decomposition, ARMA) and ways to estimate their assorted characteristics in order to describe the mechanism of the process behavior on the basis of its sample path. Students learn basic methods used for real data evaluation.
Prerequisites:
Rudiments of the differential and integral calculus, probability theory, and mathematical statistics.
Course contents:

The course provides an introduction to the theory of stochastic processes. The following topics are dealt with: types and basic characteristics, Markov chains, stationarity, autocovariance function, spectral density, examples of typical processes, parametric and nonparametric methods of decomposition of stochastic processes, identification of periodic components, ARMA processes. Students will learn the applicability of the methods for the description and prediction of the stochastic processes using suitable software on PC.
Teaching methods and criteria:
The course is taught through lectures explaining the basic principles and theory of the discipline. Exercises are focused on practical topics presented in lectures.
Assesment methods and criteria linked to learning outcomes:

Course-unit credit requirements: active participation in seminars, demonstration of basic skills in practical data analysis on PC in a project, and succesfull solution of possible written tests.

Examination: oral exam, questions are selected from a list of 3 set areas (30+30+40 points). At least a basic knowledge of the terms and their properties is required in each of the areas. Evaluation by points: excellent (90 - 100 points), very good (80 - 89 points), good (70 - 79 points), satisfactory (60 - 69 points), sufficient (50 - 59 points), failed (0 - 49 points).
Controlled participation in lessons:
Attendance at seminars is compulsory whereas the teacher decides on the compensation for absences.
Type of course unit:
    Lecture  13 × 2 hrs. optionally                  
    Computer-assisted exercise  13 × 1 hrs. compulsory                  
Course curriculum:
    Lecture

Stochastic process, types.
Makov chains.
Strict and weak stationarity.
Autocorrelation function. Sample autocorrelation function.
Decomposition model (additive, multiplicative), variance stabilization, trend estimation in model without seasonality: (polynomial regression, linear filters)
Trend estimation in model with seasonality. Randomness tests.
Linear processes.
ARMA(1,1) processes. Asymptotic properties of the sample mean and autocorrelation function.
Best linear prediction in ARMA(1,1), Durbin-Levinson, and Innovations algorithm.
ARMA(p,q) processes, causality, invertibility, partial autocorrelation function.
Spectral density function (properties).
Identification of periodic components: periodogram, periodicity tests.
Best linear prediction, Yule-Walker system of equations, prediction error.
ARIMA processes and nonstationary stochastic processes.
    Computer-assisted exercise

Markov chains.
Input, storage, and visualization of data, simulation of stochastic processes.
Moment characteristics of a stochastic process.
Detecting heteroscedasticity. Transformations stabilizing variance (power and Box-Cox transform).
Use of linear regression model on time series decomposition.
Estimation of polynomial degree for trend and separation of periodic components.
Denoising by means of linear filtration (moving average): design of optimal weights preserving polynomials up to a given degree, Spencer's 15-point moving average.
Filtering by means of stepwise polynomial regression, exponential smoothing.
Randomness tests.
Simulation, identification, parameters estimate, and verification for ARMA model.
Prediction of process.
Testing significance of (partial) correlations.
Identification of periodic components, periodogram, and testing.
Tutorials on student projects.
Literature - fundamental:
1. Brockwell, P.J. - Davis, R.A. Introduction to time series and forecasting. 3rd ed. New York: Springer, 2016. 425 s. ISBN 978-3-319-29852-8.
3. Brockwell, P.J. - Davis, R.A. Time series: Theory and Methods. 2-nd edition 1991. New York: Springer. ISBN 978-1-4419-0319-8.
Literature - recommended:
1. Ljung, L. System Identification-Theory For the User. 2nd ed. PTR Prentice Hall : Upper Saddle River, 1999.
2. Hamilton, J.D. Time series analysis. Princeton University Press, 1994. xiv, 799 s. ISBN 0-691-04289-6.
The study programmes with the given course:
Programme Study form Branch Spec. Final classification   Course-unit credits     Obligation     Level     Year     Semester  
N-MAI-P full-time study --- no specialisation -- Cr,Ex 5 Compulsory 2 1 S