Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
Learn about combinatorial applications of linearity of expectations in this mathematics lecture from MIT's Probabilistic Methods in Combinatorics course. Explore two key examples - calculating the number of fixed points in random permutations and analyzing Hamilton paths in tournaments - to understand how expectation linearity principles can solve complex combinatorial problems. Through clear explanations by Professor Yufei Zhao, master fundamental concepts that bridge probability theory and combinatorial mathematics.
