## Monte Carlo in Quantitative Finance

In this post I’m going to give a little introduction to Monte Carlo as a method for integration, and try to get server-side scripting working via WordPress!

Monte Carlo is fundamentally a technique for doing numerical integration. If we’re confronted with an integral that we can’t solve analytically, we have an array of possible techniques available to us. For 1d integrals, probably the easiest thing for well-behaved functions is to use Simpson’s rule and integrate across the part we’re interested in. But to do this in many dimensions can be tricky – for each dimension we probably want the same number of partitions, so the overall number of function evaluations scales exponentially with dimension – very bad news! By contrast, Monte Carlo essentially samples the function at random points and takes an average. The higher value points contribute more to the average than lower value points, and the overall error in the average scales as $\inline&space;{1&space;\over&space;\sqrt{n}}$, giving a good approximation relatively quickly for high dimensional problems.

The quintessential example of a Monte Carlo experiment is a simple process to approximate pi. Consider drawing a circle inscribed into a square, just as shown in the following image:

Now, imagine scattering dried cous-cous over the whole area. They will land randomly all over the surface, and first of all we will sweep away any that fall outside of the square.

What next? Well, if we count the number of grains that fell inside the circle, and compare that to the total amount that fell inside the square, what do we expect the ratio to be? As long as they’re not too clustered, the expectation is that it will be $\inline&space;{\pi&space;\over&space;4}$, which is of course just the ratio of the areas.

Rather than actually counting grains, we can simulate this process on the computer much more quickly. To represent each grain, we simulate two uniform variables, each on the interval [-0.5,0.5]. We treat these as the grain’s x-coordinate and y-coordinate, and calculate the distance from the origin (0,0) by taking the sum of the squares of these. If the sum is less than the square of the radius of the circle (ie. 0.25) then the grain is ‘inside’ the circle, if it is greater then the grain is ‘outside’.

Here is the simulation run for 1000 grains of cous-cous (refresh for a repeat attempt):

Grains Simulated: 1000
Grains Inside Circle: 772
Our estimate of pi is 3.088

The estimate here is probably fairly close – you may have been lucky (or unlucky!), but we claimed that the estimate will converge to the real value of pi with a progressively larger number of grains [exercise: can you demonstrate this using the central limit theorem?]. Well, below you’ll find another simulation, this time going up to a little over a million grains but making estimates each time the number of grains is doubled, and the error in the estimate is compared to the number of grains so far at each step.

 number of steps estimate error 2 2 -1.141593 4 1 -2.141593 8 2.5 -0.641593 16 3 -0.141593 32 3.125 -0.016593 64 3 -0.141593 128 3.125 -0.016593 256 3.140625 -0.000968 512 3.1875 0.045907 1024 3.171875 0.030282 2048 3.214844 0.073251 4096 3.185547 0.043954 8192 3.190918 0.049325 16384 3.17749 0.035898 32768 3.170654 0.029062 65536 3.158447 0.016855 131072 3.151794 0.010202 262144 3.146362 0.00477 524288 3.144485 0.002893 1048576 3.144726 0.003133

It should b fairly straight-forward to copy-paste these figures into excel – does the error fall like $\inline&space;{1&space;\over&space;\sqrt{n}}$ as claimed? In fact, the central limit theorem tells us that the mean of the ratio of grains inside should go to a normal distribution with standard deviation proportional to this quantity, so we should expect it to be outside the bound about 30% of the time (if you have calculated the right constant!).

Of course, in the 2 dimensional circle case, a better idea might be to try and put points evenly over the square and count how many of these fall inside/outside. As mentioned before, the benefits of Monte Carlo are most pronounced when there are many dimensions involved. But, this is something like the procedure involved in quasi-Monte Carlo, a procedure that I’ll talk about some other time that doesn’t use random numbers at all…

-QuantoDrifter

## Cumulative Normal Distribution

As discussed in my last post, I had some issues with an implementation of the standard normal cdf function, which I address here. This post will be my first test of the equation editor that I’ve just installed!

The standard normal cdf looks like this:

$\Phi(x)&space;=&space;{1&space;\over&space;\sqrt{2\pi}}\int&space;^{x}_{-\infty}&space;e^{-{1&space;\over&space;2}&space;y^2&space;}&space;dy$

