0% found this document useful (0 votes)
41 views

Basics of Monte Carlo Simulation: Condensed From A Presentation by M. Asai

The document summarizes Monte Carlo simulation methods. It discusses the historical origins of Monte Carlo techniques dating back to Buffon's Needle experiment in 1777. It then covers the basics of Monte Carlo simulations including probability density functions, means, variances, and standard deviations. Examples are provided for the exponential and uniform distributions. The acceptance-rejection method for generating random numbers from arbitrary distributions is also described. Finally, two examples of Monte Carlo particle transport simulations are discussed: decay in flight and Compton scattering.

Uploaded by

Mohan Rj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
41 views

Basics of Monte Carlo Simulation: Condensed From A Presentation by M. Asai

The document summarizes Monte Carlo simulation methods. It discusses the historical origins of Monte Carlo techniques dating back to Buffon's Needle experiment in 1777. It then covers the basics of Monte Carlo simulations including probability density functions, means, variances, and standard deviations. Examples are provided for the exponential and uniform distributions. The acceptance-rejection method for generating random numbers from arbitrary distributions is also described. Finally, two examples of Monte Carlo particle transport simulations are discussed: decay in flight and Compton scattering.

Uploaded by

Mohan Rj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 40

Basics of Monte Carlo

Simulation
condensed from a presentation
by M. Asai

Dennis Wright
Geant4 Tutorial at Sao Paulo
4 February 2019
Contents
• Historical review of Monte Carlo methods

• Basics of Monte Carlo method


– probability density function
– mean, variance and standard deviation

• Two Monte Carlo particle transport examples


– decay in flight, Compton scattering

• Boosting simulation
– variance reduction techniques

• A partial list of Monte Carlo codes

Monte Carlo Methods 2


Historical review of
Monte Carlo method
Monte Carlo method
• A technique of numerical analysis that uses random sampling to
simulate the real-world phenomena
• Applications:
– Particle physics
– Quantum field theory
– Astrophysics
– Molecular modeling
– Semiconductor devices
– Light transport calculations
– Traffic flow simulations
– Environmental sciences
– Financial market simulations
– Optimization problems
– ...

Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 4


Monte Carlo method : definition
• The Monte Carlo method is a stochastic method for numerical
integration.

Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 5


Buffon’s Needle
• One of the oldest problems in the field of geometrical
probability, first stated in 1777.
• Drop a needle on a lined sheet of paper and determine
the probability of the needle crossing one of the lines
• Remarkable result: probability is directly related to the
value of p
• The needle will cross the line if x ≤ L sin(θ). Assuming L ≤
D, how often will this occur?

• By sampling Pcut one can estimate p.

x Length of the
Distance
q needle = L
between
lines = D

Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 6


Laplace’s method of calculating p (1886)
• Area of the square = 4
• Area of the circle = p
• Probability of random points
inside the circle = p / 4

• Random points : N
• Random points inside circle : Nc

p ~ 4 Nc / N

Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 7


Monte Carlo methods for radiation transport

• Fermi (1930): random method to calculate the properties of the


newly discovered neutron
• Manhattan project (40’s): simulations during the initial
development of thermonuclear weapons. von Neumann and
Ulam coined the term “Monte Carlo”

• Metropolis (1948) first actual Monte Carlo calculations using a


computer (ENIAC)
• Berger (1963): first complete coupled electron-photon transport
code that became known as ETRAN
• Exponential growth since the 1980’s with the availability of digital
computers

Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 8


Basics of Monte Carlo method
Probability Density Function (PDF) - 1
• Variable is random (also called stochastic) if its value cannot be
specified in advance of observing it
– let x be a single continuous random variable defined over some
interval. Interval can be finite or infinite.

• Value of x for any observation cannot be specified in advance, but it is


possible to talk in terms of probabilities
– Prob{xi ≤ X} represents the probability that an observed value xi will
be less than or equal to some specified value X. More generally,
Prob{E} is used to represent the probability of an event E

• Probability Density Function (PDF) of a single stochastic variable is a


function that has three properties:
1) defined on an interval [a, b]
2) is non-negative on that interval
3) is normalized such that with a and b real numbers,
a → −∞ and/or b → ∞

Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 10


Probability Density Function (PDF) - 2

• A PDF f (x) is a density function, i.e., it specifies the probability per unit of x,
so that f (x) has units that are the inverse of the units of x

• For given x, f (x) is not the probability of obtaining x


