Heuristically, the probability of an event is a frequency with which it occurs if we do the same experiment infinitely many times. In the axiomatic formalism put forward by Kolmogorov, this corresponds to considering an infinite sequence of independent identically distributed random variables. The law of large numbers confirms the heuristics and proves that the average of the first N random variables approaches their common expected value, as N tends to infinity.
In this lecture, we will show a weak version of this statement in the case of discrete random variables. The proof is rather short and is based on Chebyshev’s inequality.
Weak law of large numbers
12.01.2022 13:00 - 14:00
Organiser:
Christian Krattenthaler
Location:
Zoom Meeting