<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="ru">
	<id>https://www.wikicshse.ru/index.php?action=history&amp;feed=atom&amp;title=Stochastic_processes_and_applications_DSBA_2025%2F2026</id>
	<title>Stochastic processes and applications DSBA 2025/2026 - История изменений</title>
	<link rel="self" type="application/atom+xml" href="https://www.wikicshse.ru/index.php?action=history&amp;feed=atom&amp;title=Stochastic_processes_and_applications_DSBA_2025%2F2026"/>
	<link rel="alternate" type="text/html" href="https://www.wikicshse.ru/index.php?title=Stochastic_processes_and_applications_DSBA_2025/2026&amp;action=history"/>
	<updated>2026-06-06T12:14:30Z</updated>
	<subtitle>История изменений этой страницы в вики</subtitle>
	<generator>MediaWiki 1.45.3</generator>
	<entry>
		<id>https://www.wikicshse.ru/index.php?title=Stochastic_processes_and_applications_DSBA_2025/2026&amp;diff=728&amp;oldid=prev</id>
		<title>imported&gt;Agpopov: Migrated current public revision from wiki.cs.hse.ru</title>
		<link rel="alternate" type="text/html" href="https://www.wikicshse.ru/index.php?title=Stochastic_processes_and_applications_DSBA_2025/2026&amp;diff=728&amp;oldid=prev"/>
		<updated>2025-11-15T08:47:46Z</updated>

		<summary type="html">&lt;p&gt;Migrated current public revision from wiki.cs.hse.ru&lt;/p&gt;
&lt;p&gt;&lt;b&gt;Новая страница&lt;/b&gt;&lt;/p&gt;&lt;div&gt;=== Course goals ===&lt;br /&gt;
&lt;br /&gt;
侍には目標がなく道しかない [Samurai niwa mokuhyō ga naku michi shikanai]&lt;br /&gt;
&lt;br /&gt;
A samurai has no goal, only a path.&lt;br /&gt;
&lt;br /&gt;
Course [https://github.com/bdemeshev/hse_panda_metrics_2024_2025/raw/main/whitepaper.pdf whitepaper]&lt;br /&gt;
&lt;br /&gt;
Telegram [https://t.me/+1Ig_jZc8RYc5Mjgy chat] (не берёт на парковке)&lt;br /&gt;
&lt;br /&gt;
Hand made [https://e.pcloud.link/publink/show?code=kZj5BOZAb8qNTSGI6LiGLeLWvMd4LMu4hsk videos with love]!&lt;br /&gt;
&lt;br /&gt;
Class notes [https://disk.360.yandex.ru/d/ViBiodE8BPk2Aw disk]&lt;br /&gt;
&lt;br /&gt;
=== Home assignments, exams and grading ===&lt;br /&gt;
&lt;br /&gt;
Stochastic Processes = 0.35 Halloween Exam + 0.40 Ded Moroz Exam + 0.25 Home Assignments&lt;br /&gt;
&lt;br /&gt;
[https://github.com/bdemeshev/hse_panda_stochastic_2025_fall/raw/main/home_assignments/home_assignments.pdf Home assignments!]&lt;br /&gt;
&lt;br /&gt;
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. &lt;br /&gt;
&lt;br /&gt;
[https://github.com/bdemeshev/tssp_exams/raw/main/tssp_exams.pdf Past exams]&lt;br /&gt;
&lt;br /&gt;
[https://github.com/bdemeshev/stochastic_pro/raw/main/stochastic_pro.pdf Exercise collection]&lt;br /&gt;
&lt;br /&gt;
== Samurai diary: Stochastic Process ==&lt;br /&gt;
&lt;br /&gt;
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]&lt;br /&gt;
&lt;br /&gt;
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. &lt;br /&gt;
&lt;br /&gt;
2025-10-07, lecture 6: Convergence in probability. Convergence almost surely. Convergence in mean. Convergence in distribution. Examples. Relationship between convergence modes wo proof.&lt;br /&gt;
&lt;br /&gt;
2025-11-11, lecture 9: Три определения пуассоновского потока и (на 75%) доказательство их эквивалентности. Через экспоненциальное, через Пуассона и через о-малые. Формулировку свойств минимума экспоненциальных распределений без доказательств. Определение марковской цепи в непрерывном времени (через экспоненциальные времена в каждом состоянии).&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== Classes  ===&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
2025-09-06, class 1:&lt;br /&gt;
&lt;br /&gt;
== Sources of Wisdom ==&lt;br /&gt;
&lt;br /&gt;
[https://github.com/bdemeshev/stochastic_pro/raw/main/stochastic_pro.pdf StoPro]: Problems in Stochastic Processes&lt;br /&gt;
&lt;br /&gt;
[https://projects.iq.harvard.edu/stat110/home In2Pro]: Blitstein, Hwang, Introduction to probability.&lt;br /&gt;
&lt;br /&gt;
[https://www.statslab.cam.ac.uk/~rrw1/markov/M.pdf Mchains] Cambridge lectures on Markov chains.&lt;br /&gt;
&lt;br /&gt;
[https://aditya-sengupta.github.io/expository/markovtex.pdf MarkovTex]: Representing Markov Chains in Latex.&lt;br /&gt;
&lt;br /&gt;
[https://www.stat.berkeley.edu/~aldous/150/takis_exercises.pdf Takis]: Takis Konstantinopulos, One hundred solved exercises on Markov chains.&lt;br /&gt;
&lt;br /&gt;
[https://courses.cit.cornell.edu/econ620/reviewm6.pdf Convergence modes] review from Cornell university&lt;br /&gt;
&lt;br /&gt;
[https://www.ee.iitb.ac.in/~sarva/courses/EE325/2014/Slides/ConvergenceOfRVs.pdf Convergence modes]: Saravan Vijayakumaran, convergence modes with examples&lt;br /&gt;
&lt;br /&gt;
[https://staff.fnwi.uva.nl/p.j.c.spreij/onderwijs/master/aadtimeseries2010.pdf ts2010]: Aad van der Vaart, Time Series course with hardcore math&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
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].&lt;/div&gt;</summary>
		<author><name>imported&gt;Agpopov</name></author>
	</entry>
</feed>