– infinitely many values that x can assume
– probability of obtaining a single specific value is zero

• Rather, f (x)dx is the probability that a random sample xi will assume a value
within x and x+dx
– often, this is stated in the form
f (x) = Prob{ x < xi < x+dx }

Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 11


Cumulative Distribution Function (CDF)
• The integral defined by

where f (x) is a PDF over the interval [a, b], is called the Cumulative
Distribution Function (CDF) of f.
• A CDF has the following properties:
1) F(a) = 0., F(b) = 1.
2) F(x) is monotonically increasing, as f(x) is always non-negative

• CDF is a direct measure of probability. The value F(xi) represents the


probability that a random sample of the stochastic variable x will assume a
value between a and xi, i.e., Prob{a ≤ x ≤ xi} = F(xi).
• More generally,

Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 12


Some example distributions – Uniform PDF
• The uniform (rectangular) PDF on the interval [a, b] and its CDF are given by

Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 13


Some example distributions – Exponential PDF
• The exponential PDF on the interval [0, ∞] and its CDF are given by

Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 14


Acceptance-rejection method
• If xi and yi are selected randomly from the range
and domain, respectively, of the function f,
then each pair of numbers represents a point in
the function’s coordinate plane (x, y)

• When yi > f(xi) the point lies above the curve for
f(x), and xi is rejected; when yi ≤ f(xi) the points
lies on or below the curve, and xi is accepted

• Thus, fraction of accepted points is equal to


fraction of the area below curve

• This technique, first proposed by von Neumann,


is also known as the acceptance-rejection
method of generating random numbers for
arbitrary Probability Density Function (PDF)

Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 15


Mean, variance and standard deviation
• Two important measures of PDF f(x) are its mean µ and variance s2.
• The mean µ is the expected or averaged value of x defined as

• The variance s2 describes the spread of the random variable x from the mean
and defined as

Note: 1

• The square root of the variance is called the standard deviation σ.


16
Radiation Simulation and Monte Carlo Method - M. Asai (SLAC)
Mean, variance and standard deviation
• Consider a function z(x), where x is a random variable described by a PDF f (x).
• The function z(x) itself is a random variable. Thus, the expected or mean value
of z(x) is defined as such.

• Then, variance of z(x) is given as this.

• The heart of a Monte Carlo analysis is to obtain an estimate of a mean value


(a.k.a. expected value). If one forms the estimate

where xi are suitably sampled from PDF f (x), one can expect

Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 17


Confidence coefficient and confidence level
• The equation of the previous page can be written as

where s(z) is the calculated sample standard deviation.


• Right-hand side can be evaluated numerically and called the confidence
coefficient. The confidence coefficients expressed as percentages are called
confidence level. For a given l in unit of standard deviation, the Monte Carlo
estimate of <z> is usually reported as
l confidence coefficient confidence level
0.25 0.1974 20%
0.50 0.3829 38%
1.00 0.6827 68%
1.50 0.8664 87%
2.00 0.9545 95%
3.00 0.9973 99%
4.00 0.9999 99.99%

Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 18


Two Monte Carlo Particle Transport Examples
Simplest case – decay in flight (1)
• Suppose an unstable particle of life time t has initial momentum p
(à velocity v ).
– Distance to travel before decay : d = t v
• The decay time t is a random value with probability density function

• the probability that the particle decays at time t is given by the cumulative distribution
function F which is itself is a random variable with uniform probability on [0,1]

• Thus, having a uniformly distributed random number r on [0,1], one can sample the value t
with the probability density function f(t).

t = F-1( r ) = -t ln( 1 – r ) 0<r<1

Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 20


Simplest case – decay in flight (2)
• When the particle has traveled the d = t v, it decays.
• Decay of an unstable particle itself is a random process à Branching ratio
– For example:
p+ à µ+ nµ (99.9877 %)
p+ à µ+ nµ g (2.00 x 10-4 %)
p+ à e+ ne (1.23 x 10-4 %)
p+ à e+ ne g (7.39 x 10-7 %)
p+ à e+ ne p0 (1.036 x 10-8 %)
p+ à e+ ne e+ e- (3.2 x 10-9 %)
• Select a decay channel by shooting a random number
• In the rest frame of the parent particle, rotate decay products
in q [0,p) and f [0,2p) by shooting a pair of random numbers
dW = sinq dq df
q = cos-1(r1), f = 2p x r2 0 < r1, r2 < 1

