Stochastic processes and applications DSBA 2025/2026 - История изменений

Agpopov в 08:47, 15 ноября 2025

2025-11-15T08:47:46Z

← Предыдущая версия		Версия от 08:47, 15 ноября 2025
Строка 32:		Строка 32:

	2025-10-07, lecture 6: Convergence in probability. Convergence almost surely. Convergence in mean. Convergence in distribution. Examples. Relationship between convergence modes wo proof.		2025-10-07, lecture 6: Convergence in probability. Convergence almost surely. Convergence in mean. Convergence in distribution. Examples. Relationship between convergence modes wo proof.

			2025-11-11, lecture 9: Три определения пуассоновского потока и (на 75%) доказательство их эквивалентности. Через экспоненциальное, через Пуассона и через о-малые. Формулировку свойств минимума экспоненциальных распределений без доказательств. Определение марковской цепи в непрерывном времени (через экспоненциальные времена в каждом состоянии).

Agpopov в 16:22, 8 октября 2025

2025-10-08T16:22:53Z

← Предыдущая версия		Версия от 16:22, 8 октября 2025
Строка 30:		Строка 30:

	2025-09-30, lecture 5: Irreducible chain. Proportion of life spent at a node wo proof. Knight on the chessboard problem. Stationary state. Period of a node. Aperiodic node. Existence of a stationary distribution wo proof. Convergence to a stationary distribution wo proof.		2025-09-30, lecture 5: Irreducible chain. Proportion of life spent at a node wo proof. Knight on the chessboard problem. Stationary state. Period of a node. Aperiodic node. Existence of a stationary distribution wo proof. Convergence to a stationary distribution wo proof.

			2025-10-07, lecture 6: Convergence in probability. Convergence almost surely. Convergence in mean. Convergence in distribution. Examples. Relationship between convergence modes wo proof.

Agpopov в 12:16, 30 сентября 2025

2025-09-30T12:16:43Z

