F19: Introduction to Monte Carlo simulations. Ebrahim Shayesteh
|
|
- Wilfrid Curtis
- 6 years ago
- Views:
Transcription
1 F19: Introduction to Monte Carlo simulations Ebrahim Shayesteh
2 Introduction and repetition Agenda Monte Carlo methods: Background, Introduction, Motivation Example 1: Buffon s needle Simple Sampling Example 2: Travel time from A to B Accuracy: Variance reduction techniques VRT 1: Complementary random numbers Example 3: DC OPF problem 2
3 Repetition: fault models Note: "Non-repairable systems A summary of functions to describe the stochastic variable T (when a failure occurs): Cumulative distribution function: survivor function: Probability density function: Failure rate: F R f z t P T t t P T t 1 F t ( t) F t R t t f t F t R t 1 F t 3
4 Repetition: repairable systems Repairable systems: alternating renewal process X(t) 1 0 t T 1 D 1 T 2 D 2 T 3 D 3 T 4 Mean Time To Failure (MTTF) Mean Down Time (MDT) Mean Time To Repair (MTTR), sometimes, but not always the same as MDT Mean Time Between Failure (MTBF = MTTF + MDT) 4
5 Repetition: repairable systems The availability for a unit is defined as the probability that the unit is operational at a given time t 1 Note: if the unit cannot be repaired A(t)=R(t) if the unit can be repaired, the availability will depend both on the lifetime distribution and the repair time. 5
6 Repetition: repairable systems The share of when the unit has been working thus becomes: n T n i 1 T i i 1 i 1 i n D i n 1 Ti n i 1 n 1 1 Ti n n i 1 i 1 n D i It results when in: A av ET ED ET MTTF MTTF MDT 6
7 Repetition: repairable systems The failure frequency (referred to as either ω or f) during the total time interval i is provided by: f 1 MTTF MDT Note the difference between failure rate (λ = 1/MTTF) and failure frequency (f =1/MTBF). For short down time compared to the operation time (i.e. MDT << MTTF), this difference is negligible: λ f. o This assumption is often applicable and used within reliability analyses of power distribution! 7
8 System of components A technical system can be described as consisting of a number of functional blocks that are interconnected to perform a number of required functions where components are modeled as blocks. There are two fundamental system categories: 1. Serial systems (often in power distribution contexts referred to as radial system/lines/feeders) 2. Parallel systems Often, a system can be seen as a composition of several subsystems of these two fundamental types 8
9 Methods: approximate equations Approximate equations for a serial system (MDT << MTTF is assumed): Failure rate, Unit, e.g: [failures/year]: Unavailability, Unit, e.g: [hours/year]: Average repair time, Unit, e.g: [hours]: U s s r s n i 1 n i 1 U s s i r i i 9
10 Methods: approximate equations Approximate equations for a parallel system (MDT << MTTF is assumed): Failure rate, Unit, e.g: [failures/year]: Unavailability, Unit, e.g: [hours/year]: Average repair time, Unit, e.g: [hours]: 1 2( r1 r2 ) p 1 2( r1 r 1 1r1 2r2 r1 r2 r p r1 r2 U r r p p p 1 2 1r2 2 ) 10
11 System indices Additional reliability measures - System indices Previously calculated measures for system reliability λ s,u s and r s specifies expected values, or mean, of a probability distribution. These measures however not describe the impact of a fault which can mean significant differences for different load points: For example a load point with one customer and a load of load 10 kw and another with 100 customers and load of 500 MW. In order to take into account more aspects, system indices are calculated. 11
12 System indices Customer-oriented reliability indices System average interruption frequency index SAIFI [failures/year, customer] λ Customer average interruption frequency index CAIFI [Failure/year, customer] λ λ i is the failure rate of load point i (LP i ) and N i is equal to number of customers in LP i 12
13 System indices Customer-oriented reliability indices System average interruption duration index SAIDI [hours/year, customer]: Customer average interruption duration index CAIDI [hours/failure]: λ U i is the outage time of load point i (LP i ) and N i is equal to number of customers in Lp i 13
14 System indices Average service availability index (ASAI) [probability between 0 and 1] or [%]: where 8760 is number of hours/year Also Average service unavailability index (ASUI) are used: ASUI = 1-ASAI 14
15 System indices Energy-oriented reliability indices Energy not supplied index (ENS) [kwh/year] Average energy not supplied index (AENS) [kwh/year, customer] U i is the outage time of load point i (LP i ), N i is equal to number of customers in Lp i and L a(i) is average average load of Lp i : 15
16 Introduction and repetition Agenda Monte Carlo methods: Background, Introduction, Motivation Example 1: Buffon s needle Simple Sampling Example 2: Travel time from A to B Accuracy: Variance reduction techniques VRT 1: Complementary random numbers Example 3: DC OPF problem 16
17 Monte Carlo methods: background A class of methods used to solve mathematical problems by studying random samples. It is, in another word, an experimental approach to solve a problem. Theoretical basis of Monte Carlo is the Law of Large Numbers: The average of several independent stochastic variables with the same expected value m is close to m, when the number of stochastic variables is large enough. The result is that: 17
18 Monte Carlo methods: background The second most important (i.e., useful) theoretical result for Monte Carlo is the Central Limit Theorem. CLT: The sum of a sufficiently large number of independent identically distributed random variables becomes normally distributed as N increases. This is useful for us because we can draw useful conclusions from the results from a large number of samples (e.g., 68.7% within one standard deviation, etc.). 18
19 Monte Carlo methods: simulation The word simulation in Monte Carlo Simulation is derived from Latin simulare, which means to make like. Thus, a simulation is an attempt to imitate natural or technical systems. Different simulation methods: Physical simulation: Study a copy of the original system which is usually smaller and less expensive than the real system. Computer simulation: Study a mathematical model of the original system. Interactive simulation: Study a system (either physical or a computer simulation) and its human operators. 19
20 Monte Carlo methods: simulation Y g(y) X Inputs: The inputs are random variables with known probability distributions. For convenience, we collect all input variables in a vector, Y. 20
21 Monte Carlo methods: simulation Y g(y) X Model: The model is represented by the mathematical function, g(y). The random behavior of the system is captured by the inputs, i.e., the model is deterministic! Hence, if x1 = g(y1), x2 = g(y2) and y1 = y2 then x1 = x2. 21
22 Monte Carlo methods: simulation Y g(y) X Outputs: The outputs are random variables with unknown probability distributions. For convenience, we collect all output variables in a vector, X. The objective of the simulation is to study the probability distribution of X!. 22
23 Monte Carlo methods: simulation example Y g(y) X Inputs: The status of all primary lines, all lateral lines, and the amount of power consumption and number of customers at each load points. Model: The structure of the distribution system given the above inputs. Outputs: The reliability measures, e.g., the value of system indices. 23
24 Monte Carlo methods: motivation Assume that we want to calculate the expectation value, E[X], of the system X = g(y). According to the definition of expectation value we get the following expression: What reasons are there to solve this problem using Monte Carlo methods rather than analytical methods? 24
25 Monte Carlo methods: motivation Complexity: The model g(y) may not be an explicit function. Example: The outputs, x, are given by the solution to an optimization problem, where the inputs y appear as parameters, i.e., Problem size: The model may have too many inputs or outputs. Example: 10 inputs integrate over 10 dimensions! 25
26 Monte Carlo methods: motivation Analytic model or simulation method? The analytic models are usually valid under certain restrictive assumptions such as independence of the inputs, limited status number, etc. MC method can be used for large problems with multiple status. Physical visibility of a complex system is higher in the simulation method. The analytical methods are more accurate than simulations as long as no simplifying assumption is considered. Otherwise, it cannot be compared. In the case of future development in the system, simulation methods are more appropriate since future developments may be more tractable. For small systems, the analytic methods are faster while enough random scenarios need to be simulated in MC method which takes longer time. 26
27 Monte Carlo methods: motivation Analytic model or simulation method? Advantages of each method: Analitical Exact results if there are limited assumptions The outputs are fast once the model is obtained Computer is not necessarily needed Monte-Carlo The analyses are very flexible The model extention is easy It can easily be understood 27
28 Introduction and repetition Agenda Monte Carlo methods: Background, Introduction, Motivation Example 1: Buffon s needle Simple Sampling Example 2: Travel time from A to B Accuracy: Variance reduction techniques VRT 1: Complementary random numbers Example 3: DC OPF problem 28
29 Example 1: Buffon s needle The position of the needle can be described using two parameters: a = least distance from the needle center to one of the parallel lines (0 a d/2). ϑ = least angle between the needle direction and the parallel lines (0 ϑ π/2). The needle will cross a line if its projection on a line perpendicular to the parallel lines is larger than the distance to the closest line, i.e. if: Pi and Buffon's Matches - Numberphile.mp4 (from YouTube) 29
30 Introduction and repetition Agenda Monte Carlo methods: Background, Introduction, Motivation Example 1: Buffon s needle Simple Sampling Example 2: Travel time from A to B Accuracy: Variance reduction techniques VRT 1: Complementary random numbers Example 3: DC OPF problem 30
31 Simple Sampling: introduction Y g(y) X Simple sampling means that completely random observations (samples) of a random variable, X, are collected. A sufficient number of samples will provide an estimate of E[X] according to the law of large numbers: Simple sampling can also be used to estimate other statistical properties (for example variance or probability distribution) of X: Exercise: Show that 31
32 Simple Sampling: computer simulation Y g(y) X In the computer simulation problem, we generate samples by randomizing the input values, yi, and calculate the outcome xi = g(yi). Then, the expected value and variance of all samples are calculated. 32
33 Simple Sampling: random numbers Y g(y) X How do we generate the inputs Y to a computer simulation? A pseudo-random number generator provides U(0, 1)- distributed random numbers. Y generally has some other distribution. There are several methods to transform U(0, 1)- distributed random numbers to an arbitrary distribution. One example method is to use the inverse transform method. 33
34 Simple Sampling: random numbers Y g(y) X Inverse transform method: Theorem: If a random variable U is U(0, 1)-distributed then has the distribution function. 34
35 Simple Sampling: random numbers Inverse transform method example: A pseudo-random number generator providing U(0, 1)-distributed random numbers has generated the value U = a) Transform U to a result of throwing a fair six-sided dice. b) Transform U to a result from a U(10, 20)-distribution. 35
36 Simple Sampling: random numbers Inverse transform method example: A pseudo-random number generator providing U(0, 1)-distributed random numbers has generated the value U = a) Transform U to a result of throwing a fair six-sided dice. Answer: 36
37 Simple Sampling: random numbers Inverse transform method example: A pseudo-random number generator providing U(0, 1)-distributed random numbers has generated the value U = b) Transform U to a result from a U(10, 20)-distribution. Answer: The inverse distribution function is given by 37
38 Simple Sampling: computer simulation Y g(y) X Therefore, the computer simulation problem can be updated as follows: 38
39 Introduction and repetition Agenda Monte Carlo methods: Background, Introduction, Motivation Example 1: Buffon s needle Simple Sampling Example 2: Travel time from A to B Accuracy: Variance reduction techniques VRT 1: Complementary random numbers Example 3: DC OPF problem 39
40 Example 2: Travel time from A to B Questions: a) Estimate the expected travel time from A to B! b) Estimate Var[X] assuming that 1000 scenarios of the system in example 6 have been generated, and the following results are obtained: 40
41 Example 2: Travel time from A to B Questions: a) Estimate the expected travel time from A to B! Answer: 41
42 Example 2: Travel time from A to B Questions: a) Estimate Var[X] assuming that 1000 scenarios of the system in example 6 have been generated, and the following results are obtained: Answer: 42
43 Introduction and repetition Agenda Monte Carlo methods: Background, Introduction, Motivation Example 1: Buffon s needle Simple Sampling Example 2: Travel time from A to B Accuracy: Variance reduction techniques VRT 1: Complementary random numbers Example 3: DC OPF problem 43
44 Accuracy: Variance reduction techniques A Monte Carlo simulation does not converge towards the true expectation value in the same sense as the geometric series is converging to 1. As we collect more samples, the probability of getting an inaccurate estimate is decreasing, but there is no guarantee that we get a better estimate if we generate another sample. It is more or less inevitable that the result of a Monte Carlo simulation is inaccurate the question is how inaccurate it is! 44
45 Accuracy: Variance reduction techniques Remember that MX is a random variable and E[MX] = E[X]. Hence, Var[MX] is an indicator of the accuracy of the simulation method. 45
46 Accuracy: Variance reduction techniques Theorem: In simple sampling, the variance of the estimated expectation value is: For infinite populations we get: 46
47 Accuracy: Variance reduction techniques We have in many cases some knowledge about the system to be simulated. This knowledge can be used to improve the accuracy of the simulation. Methods based on some knowledge of the system are called variance reduction techniques, since improving the accuracy is equivalent to reducing Var[MX]. 47
48 Accuracy: Variance reduction techniques Some examples of such techniques are as follows: Complementary random numbers Dagger Sampling Control Variates Correlated Sampling Importance Sampling Strata Sampling 48
49 Introduction and repetition Agenda Monte Carlo methods: Background, Introduction, Motivation Example 1: Buffon s needle Simple Sampling Example 2: Travel time from A to B Accuracy: Variance reduction techniques VRT 1: Complementary random numbers Example 3: DC OPF problem 49
50 VRT 1: Complementary random numbers All observations in simple sampling are independent of each other. Sometimes it is possible to increase the probability of a good selection of samples if the samples are not independent. 50
51 VRT 1: Complementary random numbers Consider two estimates MX1 and MX2 of the same expectation value μx, i.e., Study the mean of these estimates, i.e., Expectation value: i.e., the combined estimate MX is also an estimate of μx. 51
52 VRT 1: Complementary random numbers Variance: If MX1 and MX2 both are independent estimates obtained with simple sampling and the number of samples is the same in both simulations, then we get Var[MX1] = Var[MX2] and Cov[MX1, MX2] = 0. Hence, 52
53 VRT 1: Complementary random numbers Variance: The variance obtained is equivalent to one run of simple sampling using 2n samples; according to theorem mentioned, we should get half the variance when the number of samples is doubled. However, if the MX1 and MX2 are not independent but negatively correlated then the covariance term will make Var[MX] smaller than the corresponding variance for simple sampling using the same number of samples. 53
54 Introduction and repetition Agenda Monte Carlo methods: Background, Introduction, Motivation Example 1: Buffon s needle Simple Sampling Example 2: Travel time from A to B Accuracy: Variance reduction techniques VRT 1: Complementary random numbers Example 3: DC OPF problem 54
55 Example 3: DC OPF problem Question: How many random number do we need? Answer: 11 random numbers (3+4+4=11) 55
56 Example 3: DC OPF problem Answer: Question: Which technique is the best? 56
57 Introduction and repetition Agenda Monte Carlo methods: Background, Introduction, Motivation Example 1: Buffon s needle Simple Sampling Example 2: Travel time from A to B Accuracy: Variance reduction techniques VRT 1: Complementary random numbers Example 3: DC OPF problem 57
58 Agenda Thank you! 58
SIMULATION OF ELECTRICITY MARKETS
SIMULATION OF ELECTRICITY MARKETS MONTE CARLO METHODS Lectures 15-18 in EG2050 System Planning Mikael Amelin 1 COURSE OBJECTIVES To pass the course, the students should show that they are able to - apply
More informationELEMENTS OF MONTE CARLO SIMULATION
APPENDIX B ELEMENTS OF MONTE CARLO SIMULATION B. GENERAL CONCEPT The basic idea of Monte Carlo simulation is to create a series of experimental samples using a random number sequence. According to the
More informationBrooks, Introductory Econometrics for Finance, 3rd Edition
P1.T2. Quantitative Analysis Brooks, Introductory Econometrics for Finance, 3rd Edition Bionic Turtle FRM Study Notes Sample By David Harper, CFA FRM CIPM and Deepa Raju www.bionicturtle.com Chris Brooks,
More informationFast Convergence of Regress-later Series Estimators
Fast Convergence of Regress-later Series Estimators New Thinking in Finance, London Eric Beutner, Antoon Pelsser, Janina Schweizer Maastricht University & Kleynen Consultants 12 February 2014 Beutner Pelsser
More information2.1 Mathematical Basis: Risk-Neutral Pricing
Chapter Monte-Carlo Simulation.1 Mathematical Basis: Risk-Neutral Pricing Suppose that F T is the payoff at T for a European-type derivative f. Then the price at times t before T is given by f t = e r(t
More informationUQ, STAT2201, 2017, Lectures 3 and 4 Unit 3 Probability Distributions.
UQ, STAT2201, 2017, Lectures 3 and 4 Unit 3 Probability Distributions. Random Variables 2 A random variable X is a numerical (integer, real, complex, vector etc.) summary of the outcome of the random experiment.
More informationUPDATED IAA EDUCATION SYLLABUS
II. UPDATED IAA EDUCATION SYLLABUS A. Supporting Learning Areas 1. STATISTICS Aim: To enable students to apply core statistical techniques to actuarial applications in insurance, pensions and emerging
More informationChapter 5 Univariate time-series analysis. () Chapter 5 Univariate time-series analysis 1 / 29
Chapter 5 Univariate time-series analysis () Chapter 5 Univariate time-series analysis 1 / 29 Time-Series Time-series is a sequence fx 1, x 2,..., x T g or fx t g, t = 1,..., T, where t is an index denoting
More informationMonte Carlo and Empirical Methods for Stochastic Inference (MASM11/FMS091)
Monte Carlo and Empirical Methods for Stochastic Inference (MASM11/FMS091) Magnus Wiktorsson Centre for Mathematical Sciences Lund University, Sweden Lecture 3 Importance sampling January 27, 2015 M. Wiktorsson
More informationSystem planning, EG2050 Probabilistic production cost simulation of electricity markets L12. Calculation of system index - Basic idea.
System planning, EG2050 Probabilistic production cost simulation of electricity markets L12 Lennart Söder Professor in Electric Power Systems Probabilistic production cost simulation (PPC) Development
More informationSECOND EDITION. MARY R. HARDY University of Waterloo, Ontario. HOWARD R. WATERS Heriot-Watt University, Edinburgh
ACTUARIAL MATHEMATICS FOR LIFE CONTINGENT RISKS SECOND EDITION DAVID C. M. DICKSON University of Melbourne MARY R. HARDY University of Waterloo, Ontario HOWARD R. WATERS Heriot-Watt University, Edinburgh
More informationCPSC 540: Machine Learning
CPSC 540: Machine Learning Monte Carlo Methods Mark Schmidt University of British Columbia Winter 2019 Last Time: Markov Chains We can use Markov chains for density estimation, d p(x) = p(x 1 ) p(x }{{}
More informationMonte Carlo Simulations in the Teaching Process
Monte Carlo Simulations in the Teaching Process Blanka Šedivá Department of Mathematics, Faculty of Applied Sciences University of West Bohemia, Plzeň, Czech Republic CADGME 2018 Conference on Digital
More informationUsing Monte Carlo Integration and Control Variates to Estimate π
Using Monte Carlo Integration and Control Variates to Estimate π N. Cannady, P. Faciane, D. Miksa LSU July 9, 2009 Abstract We will demonstrate the utility of Monte Carlo integration by using this algorithm
More information-divergences and Monte Carlo methods
-divergences and Monte Carlo methods Summary - english version Ph.D. candidate OLARIU Emanuel Florentin Advisor Professor LUCHIAN Henri This thesis broadly concerns the use of -divergences mainly for variance
More informationStrategies for Improving the Efficiency of Monte-Carlo Methods
Strategies for Improving the Efficiency of Monte-Carlo Methods Paul J. Atzberger General comments or corrections should be sent to: paulatz@cims.nyu.edu Introduction The Monte-Carlo method is a useful
More informationROM SIMULATION Exact Moment Simulation using Random Orthogonal Matrices
ROM SIMULATION Exact Moment Simulation using Random Orthogonal Matrices Bachelier Finance Society Meeting Toronto 2010 Henley Business School at Reading Contact Author : d.ledermann@icmacentre.ac.uk Alexander
More informationPractical example of an Economic Scenario Generator
Practical example of an Economic Scenario Generator Martin Schenk Actuarial & Insurance Solutions SAV 7 March 2014 Agenda Introduction Deterministic vs. stochastic approach Mathematical model Application
More informationChapter 2 Uncertainty Analysis and Sampling Techniques
Chapter 2 Uncertainty Analysis and Sampling Techniques The probabilistic or stochastic modeling (Fig. 2.) iterative loop in the stochastic optimization procedure (Fig..4 in Chap. ) involves:. Specifying
More informationMartingale Pricing Theory in Discrete-Time and Discrete-Space Models
IEOR E4707: Foundations of Financial Engineering c 206 by Martin Haugh Martingale Pricing Theory in Discrete-Time and Discrete-Space Models These notes develop the theory of martingale pricing in a discrete-time,
More informationImportance Sampling for Fair Policy Selection
Importance Sampling for Fair Policy Selection Shayan Doroudi Carnegie Mellon University Pittsburgh, PA 15213 shayand@cs.cmu.edu Philip S. Thomas Carnegie Mellon University Pittsburgh, PA 15213 philipt@cs.cmu.edu
More information4 Reinforcement Learning Basic Algorithms
Learning in Complex Systems Spring 2011 Lecture Notes Nahum Shimkin 4 Reinforcement Learning Basic Algorithms 4.1 Introduction RL methods essentially deal with the solution of (optimal) control problems
More informationMonte Carlo Methods for Uncertainty Quantification
Monte Carlo Methods for Uncertainty Quantification Abdul-Lateef Haji-Ali Based on slides by: Mike Giles Mathematical Institute, University of Oxford Contemporary Numerical Techniques Haji-Ali (Oxford)
More informationMath 416/516: Stochastic Simulation
Math 416/516: Stochastic Simulation Haijun Li lih@math.wsu.edu Department of Mathematics Washington State University Week 13 Haijun Li Math 416/516: Stochastic Simulation Week 13 1 / 28 Outline 1 Simulation
More informationOptimal Search for Parameters in Monte Carlo Simulation for Derivative Pricing
Optimal Search for Parameters in Monte Carlo Simulation for Derivative Pricing Prof. Chuan-Ju Wang Department of Computer Science University of Taipei Joint work with Prof. Ming-Yang Kao March 28, 2014
More informationSampling and sampling distribution
Sampling and sampling distribution September 12, 2017 STAT 101 Class 5 Slide 1 Outline of Topics 1 Sampling 2 Sampling distribution of a mean 3 Sampling distribution of a proportion STAT 101 Class 5 Slide
More informationMonte Carlo and Empirical Methods for Stochastic Inference (MASM11/FMSN50)
Monte Carlo and Empirical Methods for Stochastic Inference (MASM11/FMSN50) Magnus Wiktorsson Centre for Mathematical Sciences Lund University, Sweden Lecture 2 Random number generation January 18, 2018
More informationMonte Carlo Methods in Financial Engineering
Paul Glassennan Monte Carlo Methods in Financial Engineering With 99 Figures
More informationCPSC 540: Machine Learning
CPSC 540: Machine Learning Monte Carlo Methods Mark Schmidt University of British Columbia Winter 2018 Last Time: Markov Chains We can use Markov chains for density estimation, p(x) = p(x 1 ) }{{} d p(x
More informationPROBABILITY. Wiley. With Applications and R ROBERT P. DOBROW. Department of Mathematics. Carleton College Northfield, MN
PROBABILITY With Applications and R ROBERT P. DOBROW Department of Mathematics Carleton College Northfield, MN Wiley CONTENTS Preface Acknowledgments Introduction xi xiv xv 1 First Principles 1 1.1 Random
More informationPremia 14 HESTON MODEL CALIBRATION USING VARIANCE SWAPS PRICES
Premia 14 HESTON MODEL CALIBRATION USING VARIANCE SWAPS PRICES VADIM ZHERDER Premia Team INRIA E-mail: vzherder@mailru 1 Heston model Let the asset price process S t follows the Heston stochastic volatility
More informationMarket Risk: FROM VALUE AT RISK TO STRESS TESTING. Agenda. Agenda (Cont.) Traditional Measures of Market Risk
Market Risk: FROM VALUE AT RISK TO STRESS TESTING Agenda The Notional Amount Approach Price Sensitivity Measure for Derivatives Weakness of the Greek Measure Define Value at Risk 1 Day to VaR to 10 Day
More informationدرس هفتم یادگیري ماشین. (Machine Learning) دانشگاه فردوسی مشهد دانشکده مهندسی رضا منصفی
یادگیري ماشین توزیع هاي نمونه و تخمین نقطه اي پارامترها Sampling Distributions and Point Estimation of Parameter (Machine Learning) دانشگاه فردوسی مشهد دانشکده مهندسی رضا منصفی درس هفتم 1 Outline Introduction
More informationPresented at the 2012 SCEA/ISPA Joint Annual Conference and Training Workshop -
Applying the Pareto Principle to Distribution Assignment in Cost Risk and Uncertainty Analysis James Glenn, Computer Sciences Corporation Christian Smart, Missile Defense Agency Hetal Patel, Missile Defense
More informationChapter 7: Point Estimation and Sampling Distributions
Chapter 7: Point Estimation and Sampling Distributions Seungchul Baek Department of Statistics, University of South Carolina STAT 509: Statistics for Engineers 1 / 20 Motivation In chapter 3, we learned
More informationI. Time Series and Stochastic Processes
I. Time Series and Stochastic Processes Purpose of this Module Introduce time series analysis as a method for understanding real-world dynamic phenomena Define different types of time series Explain the
More informationINSTITUTE AND FACULTY OF ACTUARIES. Curriculum 2019 SPECIMEN SOLUTIONS
INSTITUTE AND FACULTY OF ACTUARIES Curriculum 2019 SPECIMEN SOLUTIONS Subject CM1A Actuarial Mathematics Institute and Faculty of Actuaries 1 ( 91 ( 91 365 1 0.08 1 i = + 365 ( 91 365 0.980055 = 1+ i 1+
More informationChapter 5. Continuous Random Variables and Probability Distributions. 5.1 Continuous Random Variables
Chapter 5 Continuous Random Variables and Probability Distributions 5.1 Continuous Random Variables 1 2CHAPTER 5. CONTINUOUS RANDOM VARIABLES AND PROBABILITY DISTRIBUTIONS Probability Distributions Probability
More informationFREDRIK BAJERS VEJ 7 G 9220 AALBORG ØST Tlf.: URL: Fax: Monte Carlo methods
INSTITUT FOR MATEMATISKE FAG AALBORG UNIVERSITET FREDRIK BAJERS VEJ 7 G 9220 AALBORG ØST Tlf.: 96 35 88 63 URL: www.math.auc.dk Fax: 98 15 81 29 E-mail: jm@math.aau.dk Monte Carlo methods Monte Carlo methods
More informationIEOR E4703: Monte-Carlo Simulation
IEOR E4703: Monte-Carlo Simulation Simulating Stochastic Differential Equations Martin Haugh Department of Industrial Engineering and Operations Research Columbia University Email: martin.b.haugh@gmail.com
More informationMonte Carlo Methods in Option Pricing. UiO-STK4510 Autumn 2015
Monte Carlo Methods in Option Pricing UiO-STK4510 Autumn 015 The Basics of Monte Carlo Method Goal: Estimate the expectation θ = E[g(X)], where g is a measurable function and X is a random variable such
More informationCalculating VaR. There are several approaches for calculating the Value at Risk figure. The most popular are the
VaR Pro and Contra Pro: Easy to calculate and to understand. It is a common language of communication within the organizations as well as outside (e.g. regulators, auditors, shareholders). It is not really
More information3. Monte Carlo Simulation
3. Monte Carlo Simulation 3.7 Variance Reduction Techniques Math443 W08, HM Zhu Variance Reduction Procedures (Chap 4.5., 4.5.3, Brandimarte) Usually, a very large value of M is needed to estimate V with
More informationMeasuring and managing market risk June 2003
Page 1 of 8 Measuring and managing market risk June 2003 Investment management is largely concerned with risk management. In the management of the Petroleum Fund, considerable emphasis is therefore placed
More informationDomokos Vermes. Min Zhao
Domokos Vermes and Min Zhao WPI Financial Mathematics Laboratory BSM Assumptions Gaussian returns Constant volatility Market Reality Non-zero skew Positive and negative surprises not equally likely Excess
More informationMonte Carlo Introduction
Monte Carlo Introduction Probability Based Modeling Concepts moneytree.com Toll free 1.877.421.9815 1 What is Monte Carlo? Monte Carlo Simulation is the currently accepted term for a technique used by
More informationAn Experimental Study of the Behaviour of the Proxel-Based Simulation Algorithm
An Experimental Study of the Behaviour of the Proxel-Based Simulation Algorithm Sanja Lazarova-Molnar, Graham Horton Otto-von-Guericke-Universität Magdeburg Abstract The paradigm of the proxel ("probability
More informationMath Computational Finance Double barrier option pricing using Quasi Monte Carlo and Brownian Bridge methods
. Math 623 - Computational Finance Double barrier option pricing using Quasi Monte Carlo and Brownian Bridge methods Pratik Mehta pbmehta@eden.rutgers.edu Masters of Science in Mathematical Finance Department
More informationEconomics 2010c: Lecture 4 Precautionary Savings and Liquidity Constraints
Economics 2010c: Lecture 4 Precautionary Savings and Liquidity Constraints David Laibson 9/11/2014 Outline: 1. Precautionary savings motives 2. Liquidity constraints 3. Application: Numerical solution
More information2 Control variates. λe λti λe e λt i where R(t) = t Y 1 Y N(t) is the time from the last event to t. L t = e λr(t) e e λt(t) Exercises
96 ChapterVI. Variance Reduction Methods stochastic volatility ISExSoren5.9 Example.5 (compound poisson processes) Let X(t) = Y + + Y N(t) where {N(t)},Y, Y,... are independent, {N(t)} is Poisson(λ) with
More informationSTATS 200: Introduction to Statistical Inference. Lecture 4: Asymptotics and simulation
STATS 200: Introduction to Statistical Inference Lecture 4: Asymptotics and simulation Recap We ve discussed a few examples of how to determine the distribution of a statistic computed from data, assuming
More informationPublication date: 12-Nov-2001 Reprinted from RatingsDirect
Publication date: 12-Nov-2001 Reprinted from RatingsDirect Commentary CDO Evaluator Applies Correlation and Monte Carlo Simulation to the Art of Determining Portfolio Quality Analyst: Sten Bergman, New
More informationHistory of Monte Carlo Method
Monte Carlo Methods History of Monte Carlo Method Errors in Estimation and Two Important Questions for Monte Carlo Controlling Error A simple Monte Carlo simulation to approximate the value of pi could
More informationSTOCHASTIC COST ESTIMATION AND RISK ANALYSIS IN MANAGING SOFTWARE PROJECTS
Full citation: Connor, A.M., & MacDonell, S.G. (25) Stochastic cost estimation and risk analysis in managing software projects, in Proceedings of the ISCA 14th International Conference on Intelligent and
More information1. For a special whole life insurance on (x), payable at the moment of death:
**BEGINNING OF EXAMINATION** 1. For a special whole life insurance on (x), payable at the moment of death: µ () t = 0.05, t > 0 (ii) δ = 0.08 x (iii) (iv) The death benefit at time t is bt 0.06t = e, t
More informationMath Computational Finance Option pricing using Brownian bridge and Stratified samlping
. Math 623 - Computational Finance Option pricing using Brownian bridge and Stratified samlping Pratik Mehta pbmehta@eden.rutgers.edu Masters of Science in Mathematical Finance Department of Mathematics,
More informationVersion A. Problem 1. Let X be the continuous random variable defined by the following pdf: 1 x/2 when 0 x 2, f(x) = 0 otherwise.
Math 224 Q Exam 3A Fall 217 Tues Dec 12 Version A Problem 1. Let X be the continuous random variable defined by the following pdf: { 1 x/2 when x 2, f(x) otherwise. (a) Compute the mean µ E[X]. E[X] x
More informationImportance Sampling for Option Pricing. Steven R. Dunbar. Put Options. Monte Carlo Method. Importance. Sampling. Examples.
for for January 25, 2016 1 / 26 Outline for 1 2 3 4 2 / 26 Put Option for A put option is the right to sell an asset at an established price at a certain time. The established price is the strike price,
More informationMonte Carlo Methods for Uncertainty Quantification
Monte Carlo Methods for Uncertainty Quantification Abdul-Lateef Haji-Ali Based on slides by: Mike Giles Mathematical Institute, University of Oxford Contemporary Numerical Techniques Haji-Ali (Oxford)
More informationAssembly systems with non-exponential machines: Throughput and bottlenecks
Nonlinear Analysis 69 (2008) 911 917 www.elsevier.com/locate/na Assembly systems with non-exponential machines: Throughput and bottlenecks ShiNung Ching, Semyon M. Meerkov, Liang Zhang Department of Electrical
More informationDRAFT. 1 exercise in state (S, t), π(s, t) = 0 do not exercise in state (S, t) Review of the Risk Neutral Stock Dynamics
Chapter 12 American Put Option Recall that the American option has strike K and maturity T and gives the holder the right to exercise at any time in [0, T ]. The American option is not straightforward
More informationRandom Variables Handout. Xavier Vilà
Random Variables Handout Xavier Vilà Course 2004-2005 1 Discrete Random Variables. 1.1 Introduction 1.1.1 Definition of Random Variable A random variable X is a function that maps each possible outcome
More informationMarket risk measurement in practice
Lecture notes on risk management, public policy, and the financial system Allan M. Malz Columbia University 2018 Allan M. Malz Last updated: October 23, 2018 2/32 Outline Nonlinearity in market risk Market
More informationMONTE CARLO EXTENSIONS
MONTE CARLO EXTENSIONS School of Mathematics 2013 OUTLINE 1 REVIEW OUTLINE 1 REVIEW 2 EXTENSION TO MONTE CARLO OUTLINE 1 REVIEW 2 EXTENSION TO MONTE CARLO 3 SUMMARY MONTE CARLO SO FAR... Simple to program
More informationFinancial Risk Modeling on Low-power Accelerators: Experimental Performance Evaluation of TK1 with FPGA
Financial Risk Modeling on Low-power Accelerators: Experimental Performance Evaluation of TK1 with FPGA Rajesh Bordawekar and Daniel Beece IBM T. J. Watson Research Center 3/17/2015 2014 IBM Corporation
More informationSTOCHASTIC COST ESTIMATION AND RISK ANALYSIS IN MANAGING SOFTWARE PROJECTS
STOCHASTIC COST ESTIMATION AND RISK ANALYSIS IN MANAGING SOFTWARE PROJECTS Dr A.M. Connor Software Engineering Research Lab Auckland University of Technology Auckland, New Zealand andrew.connor@aut.ac.nz
More information"Vibrato" Monte Carlo evaluation of Greeks
"Vibrato" Monte Carlo evaluation of Greeks (Smoking Adjoints: part 3) Mike Giles mike.giles@maths.ox.ac.uk Oxford University Mathematical Institute Oxford-Man Institute of Quantitative Finance MCQMC 2008,
More informationFast Computation of the Economic Capital, the Value at Risk and the Greeks of a Loan Portfolio in the Gaussian Factor Model
arxiv:math/0507082v2 [math.st] 8 Jul 2005 Fast Computation of the Economic Capital, the Value at Risk and the Greeks of a Loan Portfolio in the Gaussian Factor Model Pavel Okunev Department of Mathematics
More informationA new approach for scenario generation in risk management
A new approach for scenario generation in risk management Josef Teichmann TU Wien Vienna, March 2009 Scenario generators Scenarios of risk factors are needed for the daily risk analysis (1D and 10D ahead)
More informationEFFICIENT MONTE CARLO ALGORITHM FOR PRICING BARRIER OPTIONS
Commun. Korean Math. Soc. 23 (2008), No. 2, pp. 285 294 EFFICIENT MONTE CARLO ALGORITHM FOR PRICING BARRIER OPTIONS Kyoung-Sook Moon Reprinted from the Communications of the Korean Mathematical Society
More informationFinancial Engineering. Craig Pirrong Spring, 2006
Financial Engineering Craig Pirrong Spring, 2006 March 8, 2006 1 Levy Processes Geometric Brownian Motion is very tractible, and captures some salient features of speculative price dynamics, but it is
More information[D7] PROBABILITY DISTRIBUTION OF OUTSTANDING LIABILITY FROM INDIVIDUAL PAYMENTS DATA Contributed by T S Wright
Faculty and Institute of Actuaries Claims Reserving Manual v.2 (09/1997) Section D7 [D7] PROBABILITY DISTRIBUTION OF OUTSTANDING LIABILITY FROM INDIVIDUAL PAYMENTS DATA Contributed by T S Wright 1. Introduction
More informationContents Critique 26. portfolio optimization 32
Contents Preface vii 1 Financial problems and numerical methods 3 1.1 MATLAB environment 4 1.1.1 Why MATLAB? 5 1.2 Fixed-income securities: analysis and portfolio immunization 6 1.2.1 Basic valuation of
More informationRISK MITIGATION IN FAST TRACKING PROJECTS
Voorbeeld paper CCE certificering RISK MITIGATION IN FAST TRACKING PROJECTS Author ID # 4396 June 2002 G:\DACE\certificering\AACEI\presentation 2003 page 1 of 17 Table of Contents Abstract...3 Introduction...4
More informationIEOR E4703: Monte-Carlo Simulation
IEOR E4703: Monte-Carlo Simulation Simulation Efficiency and an Introduction to Variance Reduction Methods Martin Haugh Department of Industrial Engineering and Operations Research Columbia University
More informationEquity correlations implied by index options: estimation and model uncertainty analysis
1/18 : estimation and model analysis, EDHEC Business School (joint work with Rama COT) Modeling and managing financial risks Paris, 10 13 January 2011 2/18 Outline 1 2 of multi-asset models Solution to
More informationROM Simulation with Exact Means, Covariances, and Multivariate Skewness
ROM Simulation with Exact Means, Covariances, and Multivariate Skewness Michael Hanke 1 Spiridon Penev 2 Wolfgang Schief 2 Alex Weissensteiner 3 1 Institute for Finance, University of Liechtenstein 2 School
More informationValue at Risk Ch.12. PAK Study Manual
Value at Risk Ch.12 Related Learning Objectives 3a) Apply and construct risk metrics to quantify major types of risk exposure such as market risk, credit risk, liquidity risk, regulatory risk etc., and
More informationInvestigations on Factors Influencing the Operational Benefit of Stochastic Optimization in Generation and Trading Planning
Investigations on Factors Influencing the Operational Benefit of Stochastic Optimization in Generation and Trading Planning Introduction Stochastic Optimization Model Exemplary Investigations Summary Dipl.-Ing.
More informationMonte Carlo Methods in Finance
Monte Carlo Methods in Finance Peter Jackel JOHN WILEY & SONS, LTD Preface Acknowledgements Mathematical Notation xi xiii xv 1 Introduction 1 2 The Mathematics Behind Monte Carlo Methods 5 2.1 A Few Basic
More informationUsing Monte Carlo Analysis in Ecological Risk Assessments
10/27/00 Page 1 of 15 Using Monte Carlo Analysis in Ecological Risk Assessments Argonne National Laboratory Abstract Monte Carlo analysis is a statistical technique for risk assessors to evaluate the uncertainty
More informationHand and Spreadsheet Simulations
1 / 34 Hand and Spreadsheet Simulations Christos Alexopoulos and Dave Goldsman Georgia Institute of Technology, Atlanta, GA, USA 9/8/16 2 / 34 Outline 1 Stepping Through a Differential Equation 2 Monte
More informationMobility for the Future:
Mobility for the Future: Cambridge Municipal Vehicle Fleet Options FINAL APPLICATION PORTFOLIO REPORT Christopher Evans December 12, 2006 Executive Summary The Public Works Department of the City of Cambridge
More informationB. Maddah INDE 504 Discrete-Event Simulation. Output Analysis (3)
B. Maddah INDE 504 Discrete-Event Simulation Output Analysis (3) Variance Reduction Variance reduction techniques (VRT) are methods to reduce the variance (i.e. increase precision) of simulation output
More informationInstitute of Actuaries of India Subject CT6 Statistical Methods
Institute of Actuaries of India Subject CT6 Statistical Methods For 2014 Examinations Aim The aim of the Statistical Methods subject is to provide a further grounding in mathematical and statistical techniques
More informationComputer Exercise 2 Simulation
Lund University with Lund Institute of Technology Valuation of Derivative Assets Centre for Mathematical Sciences, Mathematical Statistics Fall 2017 Computer Exercise 2 Simulation This lab deals with pricing
More informationOverview. Transformation method Rejection method. Monte Carlo vs ordinary methods. 1 Random numbers. 2 Monte Carlo integration.
Overview 1 Random numbers Transformation method Rejection method 2 Monte Carlo integration Monte Carlo vs ordinary methods 3 Summary Transformation method Suppose X has probability distribution p X (x),
More informationA Stochastic Reserving Today (Beyond Bootstrap)
A Stochastic Reserving Today (Beyond Bootstrap) Presented by Roger M. Hayne, PhD., FCAS, MAAA Casualty Loss Reserve Seminar 6-7 September 2012 Denver, CO CAS Antitrust Notice The Casualty Actuarial Society
More informationPricing & Risk Management of Synthetic CDOs
Pricing & Risk Management of Synthetic CDOs Jaffar Hussain* j.hussain@alahli.com September 2006 Abstract The purpose of this paper is to analyze the risks of synthetic CDO structures and their sensitivity
More informationCost Risk and Uncertainty Analysis
MORS Special Meeting 19-22 September 2011 Sheraton Premiere at Tysons Corner, Vienna, VA Mort Anvari Mort.Anvari@us.army.mil 1 The Need For: Without risk analysis, a cost estimate will usually be a point
More informationLecture outline. Monte Carlo Methods for Uncertainty Quantification. Importance Sampling. Importance Sampling
Lecture outline Monte Carlo Methods for Uncertainty Quantification Mike Giles Mathematical Institute, University of Oxford KU Leuven Summer School on Uncertainty Quantification Lecture 2: Variance reduction
More informationGMM for Discrete Choice Models: A Capital Accumulation Application
GMM for Discrete Choice Models: A Capital Accumulation Application Russell Cooper, John Haltiwanger and Jonathan Willis January 2005 Abstract This paper studies capital adjustment costs. Our goal here
More informationTHE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek
HE DISRIBUION OF LOAN PORFOLIO VALUE * Oldrich Alfons Vasicek he amount of capital necessary to support a portfolio of debt securities depends on the probability distribution of the portfolio loss. Consider
More informationMonte Carlo Methods in Structuring and Derivatives Pricing
Monte Carlo Methods in Structuring and Derivatives Pricing Prof. Manuela Pedio (guest) 20263 Advanced Tools for Risk Management and Pricing Spring 2017 Outline and objectives The basic Monte Carlo algorithm
More informationIEOR E4602: Quantitative Risk Management
IEOR E4602: Quantitative Risk Management Basic Concepts and Techniques of Risk Management Martin Haugh Department of Industrial Engineering and Operations Research Columbia University Email: martin.b.haugh@gmail.com
More informationPricing Dynamic Guaranteed Funds Under a Double Exponential. Jump Diffusion Process. Chuang-Chang Chang, Ya-Hui Lien and Min-Hung Tsay
Pricing Dynamic Guaranteed Funds Under a Double Exponential Jump Diffusion Process Chuang-Chang Chang, Ya-Hui Lien and Min-Hung Tsay ABSTRACT This paper complements the extant literature to evaluate the
More informationComputational Finance Improving Monte Carlo
Computational Finance Improving Monte Carlo School of Mathematics 2018 Monte Carlo so far... Simple to program and to understand Convergence is slow, extrapolation impossible. Forward looking method ideal
More informationModelling component reliability using warranty data
ANZIAM J. 53 (EMAC2011) pp.c437 C450, 2012 C437 Modelling component reliability using warranty data Raymond Summit 1 (Received 10 January 2012; revised 10 July 2012) Abstract Accelerated testing is often
More information"Pricing Exotic Options using Strong Convergence Properties
Fourth Oxford / Princeton Workshop on Financial Mathematics "Pricing Exotic Options using Strong Convergence Properties Klaus E. Schmitz Abe schmitz@maths.ox.ac.uk www.maths.ox.ac.uk/~schmitz Prof. Mike
More informationImplementing Models in Quantitative Finance: Methods and Cases
Gianluca Fusai Andrea Roncoroni Implementing Models in Quantitative Finance: Methods and Cases vl Springer Contents Introduction xv Parti Methods 1 Static Monte Carlo 3 1.1 Motivation and Issues 3 1.1.1
More information