• Finally, Lorentz-boost the decay products


• You need at least 4 random numbers to simulate one decay
in flight

Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 21


Evenly distributed points on a sphere

q = p x r1, f = 2p x r2 q = cos-1(r1), f = 2p x r2
0 < r 1, r 2 < 1 0 < r 1, r 2 < 1

dW = sinq dq df
Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 22
Compton scattering (1)
• Compton scattering
e- g à e- g
• Distance traveled before Compton scattering, l, is a
random value
Cross section per atom : s(E,z) f
Number of atoms per volume : n = r NA / A
r : density, NA : Avogadro number, A : atomic mass
Cross section per volume : h(E, r) = n s
• h is the probability of Compton interaction per unit length. l(E, r) = h-1 is the mean free
path associated with the Compton scattering process.
• The probability density function f(l)

• With a uniformly distributing random number r on [0,1), One can sample the distance l.
l = -l ln( r ) 0<r<1

Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 23


Compton scattering (2)
• l(E, r) and l are material dependent. Distance measured by the unit of mean
free path (nl) is independent.

l1 l2 l3

l1 l2 l3

• nl is independent of the material and a random value with probability density


function f( nl ) = exp( -nl )
– sample nl at the origin of the particle

nl = -ln( r ) 0<r<1

– update elapsed nl along the passage of the particle

nl = nl - li / li

– Compton scattering happens at nl = 0

Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 24


Compton scattering (3)
• The relation between photon deflection (q) and energy loss for Compton scattering is
determined by the conservation of momentum and energy between the photon and
recoiled electron.

f
hn : energy of incident photon
hn0 : energy of scattered photon
E : energy of recoil electron
me : rest mass of electron
c : speed of light

• For unpolarized photon, the Klein-Nishina angular distribution function per steradian of
solid angle W

• One can use acceptance-rejection method to sample


the distribution.
Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 25
Boosting simulation

- Variance reduction techniques


Buffon’s needle – once again
• Suppose the distance between lines (D) is much larger than the length of the
needle (L). In naïve simulation, the needle’s location (x) is sampled uniformly
over [0,D).
p ~ (2 L / D) * ( h / n )
• However, the needle has little chance to hit lines for L < x < D – L. Also,
symmetry shows the probability of hitting lines for [0,D/2) is equal to [D/2,D).
• One can estimate p by sampling x over [0,L], and because the probability of
0 < x < L is L/(D/2), each successful count should be multiplied by the weight
D/2L .
p ~ (2 L / D) * ( h* (D / 2 L) / n )

x Length of the
q
Distance needle = L
between
lines = D

Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 27


Variance reduction techniques
• There are simulation problems where the event we are interested in is very
rare due to physics and/or geometry.
• Over the years, many clever variance reduction techniques have been
developed for performing biased Monte Carlo calculations
• The introduction of variance reduction methods into Monte Carlo calculations
can make otherwise impossible Monte Carlo problems solvable. However, use
of these variance reduction techniques requires skill and experience.
– non-analog Monte Carlo, despite having a rigorous statistical basis, is, in
many ways, an “art” form and cannot be used blindly.

Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 28


Example use-cases of variance reduction
• Efficiency of a radiation shielding Remaining flux we
want to estimate
– E.g. large flux entering to a thick shield Incident flux

– Lots of interactions : compute intensive Thick shield

– Very few particles escape

• Response of thin detector


– e.g. compact neutron detector
Rare interactions Thin detector
– most particles pass through without interaction making the signal
– signal is made by the interaction

• Dose in a very small component in a large setup


– e.g. an IC chip in a large satellite in cosmic
Volume in which
radiation environment we want to
– most of the incident radiation does not reach estimate the dose

the IC chip

Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 29


Non-exhaustive list of Monte Carlo codes
• EM physics
– ETRAN (Berger & Seltzer; NIST)
– EGS4 (Nelson, Hirayama, Rogers; SLAC)
– EGS5 (Hirayama et al.; KEK/SLAC)
– EGSnrc (Kawrakow & Rogers; NRCC)
– Penelope (Salvat et al.; U. Barcelona)
• Hadronic physics / general purpose
– Fluka (Ferrari et al., CERN/INFN)
– Geant4 (Geant4 Collaboration)
– MARS (James & Mokhov; FNAL)
– MCNPX / MCNP5 (LANL)
– PHITS (Niita et al.; JAEA)

Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 30


