Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture explores the relationship between convergence in probability and almost sure convergence. It demonstrates through a counterexample how a sequence can converge in probability but not almost surely, using a sequence of highly correlated random variables. The instructor proves that almost sure convergence implies convergence in probability, and discusses the differences between the two notions. Additionally, the lecture addresses the concept that two random variables cannot be equal in probability, only almost surely. The proof involves analyzing the probabilities of the difference between two random variables exceeding a certain value. The lecture concludes by highlighting the key distinctions between convergence in probability and almost sure convergence.