This text presents selected applications of discrete-time stochastic processes that involve random interactions and algorithms, and revolve around the Markov property. It covers recurrence properties of (excited) random walks, convergence and mixing of Markov chains, distribution modeling using phase-type distributions, applications to search engines and probabilistic automata, and an introduction to the Ising model used in statistical physics. Applications to data science are also considered via hidden Markov models and Markov decision processes. A total of 32 exercises and 17 longer problems are provided with detailed solutions and cover various topics of interest, including statistical learning.

Delves into the foundations of random processes, helping readers excel in machine learning and applied sciences Includes algorithms and codes for practice and illustration purposes Request lecturer material: sn.pub/lecturer-material

Autorentext

The author is a professor from the Nanyang Technological University (NTU) and is well-established in the field of stochastic processes and a highly respected probabilist. He has authored the books, Stochastic Analysis in Discrete and Continuous Settings: With Normal Martingales, Lecture Notes in Mathematics, Springer, 2009, and Discrete Stochastic Processes - Tools for Machine Learning and Data Science, Springer Undergraduate Mathematics Series 2024, and was a co-editor for the book, Stochastic Analysis with Financial Applications, Progress in Probability, Vol. 65, Springer Basel, 2011. Aside from these four Springer titles, he has authored several others. The manuscript has been developed over the years from his courses on Stochastic Processes at NTU.

Inhalt

• 1. A Summary of Markov Chains.- 2. Phase-Type Distributions.- 3. Synchronizing Automata.- 4. Random Walks and Recurrence.- 5. Cookie-Excited Random Walks.- 6. Convergence to Equilibrium.- 7. The Ising Model.- 8. Search Engines.- 9. Hidden Markov Model.- 10. Markov Decision Processes.