Backup
The Central Limit Theorem
• One of the important features of Monte Carlo is that not only can one obtain
an estimate of an expected value but also one can obtain an estimate of the
uncertainty in the estimate.
• The Central Limit Theorem (CLT) is a very general and powerful theorem.
• For obtained by samples from a distribution with mean <z> and standard
deviation σ(z), CLT provides

• Stated in words:
The CLT tells us that the asymptotic distribution of is a unit

normal distribution or, equivalently, is asymptotically distributed as a


normal distribution with mean μ = <z> and standard deviation .
• Most importantly, it states that the uncertainty in the estimated expected
value is proportional to where N is the number of samples of f (x).

Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 32


Buffon’s needle – case of D / L = 10,000

Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 33


Analogue simulation / non-analogue simulation
• The real power of Monte Carlo is that the sampling procedure can be
intentionally biased toward the region where the integrand is large or to
produce simulated histories that have a better chance of creating a rare event,
such as Buffon’s needle falling on widely spaced lines.
– “Analogue simulation” : follows the natural PDF
– “Non-analogue (a.k.a. biased) simulation” : biased sampling
• Of course, with such biasing, the scoring then must be corrected by assigning
weights to each history in order to produce a corrected, unbiased estimate of
the expected value.
• In such non-analog Monte Carlo analyses, the sample variance s2(z) of the
estimated expectation value z is reduced compared to that obtained by an
unbiased or analog analysis.
– In the Buffon’s needle example, biasing a simulation problem with widely
spaced lines to force all dropped needles to have one end within a needle’s
length of a grid line was seen to reduce the relative error by two orders of
magnitude over that of a purely analog simulation.

Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 34


Mean, variance and standard deviation
• Consider a function z(x), where x is a random variable described by a PDF f (x).
• The function z(x) itself is a random variable. Thus, the expected or mean value
of z(x) is defined as such.

• Then, variance of z(x) is given as such.

• The heart of a Monte Carlo analysis is to obtain an estimate of a mean value


(a.k.a. expected value). If one forms the estimate

where xi are suitably sampled from PDF f (x), one can expect

Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 35


Variance reduction techniques
• The aim of Monte Carlo calculation is to seek an estimate to an expected
value . The goal of variance reduction technique is to produce a more
precise estimate than could be obtained in a purely analogue calculation with
the same computational effort.

• Because both and must always be positive, the sample variance s2 can be
reduced by reducing their difference.
• Thus, the various variance reduction techniques are directed, ultimately, to
minimizing the quantity − .
– Note that, in principle, it is possible to attain zero variance, if = , which
occurs if every history yields the sample mean. But this is not very likely.
However, it is possible to reduce substantially the variance among histories
by introducing various biases into a Monte Carlo calculation.

Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 36


Some example distributions – Gaussian PDF
• The Gaussian PDF on the interval [-∞, ∞] and its CDF are given by

Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 37


Importance Sampling
• In an importance sampling technique, the analog PDF is
replaced by a biased PDF:
Phase space
analog region of interest
pdf(x)

x
biased
pdf(x) analog-pdf(x)
w(x) = ------------------
biased-pdf(x)

x
• The weight for a given value x, is the ratio of the analog over the
biased distribution values at x.

Geant4 Biasing 38
Weight window
• Monitor the weight of each particle
• If the weight becomes too high:
– it makes too large a contribution to the estimate and slows the
convergence à make two particles with half the weight
• If the weight becomes too low:
– it does not contribute much to the estimate and thus wastes CPU à kill
the particle with 50% probability, the rest of the time double its weight

weight
split
upper limit
window
weight

lower limit
Russian Roulette

Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 39


Accuracy, precision, relative error and figure of merit
Precision
Accuracy
(a.k.a. systematic error)
measure of how close is
the expected <x> to the uncertainty of Monte
true value, which is Carlo estimate. It is
seldom known. possible to get a highly
precise result that is far
from the true value, if the
Relative error model is not faithful.

Figure of Merit

measure of calculation
(statistical) precision. (T : time spent for the simulation)
R > 0.5 : not trustable usually constant except for very small statistics
0.1 < R < 0.5 : questionable Good measure of the efficiency of Monte Carlo method
R < 0.1 : reasonable (the higher FOM is the better)
- In the Buffon’s needle case, FOM for z << 1 is 1000
times better than FOM for z > 1.

Radiation Simulation and Monte Carlo Method - M. Asai (SLAC) 40

You might also like