I had a few thoughts as to how to go about this. It’s symmetrical around x = 0, so we only need to worry about solving for positive x, and then we can calculate negative x values by reflection. Possibilities were:

• Series Approximation

$e^x&space;=&space;\sum_{n&space;=&space;0}^{\infty}&space;{1&space;\over&space;n!}&space;x^n$

${1\over&space;\sqrt{2\pi}}\int_{-\infty}^x&space;e^{-{1&space;\over&space;2}y^2}&space;dy&space;=&space;{1&space;\over&space;2}&space;+&space;\sum_{n&space;=&space;0}^{\infty}&space;\int_{0}^x&space;{-1^n&space;\over&space;2^n&space;n!}&space;{y^{2n}}&space;dy&space;=&space;{1&space;\over&space;2}&space;+&space;\sum_{n&space;=&space;0}^{\infty}&space;{-1^n&space;\over&space;(2n+1)&space;2^n&space;n!}&space;{x^{2n+1}}$

The problem with this expression is that the terms oscillate between positive and negative, which means that for large enough x it will explode to either very big positive or negative values. We could include a fixing point and build in some sort of curve above a certain x, but I’m looking for a fairly robust solution that doesn’t involve too much testing for the moment, and this sounds like a lot of work!

• Lookup Table

Again, this solution would be a lot of work to set up, but would have a guaranteed level of accuracy and would find the answer in a fixed amount of time. A vector could be set up containing the value of x that gives cdf(x) = 0.5+n*delta; delta might be one millionth or so, the array would have 2^19 members and a binary search would locate the closest value to x in approximately 18 operations (assuming constant time to check a vector). The index of this value would then give the value of the cdf, and an interpolation scheme between adjacent values could improve accuracy further.

Pros of this solution are efficiency and accuracy, but there would be a large setup cost and possibly memory cost to load up the look up table. If we had to run the function inside a Monte Carlo regime or numerical integration, this might be justified by the runtime savings, but for the moment it’s a bit much work!

• Analytic Approximation

To get the pricer described in my last post running, I implemented the following approximation to the error function:

a1 = 0.278393
a2 = 0.230389
a3 = 0.000972
a4 = 0.078108

${\rm&space;erf}(x)&space;=&space;1&space;-&space;{1&space;\over&space;(a_1x&space;+&space;a_2&space;x^2&space;+&space;a_3&space;x^3&space;+&space;a_4&space;x^4)^4}$

$\Phi(x)&space;=&space;0.5\Bigl[&space;1&space;+&space;{\rm&space;erf}\Bigl({x&space;\over&space;\sqrt{2}}\Bigr)&space;\Bigr]$

Well, it got the pricer working but turns out to be not too accurate. For example, I got this running on excel and compared it to the inbuild NORMSDIST implementation, for some typical numbers (forward = 100, strike = 90, vol=10%, dcf = 1, time = 1). For NORMSDIST(d1) in excel, I get 0.86512, while for my Phi(d1) I get 0.86489, so the error is in the 4th sf. This leads to a price difference of 10.7124 for excel and 10.7095 for my implementation, and I’d like to do a bit better. Since I’d ruled out the possibilities described above, I went back to wikipedia and implemented the following version of the cdf, which gave a much more agreeable price (similar to excel’s now to 7sf):

b0 = 0.2316419;
b1 = 0.31938153;
b2 = -0.356563782;
b3 = 1.781477937;
b4 = -1.821255978;
b5 = 1.330274429;

$t&space;=&space;{1&space;\over&space;1+b_0&space;x}$

$\phi(x)&space;=&space;{1&space;\over&space;\sqrt{2\pi}}&space;e^{-{1&space;\over&space;2}x^2}$

$\Phi(x)&space;=&space;1&space;-&space;\phi(x)\cdot(b_1t&space;+&space;b_2t^2&space;+b_3t^3+b_4t^4+b_5t^5)$

It’s worth noting that although this implementation seems to give better accuracy for most positive x, it relies on some library functions (square root and exponential) itself, so we’re leaving ourselves slightly at the mercy of how those are programmed. It’s also going to take much longer than the previous implementation, which only used polynomial arithmetic. Since we only need a couple of evaluations in a vanilla pricer, it’s not a big concern, but for applications that call it repeatedly we might want to do better.

That’s all for today!

-QuantoDrifer