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 covers the fundamentals of probability theory, focusing on Markov's theorem and Chernoff bound. It explains the concept of good coloring, 2-colorable graphs, and hypergraphs. The instructor discusses quantitative and qualitative statements, central limit theorem, and independence of random variables. The lecture also delves into the Chernoff bound, Taylor expansion, and the existence of rare and common events.