<\/p>\n\n\n\n
<\/p>\n\n\n\n
The story of the Monte Carlo method begins in the most unlikely way: with a mathematician in bed playing cards. In 1946, Stanis\u0142aw Ulam<\/strong>, a Polish mathematician recovering from surgery, found himself playing solitaire to pass the time. Being a mathematician, he wondered: what are the chances of winning a game?<\/p>\n\n\n\n The problem was theoretically solvable: just enumerate every possible combination of cards and count the favorable ones. In practice, however, the number of combinations was so enormous that an exact calculation was completely impractical. Ulam then had an insight as simple as it was powerful: instead of computing the exact probability, why not simulate hundreds of games and count how many times you win?<\/strong><\/p>\n\n\n\n\n\n\n\n The idea is disarmingly simple. If we play 1,000 games and win 230 of them, we can estimate the probability of winning at about 23%. The more games we simulate, the closer our estimate gets to the true value. This is, in essence, the Monte Carlo method<\/strong>: using random simulation to solve problems that would be too complex to tackle analytically.<\/p>\n\n\n\n Ulam shared the idea with his colleague John von Neumann<\/strong>, arguably the most brilliant mathematician of the 20th century, who immediately saw its potential. Von Neumann realized that ENIAC<\/strong> \u2014 one of the very first electronic computers, which filled an entire room \u2014 could run thousands of simulations in reasonable time. Together, they developed the method for a problem far more serious than solitaire: the diffusion of neutrons<\/strong> in atomic weapons, as part of the Manhattan Project at Los Alamos.<\/p>\n\n\n\n The name \u201cMonte Carlo\u201d was chosen as a code name, a reference to the famous Monte Carlo Casino<\/strong> in Monaco. Legend has it that the inspiration came from Ulam\u2019s uncle, a notorious gambler. After all, the heart of the method is chance itself: generating random numbers to explore spaces of possibility too vast to traverse systematically.<\/p>\n\n\n\n From those early nuclear experiments of the 1940s, the Monte Carlo method has spread to every field of science and engineering. Today it is one of the most widely used computational tools in the world, from particle physics to finance, from cinematic rendering to drug discovery. Let\u2019s see how it works.<\/p>\n\n\n\n The Monte Carlo method rests on a statistical principle we\u2019ve encountered before: the law of large numbers<\/strong>. In simple terms, this law tells us that the average of a random sample approaches the population average as the sample grows. Translated into Monte Carlo language: the more simulations we run, the more accurate our result will be<\/strong>.<\/p>\n\n\n\n To run a Monte Carlo simulation, we need random numbers<\/strong>. In practice, computers don\u2019t generate truly random numbers: they use deterministic algorithms that produce sequences of pseudo-random numbers<\/strong> with statistical properties indistinguishable from real randomness. In R, for example, the A crucial aspect is the rate of convergence<\/strong>. The Monte Carlo estimation error decreases as 1\/\u221an<\/strong>, where n is the number of simulations. This means that to halve the error, we need to quadruple our simulations; to gain one more decimal digit of precision, we need 100 times more iterations. It\u2019s not particularly efficient, but the beauty of the method lies in the fact that it works regardless of the problem\u2019s complexity<\/strong>: whether the problem has 2 or 2,000 variables, the convergence rate remains the same.<\/p>\n\n\n\n In practice, we must always balance desired precision<\/strong> with available computational resources<\/strong>. Increasing the number of simulations comes at a cost in computation time. Fortunately, modern computers make this trade-off much more favorable than in the days of ENIAC.<\/p>\n\n\n\n Let\u2019s see concretely how the Monte Carlo method is applied. The procedure follows four fundamental steps:<\/p>\n\n\n\n 1. Define the model.<\/strong> First, we identify the problem\u2019s variables and the probability distributions that govern them. For instance, if we want to simulate an investment\u2019s return, the model will include the expected return (mean) and volatility (standard deviation), typically assuming normally distributed returns.<\/p>\n\n\n\n 2. Generate random scenarios.<\/strong> Using a pseudo-random number generator, we produce thousands of possible scenarios. Each scenario represents an \u201calternative history\u201d: one way things could play out.<\/p>\n\n\n\n 3. Compute the result for each scenario.<\/strong> For each scenario, we apply the model and obtain a result. If we\u2019re simulating an investment, the result is the final portfolio value.<\/p>\n\n\n\n 4. Aggregate the results.<\/strong> Finally, we analyze the set of results: we compute the mean, the median, the percentiles. This gives us not just an estimate of the expected outcome, but an entire distribution of possibilities<\/strong>. And this is where Monte Carlo truly shines: it tells us not only \u201chow much we\u2019re likely to earn\u201d but also \u201chow much we could lose in the worst case.\u201d<\/p>\n\n\n\n Let\u2019s use a quick example to illustrate convergence. Imagine flipping a coin and trying to estimate the probability of heads. After 10 flips, we might get 7 heads (70%), an estimate far from the true 50%. After 100 flips, we\u2019ll be closer, perhaps 53%. After 10,000 flips, our estimate will be very close to 50%. This is Monte Carlo in action: replacing a theoretical calculation with an experiment repeated thousands of times.<\/p>\n\n\n\n The power of the method lies in its flexibility<\/strong>. While analytical methods require closed-form solutions (which often don\u2019t exist for complex problems), Monte Carlo only requires the ability to simulate the process. If we can write a program that generates one scenario, Monte Carlo gives us the distribution of outcomes.<\/p>\n\n\n\n The most classic and pedagogically effective example of the Monte Carlo method is estimating the number \u03c0<\/strong>. The idea is elegant: consider a square of side 2 with a circle of radius 1 inscribed inside it. The area of the square is 4, the area of the circle is \u03c0. If we generate random points inside the square, the proportion falling inside the circle will be approximately \u03c0\/4.<\/p>\n\n\n\n We compute this in R with 100,000 points:<\/p>\n\n\n\n The same in Python:<\/p>\n\n\n\n With 100,000 points we already get a reasonable estimate, though not extremely precise: we\u2019re accurate to about two decimal places. As we mentioned, gaining another digit of precision would require roughly 100 times more points. The computer does all the heavy lifting.<\/p>\n\n\n\n Let\u2019s move to an example closer to real-world applications. Suppose we have a portfolio of three stocks with the following characteristics:<\/p>\n\n\n\n We want to estimate the probability that the portfolio return exceeds 10%. We simulate in R with 10,000 scenarios:<\/p>\n\n\n\n The same in Python:<\/p>\n\n\n\n The result tells us there\u2019s roughly a 45% chance of exceeding 10% return. Notice how Monte Carlo gives us not a single number, but an entire distribution: we could easily compute the median return, the worst-case 5th percentile, the probability of loss, and so on.<\/p>\n\n\n\n To make the concept even more tangible, we\u2019ve built an interactive simulator<\/strong> that applies the Monte Carlo method to predict the future value of an investment. The underlying model is the Geometric Brownian Motion<\/strong> (GBM), the same model used in the famous Black-Scholes framework for options pricing.<\/p>\n\n\n\n Intuitively, an asset\u2019s future price is computed as the current price multiplied by a random growth factor. The formula is:<\/p>\n\n\n\n S(t+1) = S(t) \u00d7 exp((\u03bc \u2212 \u03c3\u00b2\/2) + \u03c3 \u00d7 Z)<\/strong><\/p>\n\n\n\n where \u03bc<\/strong> is the expected annual return (the \u201caverage growth\u201d), \u03c3<\/strong> is the volatility (how much the price fluctuates \u2014 our measure of uncertainty), and Z<\/strong> is a random number drawn from a normal distribution. Each simulation generates a different path: some scenarios see the portfolio grow substantially, others see it decline. The histogram shows the distribution of all possible outcomes.<\/p>\n\n\n\n
<\/p>\n\n\n\nFundamental concepts<\/h2>\n\n\n\n
runif()<\/code> function generates uniformly distributed numbers between 0 and 1.<\/p>\n\n\n\n
<\/p>\n\n\n\nThe Monte Carlo method in action<\/h2>\n\n\n\n
<\/p>\n\n\n\nPractical examples: estimating \u03c0 and portfolio returns<\/h2>\n\n\n\n
Example 1: estimating the value of \u03c0<\/h3>\n\n\n\n
set.seed(123)\nn <- 100000\nx <- runif(n, -1, 1)\ny <- runif(n, -1, 1)\ninside <- (x^2 + y^2) <= 1\npi_estimate <- 4 * sum(inside) \/ n\npi_estimate\n# [1] 3.13956<\/code><\/pre>\n\n\n\nimport random\nrandom.seed(123)\nn = 100000\ninside = sum(1 for _ in range(n)\n if random.uniform(-1, 1)**2 + random.uniform(-1, 1)**2 <= 1)\npi_estimate = 4 * inside \/ n\nprint(pi_estimate)\n# 3.14268<\/code><\/pre>\n\n\n\nExample 2: estimating portfolio returns<\/h3>\n\n\n\n
Stock<\/th> Expected Return<\/th> Standard Deviation<\/th> Portfolio Weight<\/th><\/tr><\/thead> A<\/td> 8%<\/td> 12%<\/td> 40%<\/td><\/tr> B<\/td> 10%<\/td> 15%<\/td> 30%<\/td><\/tr> C<\/td> 12%<\/td> 18%<\/td> 30%<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n set.seed(42)\nsim_A <- rnorm(10000, mean = 0.08, sd = 0.12)\nsim_B <- rnorm(10000, mean = 0.10, sd = 0.15)\nsim_C <- rnorm(10000, mean = 0.12, sd = 0.18)\nsim_portfolio <- 0.4 * sim_A + 0.3 * sim_B + 0.3 * sim_C\nprob_result <- mean(sim_portfolio >= 0.10)\nprob_result\n# [1] 0.4504<\/code><\/pre>\n\n\n\nimport random\nrandom.seed(42)\nn = 10000\ncount = 0\nfor _ in range(n):\n a = random.gauss(0.08, 0.12)\n b = random.gauss(0.10, 0.15)\n c = random.gauss(0.12, 0.18)\n ptf = 0.4 * a + 0.3 * b + 0.3 * c\n if ptf >= 0.10:\n count += 1\nprint(count \/ n)\n# 0.4479<\/code><\/pre>\n\n\n\n
<\/p>\n\n\n\nMonte Carlo Simulator<\/h2>\n\n\n\n