← Предыдущая версия		Версия от 12:16, 30 сентября 2025
Строка 28:		Строка 28:

	2025-09-02, lecture 1: Rules of the game, definition of a Markov chain, Chapman-Kolmogorov equations, calculation of n-step transition probabilities, failed attempt to discuss first step analysis. Check 1.1-2.1 from [https://www.statslab.cam.ac.uk/~rrw1/markov/M.pdf Mchains]		2025-09-02, lecture 1: Rules of the game, definition of a Markov chain, Chapman-Kolmogorov equations, calculation of n-step transition probabilities, failed attempt to discuss first step analysis. Check 1.1-2.1 from [https://www.statslab.cam.ac.uk/~rrw1/markov/M.pdf Mchains]

			2025-09-30, lecture 5: Irreducible chain. Proportion of life spent at a node wo proof. Knight on the chessboard problem. Stationary state. Period of a node. Aperiodic node. Existence of a stationary distribution wo proof. Convergence to a stationary distribution wo proof.

Agpopov: Добавил ссылку на диск с конспектами

2025-09-30T12:13:13Z

Добавил ссылку на диск с конспектами

← Предыдущая версия		Версия от 12:13, 30 сентября 2025
Строка 10:		Строка 10:

	Hand made [https://e.pcloud.link/publink/show?code=kZj5BOZAb8qNTSGI6LiGLeLWvMd4LMu4hsk videos with love]!		Hand made [https://e.pcloud.link/publink/show?code=kZj5BOZAb8qNTSGI6LiGLeLWvMd4LMu4hsk videos with love]!

			Class notes [https://disk.360.yandex.ru/d/ViBiodE8BPk2Aw disk]

	=== Home assignments, exams and grading ===		=== Home assignments, exams and grading ===

Bdemeshev в 14:58, 2 сентября 2025

2025-09-02T14:58:13Z

← Предыдущая версия		Версия от 14:58, 2 сентября 2025
Строка 17:		Строка 17:
	[https://github.com/bdemeshev/hse_panda_stochastic_2025_fall/raw/main/home_assignments/home_assignments.pdf Home assignments!]		[https://github.com/bdemeshev/hse_panda_stochastic_2025_fall/raw/main/home_assignments/home_assignments.pdf Home assignments!]

	Almost surely every week a new home assignment will be published. You are not required to hand in the HA, but next class will include a quiz with one or two problems extremely similar to the HA. Once during the HA will be in the form of a computer assisted project. At the end of the course you have 5 honey pots: a right to rewrite 5 missed or badly written quizzes.		Almost surely every week a new home assignment will be published. You are not required to hand in the HA, but next class will include a quiz with one or two problems extremely similar to the HA. Once during the course HA will be in the form of a computer assisted project. At the end of the course you have 5 honey pots: a right to rewrite 5 missed or badly written quizzes.

	[https://github.com/bdemeshev/tssp_exams/raw/main/tssp_exams.pdf Past exams]		[https://github.com/bdemeshev/tssp_exams/raw/main/tssp_exams.pdf Past exams]

Bdemeshev в 14:56, 2 сентября 2025

2025-09-02T14:56:17Z

← Предыдущая версия		Версия от 14:56, 2 сентября 2025
Строка 15:		Строка 15:
	Stochastic Processes = 0.35 Halloween Exam + 0.40 Ded Moroz Exam + 0.25 Home Assignments		Stochastic Processes = 0.35 Halloween Exam + 0.40 Ded Moroz Exam + 0.25 Home Assignments

	[... Home assignments :)]		[https://github.com/bdemeshev/hse_panda_stochastic_2025_fall/raw/main/home_assignments/home_assignments.pdf Home assignments!]

	Almost surely every week a new home assignment will be published. You are not required to hand in the HA, but next class will include a quiz with one or two problems extremely similar to the HA. Once during the HA will be in the form of a computer assisted project. At the end of the course you have 5 honey pots: a right to rewrite 5 missed or badly written quizzes.		Almost surely every week a new home assignment will be published. You are not required to hand in the HA, but next class will include a quiz with one or two problems extremely similar to the HA. Once during the HA will be in the form of a computer assisted project. At the end of the course you have 5 honey pots: a right to rewrite 5 missed or badly written quizzes.

Bdemeshev в 14:19, 2 сентября 2025

2025-09-02T14:19:58Z

← Предыдущая версия		Версия от 14:19, 2 сентября 2025
Строка 8:		Строка 8:

	Telegram [https://t.me/+1Ig_jZc8RYc5Mjgy chat] (не берёт на парковке)		Telegram [https://t.me/+1Ig_jZc8RYc5Mjgy chat] (не берёт на парковке)

			Hand made [https://e.pcloud.link/publink/show?code=kZj5BOZAb8qNTSGI6LiGLeLWvMd4LMu4hsk videos with love]!

	=== Home assignments, exams and grading ===		=== Home assignments, exams and grading ===
Строка 14:		Строка 16:

	[... Home assignments :)]		[... Home assignments :)]

			Almost surely every week a new home assignment will be published. You are not required to hand in the HA, but next class will include a quiz with one or two problems extremely similar to the HA. Once during the HA will be in the form of a computer assisted project. At the end of the course you have 5 honey pots: a right to rewrite 5 missed or badly written quizzes.

	[https://github.com/bdemeshev/tssp_exams/raw/main/tssp_exams.pdf Past exams]		[https://github.com/bdemeshev/tssp_exams/raw/main/tssp_exams.pdf Past exams]
Строка 21:		Строка 25:
	== Samurai diary: Stochastic Process ==		== Samurai diary: Stochastic Process ==

	2025-09-02, lecture 1: Rules of the game, definition of a Markov chain, Chapman-Kolmogorov equations, calculation of n-step transition probabilities, failed attempt to discuss first step analysis. Check 1.1-2.1 from		2025-09-02, lecture 1: Rules of the game, definition of a Markov chain, Chapman-Kolmogorov equations, calculation of n-step transition probabilities, failed attempt to discuss first step analysis. Check 1.1-2.1 from [https://www.statslab.cam.ac.uk/~rrw1/markov/M.pdf Mchains]

Bdemeshev в 14:06, 2 сентября 2025

2025-09-02T14:06:59Z

← Предыдущая версия		Версия от 14:06, 2 сентября 2025
Строка 21:		Строка 21:
	== Samurai diary: Stochastic Process ==		== Samurai diary: Stochastic Process ==

	2025-09-02, lecture 1:		2025-09-02, lecture 1: Rules of the game, definition of a Markov chain, Chapman-Kolmogorov equations, calculation of n-step transition probabilities, failed attempt to discuss first step analysis. Check 1.1-2.1 from


Строка 27:		Строка 27:


	2025-09-06, class 1:		2025-09-06, class 1:

	== Sources of Wisdom ==		== Sources of Wisdom ==

Bdemeshev: Новая страница: «=== Course goals === 侍には目標がなく道しかない [Samurai niwa mokuhyō ga naku michi shikanai] A samurai has no goal, only a path. Course [https:/…»

2025-09-02T08:34:38Z

Новая страница: «=== Course goals === 侍には目標がなく道しかない [Samurai niwa mokuhyō ga naku michi shikanai] A samurai has no goal, only a path. Course [https:/…»

Новая страница

=== Course goals ===

侍には目標がなく道しかない [Samurai niwa mokuhyō ga naku michi shikanai]

A samurai has no goal, only a path.

Course [https://github.com/bdemeshev/hse_panda_metrics_2024_2025/raw/main/whitepaper.pdf whitepaper]

Telegram [https://t.me/+1Ig_jZc8RYc5Mjgy chat] (не берёт на парковке)

=== Home assignments, exams and grading ===

Stochastic Processes = 0.35 Halloween Exam + 0.40 Ded Moroz Exam + 0.25 Home Assignments

[... Home assignments :)]

[https://github.com/bdemeshev/tssp_exams/raw/main/tssp_exams.pdf Past exams]

[https://github.com/bdemeshev/stochastic_pro/raw/main/stochastic_pro.pdf Exercise collection]

== Samurai diary: Stochastic Process ==

2025-09-02, lecture 1:

=== Classes ===

2025-09-06, class 1:

== Sources of Wisdom ==

[https://github.com/bdemeshev/stochastic_pro/raw/main/stochastic_pro.pdf StoPro]: Problems in Stochastic Processes

[https://projects.iq.harvard.edu/stat110/home In2Pro]: Blitstein, Hwang, Introduction to probability.

[https://www.statslab.cam.ac.uk/~rrw1/markov/M.pdf Mchains] Cambridge lectures on Markov chains.

[https://aditya-sengupta.github.io/expository/markovtex.pdf MarkovTex]: Representing Markov Chains in Latex.

[https://www.stat.berkeley.edu/~aldous/150/takis_exercises.pdf Takis]: Takis Konstantinopulos, One hundred solved exercises on Markov chains.

[https://courses.cit.cornell.edu/econ620/reviewm6.pdf Convergence modes] review from Cornell university

[https://www.ee.iitb.ac.in/~sarva/courses/EE325/2014/Slides/ConvergenceOfRVs.pdf Convergence modes]: Saravan Vijayakumaran, convergence modes with examples

[https://staff.fnwi.uva.nl/p.j.c.spreij/onderwijs/master/aadtimeseries2010.pdf ts2010]: Aad van der Vaart, Time Series course with hardcore math

Past course iterations: [http://wiki.cs.hse.ru/Tssp-2024-25 2024-2025], [http://wiki.cs.hse.ru/Tssp-2023-24 2023-2024], [http://wiki.cs.hse.ru/Tssp-2022-23 2022-2023], [http://wiki.cs.hse.ru/Time_Series_and_Stochastic_Processes_ada_21_22 2021-2022], [http://wiki.cs.hse.ru/Time_Series_and_Stochastic_Processes_ada_20_21 2020-2021].