Skip to main content

Monte Carlo Approximation

Let X1,X2,X_1, X_2, \ldots be a sequence of i.i.d. random variables with mean μ\mu we have Mn=1ni=1nXiM_n = \frac{1}{n} \sum_{i=1}^n X_i and LLN tells us that MnμM_n \approx \mu as nn \to \infty. If we dont know the μ\mu, we can use MnM_n as an estimator or approximation of μ\mu. This is called Monte Carlo approximation.

Normally, for a integral f(x)dx\int f(x) dx we try to find a density function statisfied inside f(x)f(x) to do transform where write f(x)dx\int f(x)dx into expecation format. A example for I=01cos(x2)sin(x4)dxI = \int_0^1 \cos(x^2)\sin(x^4)dx we can use U(0,1)U(0,1) where this distribution with density function f(x)=1f(x) = 1 that is we have I=E[cos(X2)sin(X4)]I = E[\cos(X^2)\sin(X^4)] where XU(0,1)X \sim U(0,1). To do Monte Carlo approxmation we need to have a sequence of i.i.d. such random variables X1,X2,X_1, X_2, \ldots following U(0,1)U(0,1), then we set up another random variable Ti=cos(Xi2)sin(Xi4)T_i = \cos(X_i^2)\sin(X_i^4) and we have I1ni=1nTiI \approx \frac{1}{n} \sum_{i=1}^n T_i.