Monte Carlo Simulation
|
|
- Dustin Fitzgerald
- 7 years ago
- Views:
Transcription
1 CPSC Handout Monte Carlo Simulation 1 Some History The term Monte Carlo Method is very general. A Monte Carlo method is a stochastic technique, meaning that it is based on using random numbers and probability to investigate problems. Monte Carlo methods are employed in a wide variety of fields including economics, finance, physics, chemistry, engineering, and even the study of traffic flows. Each field using Monte Carlo methods may apply them in different ways, but in essence they are using random numbers to examine some problem and approximate its outcome. As such Monte Carlo methods give us a way to model complex systems that are often extremely hard to investigate with other types of techniques. The term Monte Carlo was introduced by von Neumann and Ulam during World War II, as a code word for the secret work at Los Alamos; it was suggested by the gambling casinos at the city of Monte Carlo in Monaco. The Monte Carlo method was then applied to problems related to the atomic bomb. What we shall describe below as the basic Monte Carlo algorithm has been known since about A somewhat popular game at the time was to throw a needle onto a board ruled with parallel straight lines and then calculate the value of π from observations of the number of intersections between needle and lines. This algorithm was published by A. Hall in an article titled On an experimental determination of PI in the Journal Messenger of Mathematics in For a simulation of the experiment see The Monte Carlo method took off as a computational tool when computers became available and radical improvements over the basic algorithm were found, described below under Markov Chain Monte Carlo. 2 Basic Monte Carlo Simulation The basic idea of Monte Carlo is very simple. Since mean values of stochastic variables can be expressed as the integral of a variable times the probability density function, we could reverse the process by generating stochastic numbers and computing their mean by simple averaging. In theory, this should then give you an approximation to the integral. Let s make this more precise. Suppose we have an integral to evaluate of the form I = h(x)f(x)dx (1) where is some (usually high dimensional) domain with coordinates x and f(x) is a nonnegative function which satisfies f(x)dx = 1. (2) 1
2 Eq. 2 together with the non-negativity conditions allows us to interpret f as a probability density function on. With this interpretation in mind, we see that Eq. 1 is just the formula for the expectation value of h(x), where x are random variables on domain with pdf P (x) = f(x). If we now could generate N random variables x i (these will generally be vector coordinates) with pdf P (x) = f(x), we could approximate I in Eq. 1 by the experimentally observed average I =< h(x) > 1 N N h(x k ). (3) k=1 Even better, we could also estimate the standard deviation of the approximation to I and get some error estimates as well. The example we did earlier, computing the area of the unit circle, can be cast in this form. is the square x = [x, y] = [ 1 1] [ 1 1]. f(x, y) = 1/4 inside, zero elsewhere (just a uniform distribution), and h(x, y) = 1 if x 2 + y 2 < 1 (4) 0 otherwise. (5) In this case it is very easy to generate samples x k of pdf f(x) and the integral I should of course evaluate to π/4. As long as we work in one or two dimensions, the Monte Carlo method is inefficient, and better numerical approximations are available to compute the integral I. Such methods also sample the space by discrete samples x k, k = 1,... N, but usually not in a random way. For such methods, in an M dimensional space, the error in the approximation decreases with N according to N 1/M, (6) which is very very slow in high dimensions. The error in the Monte Carlo method on the other hand decreases as N 1/2, (7) independent of the dimension of! Many scientific problems can be cast into the form (1). Usually h(x) is a known and not too complicated function, but f(x) can only be computed with great effort, as it involves extensive simulation. The difficult part of Monte Carlo simulation lies in finding methods to actually generate random variables x that are distributed with pdf P (x) = f(x). One way around this would be to recast (1) into a different form by defining ĥ(x) = V h(x)f(x) ˆf(x) = 1/V, with V = dx. (8a) (8b) (8c) 2
3 In terms of these new hatted functions our integral (1) looks like I = ĥ(x) ˆf(x)dx, (9) and, at least for hypercubical domains it is easy to generate samples x k as ˆf is just the uniform distribution. Unfortunately this means that, if f was very small on large regions in, we are generating many samples x where it does not contribute much to the average (2). This is wasteful, because our new ĥ is expensive to evaluate since we have to compute f every time, which was expensive. For large problems this is so bad that the method is too slow to be useful in practice. 3 Markov Chain Monte Carlo: The Metropolis Algorithm In 1953 Metropolis and collaborators published a method to effectively sample P (x) = f(x). This algorithm is now known as the Metropolis algorithm. Nicolas Metropolis was a mathematician who worked on the construction of the Los Alamos MANIAC computer used for hydrogen bomb calculations. Edward Teller, the so-called father of the H bomb, is one of the co-authors on the original paper (Journal of Chemical Physics, 1953) describing the algorithm. Please read sections I and II of the paper. The rest is optional. The Metropolis algorithm computes a sequence of vectors x i, i = 1,..., N, that sample P (x). This sequence is highly correlated, but if I then randomly shuffle all the x i, for large enough N, they are random variables with pdf P (x). Some of the values x i can, and usually are, the same. The algorithm appears deceptively simple: 1. Pick any starting point for x Pick a candidate point y at random from some (small) neighborhood around x i. 3. efine p a = P (y)/p (x i ) 4. Generate a uniform random number r on [0 1]. 5. If r < p a set x i+1 = y, otherwise set x i+1 = x i, i.e., reject y. At this point you may ask: how do you pick a candidate point y at random from some (small) neighborhood around x i? This is where the art comes in. Some general conditions on this picking algorithm are known. If they are satisfied you can prove the algorithm converges for large N. The art lies in choosing the picking method such that it converges as fast as possible. Nobody knows how to do this best and techniques used are mainly based on experience in applications to specific problems. One method that works, but is almost as bad as the naive Monte Carlo method described in Section 2, is to just choose y totally at random. The problem is that in most applications P (x) is very small almost everywhere, so that p a (the probability to accept a candidate) is very small. 3
4 So if we find a point with a largish value of P (x) we should generate a cluster of points around there, but we immediately jump away from it and may never find this area in, which is vast, again. What is usually done is to choose y probabilistically, with a pdf (which has nothing directly to do with P (x)) that favors points close to the current point x. So the points x i tend to randomly walk around the domain, governed by some probabilities. Such a random walk is a Markov chain, hence the name Markov Chain Monte Carlo. Other Markov Chain Monte Carlo algorithms besides the Metropolis algorithm exist which have different strategies to sample P (x). If the Markov chain obeys certain rules (which we won t go into) it is provable that the Metropolis algorithm converges to a sampling of P (x). There are infinitely many ways to set up this Markov chain and how you do this precisely is critically important in getting the algorithm to converge in a reasonable amount of time. It is not uncommon to run a Monte Carlo algorithm for months on a cluster of computers. The sample code provided in mcfun2.m illustrates the naive and Metropolis algorithms on a trivial problem, for which we know the answer. The integral to compute is I = 500, 000 π x 2 y 2 e 50(x2 +y 2) dxdy. Some elementary analysis shows that I = 1. We interpret 50 π e 50(x2 +y 2) as P (x) and h(x) = 10, 000x 2 y 2. Note that though the domain is the entire plane, P (x) is very small everywhere except around the origin. The example provided computes the integral with the naive or with the Metropolis algorithm. The Markov chain implemented consists of jumping to another x in a unit square around x. The function reports the numerical approximation to I as well as the α confidence interval. A modest improvement can be observed in the Metropolis method which is all we can hope for in two dimensions. In the figure you can see how the points are sampled with the naive method and with the Metropolis algorithm (a) Naive MC (b) Metropolis (c) A zoom into the central region Figure 1: Computing an integral with the Monte Carlo method with sample code mcfun2.m. The domain is 8 < x, y < 8. The naive algorithm samples over the entire region, which is wasteful, whereas the Metropolis algorithm samples only where it matters. 4
5 4 Statistical Physics Monte Carlo simulation is widely used in statistical physics. Suppose we have a model with a large state space S. For example in molecular physics S would be the listing of the positions and velocities of all the molecules in the system. To simulate an N molecule system then results in a statespace of dimension 6N. The model of the system consists of a formula (or algorithm) to compute the energy E(s) of the system in state s. In molecular applications E could be computed by looking at all neigbouring molecules, evaluating their potential energy due to the interactions of their electron clouds, and summing over all possible pairs. At zero temperature the physical state of the system is then found by finding the state s 0 that minimizes E(s). At non-zero temperature the state fluctuates due to thermal agitation. Suppose we now measure some quantity F (s) which is expressed as some function of the state. For example, we might be interested in the average intermolecular distance or something like that. A basic law of statistical physics states that the measured value of F is the statistical average of F (s) over all the states s with weight factor P (s) (which can be interpreted as a pdf) given by P (s) = Z 1 e E(s)/kT, where k is the Bolzmann constant, T is the temperature in Kelvin, and the normalization constant Z is chosen to make P (s) a proper pdf with integral over state space equal to 1: Z = e E(s)/kT ds. So the observed value of F (s) is S < F >= Z 1 S F (s)e E(s)/kT ds, which is precisely in the form suitable for a Monte Carlo simulation. An example is the Ising model which is used to study phase transitions. So-called spins sit on the sites of a lattice in space. A spin s can take the value +1 or 1. These values could stand for the presence or absence of an atom, or the orientation of a magnetic atom (up or down). The energy of the model derives from the interaction between the spins. We take the energy per pair of neighbors s and s as Jss, where J > 0 is the spin-spin interaction. When the temperature T is high in relation to J, the spins are disordered: they take more or less random values. However, when the temperature T drops below a critical temperature, the spin system orders into a state of broken symmetry and most of the spins have the same sign. If we label the points (usually arranged on a grid) at which the spin variables s i sit i = 1,..., N, the magnetization M can be defined as M(s) = N s i. i=1 5
6 At zero temperature the energy is minimized when all the s i have the same sign and M will have some definite positive or negative value. At non-zero temperature the measured magnetization is given by < M >= Z 1 M(s)e E(s)/kT ds, S which can be computed with a Monte Carlo simulation. Below a critical temperature T c the system becomes magnetized. For a visualization see 6
Introduction to the Monte Carlo method
Some history Simple applications Radiation transport modelling Flux and Dose calculations Variance reduction Easy Monte Carlo Pioneers of the Monte Carlo Simulation Method: Stanisław Ulam (1909 1984) Stanislaw
More informationIntroduction to Monte Carlo. Astro 542 Princeton University Shirley Ho
Introduction to Monte Carlo Astro 542 Princeton University Shirley Ho Agenda Monte Carlo -- definition, examples Sampling Methods (Rejection, Metropolis, Metropolis-Hasting, Exact Sampling) Markov Chains
More informationTutorial on Markov Chain Monte Carlo
Tutorial on Markov Chain Monte Carlo Kenneth M. Hanson Los Alamos National Laboratory Presented at the 29 th International Workshop on Bayesian Inference and Maximum Entropy Methods in Science and Technology,
More informationLecture 7: Continuous Random Variables
Lecture 7: Continuous Random Variables 21 September 2005 1 Our First Continuous Random Variable The back of the lecture hall is roughly 10 meters across. Suppose it were exactly 10 meters, and consider
More informationNotes on Continuous Random Variables
Notes on Continuous Random Variables Continuous random variables are random quantities that are measured on a continuous scale. They can usually take on any value over some interval, which distinguishes
More informationProbability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur
Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur Module No. #01 Lecture No. #15 Special Distributions-VI Today, I am going to introduce
More informationGenerating Random Numbers Variance Reduction Quasi-Monte Carlo. Simulation Methods. Leonid Kogan. MIT, Sloan. 15.450, Fall 2010
Simulation Methods Leonid Kogan MIT, Sloan 15.450, Fall 2010 c Leonid Kogan ( MIT, Sloan ) Simulation Methods 15.450, Fall 2010 1 / 35 Outline 1 Generating Random Numbers 2 Variance Reduction 3 Quasi-Monte
More informationFEGYVERNEKI SÁNDOR, PROBABILITY THEORY AND MATHEmATICAL
FEGYVERNEKI SÁNDOR, PROBABILITY THEORY AND MATHEmATICAL STATIsTICs 4 IV. RANDOm VECTORs 1. JOINTLY DIsTRIBUTED RANDOm VARIABLEs If are two rom variables defined on the same sample space we define the joint
More informationChapter 3 RANDOM VARIATE GENERATION
Chapter 3 RANDOM VARIATE GENERATION In order to do a Monte Carlo simulation either by hand or by computer, techniques must be developed for generating values of random variables having known distributions.
More informationVARIANCE REDUCTION TECHNIQUES FOR IMPLICIT MONTE CARLO SIMULATIONS
VARIANCE REDUCTION TECHNIQUES FOR IMPLICIT MONTE CARLO SIMULATIONS An Undergraduate Research Scholars Thesis by JACOB TAYLOR LANDMAN Submitted to Honors and Undergraduate Research Texas A&M University
More informationProton Nuclear Magnetic Resonance Spectroscopy
Proton Nuclear Magnetic Resonance Spectroscopy Introduction: The NMR Spectrum serves as a great resource in determining the structure of an organic compound by revealing the hydrogen and carbon skeleton.
More informationMonte Carlo-based statistical methods (MASM11/FMS091)
Monte Carlo-based statistical methods (MASM11/FMS091) Jimmy Olsson Centre for Mathematical Sciences Lund University, Sweden Lecture 5 Sequential Monte Carlo methods I February 5, 2013 J. Olsson Monte Carlo-based
More informationMonte Carlo Methods in Finance
Author: Yiyang Yang Advisor: Pr. Xiaolin Li, Pr. Zari Rachev Department of Applied Mathematics and Statistics State University of New York at Stony Brook October 2, 2012 Outline Introduction 1 Introduction
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 5 Sequential Monte Carlo methods I February
More information5. Continuous Random Variables
5. Continuous Random Variables Continuous random variables can take any value in an interval. They are used to model physical characteristics such as time, length, position, etc. Examples (i) Let X be
More informationSimulation Exercises to Reinforce the Foundations of Statistical Thinking in Online Classes
Simulation Exercises to Reinforce the Foundations of Statistical Thinking in Online Classes Simcha Pollack, Ph.D. St. John s University Tobin College of Business Queens, NY, 11439 pollacks@stjohns.edu
More information99.37, 99.38, 99.38, 99.39, 99.39, 99.39, 99.39, 99.40, 99.41, 99.42 cm
Error Analysis and the Gaussian Distribution In experimental science theory lives or dies based on the results of experimental evidence and thus the analysis of this evidence is a critical part of the
More informationStructure Factors 59-553 78
78 Structure Factors Until now, we have only typically considered reflections arising from planes in a hypothetical lattice containing one atom in the asymmetric unit. In practice we will generally deal
More informationSome Examples of (Markov Chain) Monte Carlo Methods
Some Examples of (Markov Chain) Monte Carlo Methods Ryan R. Rosario What is a Monte Carlo method? Monte Carlo methods rely on repeated sampling to get some computational result. Monte Carlo methods originated
More information[Image removed due to copyright concerns]
Radiation Chemistry Ionizing radiation produces abundant secondary electrons that rapidly slow down (thermalize) to energies below 7.4 ev, the threshold to produce electronic transitions in liquid water.
More informationNumerical Methods for Option Pricing
Chapter 9 Numerical Methods for Option Pricing Equation (8.26) provides a way to evaluate option prices. For some simple options, such as the European call and put options, one can integrate (8.26) directly
More information3. INNER PRODUCT SPACES
. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.
More informationLecture 8. Generating a non-uniform probability distribution
Discrete outcomes Lecture 8 Generating a non-uniform probability distribution Last week we discussed generating a non-uniform probability distribution for the case of finite discrete outcomes. An algorithm
More informationProbability and Random Variables. Generation of random variables (r.v.)
Probability and Random Variables Method for generating random variables with a specified probability distribution function. Gaussian And Markov Processes Characterization of Stationary Random Process Linearly
More informationELECTRIC FIELD LINES AND EQUIPOTENTIAL SURFACES
ELECTRIC FIELD LINES AND EQUIPOTENTIAL SURFACES The purpose of this lab session is to experimentally investigate the relation between electric field lines of force and equipotential surfaces in two dimensions.
More information1. The Kinetic Theory of Matter states that all matter is composed of atoms and molecules that are in a constant state of constant random motion
Physical Science Period: Name: ANSWER KEY Date: Practice Test for Unit 3: Ch. 3, and some of 15 and 16: Kinetic Theory of Matter, States of matter, and and thermodynamics, and gas laws. 1. The Kinetic
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete
More information6.4 Normal Distribution
Contents 6.4 Normal Distribution....................... 381 6.4.1 Characteristics of the Normal Distribution....... 381 6.4.2 The Standardized Normal Distribution......... 385 6.4.3 Meaning of Areas under
More informationNEW YORK STATE TEACHER CERTIFICATION EXAMINATIONS
NEW YORK STATE TEACHER CERTIFICATION EXAMINATIONS TEST DESIGN AND FRAMEWORK September 2014 Authorized for Distribution by the New York State Education Department This test design and framework document
More informationAdaptive Search with Stochastic Acceptance Probabilities for Global Optimization
Adaptive Search with Stochastic Acceptance Probabilities for Global Optimization Archis Ghate a and Robert L. Smith b a Industrial Engineering, University of Washington, Box 352650, Seattle, Washington,
More information1. Degenerate Pressure
. Degenerate Pressure We next consider a Fermion gas in quite a different context: the interior of a white dwarf star. Like other stars, white dwarfs have fully ionized plasma interiors. The positively
More informationx 2 + y 2 = 1 y 1 = x 2 + 2x y = x 2 + 2x + 1
Implicit Functions Defining Implicit Functions Up until now in this course, we have only talked about functions, which assign to every real number x in their domain exactly one real number f(x). The graphs
More informationProton Nuclear Magnetic Resonance ( 1 H-NMR) Spectroscopy
Proton Nuclear Magnetic Resonance ( 1 H-NMR) Spectroscopy Theory behind NMR: In the late 1940 s, physical chemists originally developed NMR spectroscopy to study different properties of atomic nuclei,
More informationLeast-Squares Intersection of Lines
Least-Squares Intersection of Lines Johannes Traa - UIUC 2013 This write-up derives the least-squares solution for the intersection of lines. In the general case, a set of lines will not intersect at a
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationSelf Organizing Maps: Fundamentals
Self Organizing Maps: Fundamentals Introduction to Neural Networks : Lecture 16 John A. Bullinaria, 2004 1. What is a Self Organizing Map? 2. Topographic Maps 3. Setting up a Self Organizing Map 4. Kohonen
More informationPractical Calculation of Expected and Unexpected Losses in Operational Risk by Simulation Methods
Practical Calculation of Expected and Unexpected Losses in Operational Risk by Simulation Methods Enrique Navarrete 1 Abstract: This paper surveys the main difficulties involved with the quantitative measurement
More informationThe sample space for a pair of die rolls is the set. The sample space for a random number between 0 and 1 is the interval [0, 1].
Probability Theory Probability Spaces and Events Consider a random experiment with several possible outcomes. For example, we might roll a pair of dice, flip a coin three times, or choose a random real
More informationUsing Excel for inferential statistics
FACT SHEET Using Excel for inferential statistics Introduction When you collect data, you expect a certain amount of variation, just caused by chance. A wide variety of statistical tests can be applied
More informationAlgebra 1 2008. Academic Content Standards Grade Eight and Grade Nine Ohio. Grade Eight. Number, Number Sense and Operations Standard
Academic Content Standards Grade Eight and Grade Nine Ohio Algebra 1 2008 Grade Eight STANDARDS Number, Number Sense and Operations Standard Number and Number Systems 1. Use scientific notation to express
More informationMath 4310 Handout - Quotient Vector Spaces
Math 4310 Handout - Quotient Vector Spaces Dan Collins The textbook defines a subspace of a vector space in Chapter 4, but it avoids ever discussing the notion of a quotient space. This is understandable
More informationChapter Test B. Chapter: Measurements and Calculations
Assessment Chapter Test B Chapter: Measurements and Calculations PART I In the space provided, write the letter of the term or phrase that best completes each statement or best answers each question. 1.
More information1 The Brownian bridge construction
The Brownian bridge construction The Brownian bridge construction is a way to build a Brownian motion path by successively adding finer scale detail. This construction leads to a relatively easy proof
More informationDirichlet forms methods for error calculus and sensitivity analysis
Dirichlet forms methods for error calculus and sensitivity analysis Nicolas BOULEAU, Osaka university, november 2004 These lectures propose tools for studying sensitivity of models to scalar or functional
More informationPart 2: Analysis of Relationship Between Two Variables
Part 2: Analysis of Relationship Between Two Variables Linear Regression Linear correlation Significance Tests Multiple regression Linear Regression Y = a X + b Dependent Variable Independent Variable
More informationSTT315 Chapter 4 Random Variables & Probability Distributions KM. Chapter 4.5, 6, 8 Probability Distributions for Continuous Random Variables
Chapter 4.5, 6, 8 Probability Distributions for Continuous Random Variables Discrete vs. continuous random variables Examples of continuous distributions o Uniform o Exponential o Normal Recall: A random
More informationChapter 4. Probability and Probability Distributions
Chapter 4. robability and robability Distributions Importance of Knowing robability To know whether a sample is not identical to the population from which it was selected, it is necessary to assess the
More informationEXIT TIME PROBLEMS AND ESCAPE FROM A POTENTIAL WELL
EXIT TIME PROBLEMS AND ESCAPE FROM A POTENTIAL WELL Exit Time problems and Escape from a Potential Well Escape From a Potential Well There are many systems in physics, chemistry and biology that exist
More informationAlgebra 2 Chapter 1 Vocabulary. identity - A statement that equates two equivalent expressions.
Chapter 1 Vocabulary identity - A statement that equates two equivalent expressions. verbal model- A word equation that represents a real-life problem. algebraic expression - An expression with variables.
More informationSupervised and unsupervised learning - 1
Chapter 3 Supervised and unsupervised learning - 1 3.1 Introduction The science of learning plays a key role in the field of statistics, data mining, artificial intelligence, intersecting with areas in
More informationObjectives. Materials
Activity 4 Objectives Understand what a slope field represents in terms of Create a slope field for a given differential equation Materials TI-84 Plus / TI-83 Plus Graph paper Introduction One of the ways
More informationLecture 13 - Basic Number Theory.
Lecture 13 - Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that A divides B, denoted
More information2.6. Probability. In general the probability density of a random variable satisfies two conditions:
2.6. PROBABILITY 66 2.6. Probability 2.6.. Continuous Random Variables. A random variable a real-valued function defined on some set of possible outcomes of a random experiment; e.g. the number of points
More informationModel-based Synthesis. Tony O Hagan
Model-based Synthesis Tony O Hagan Stochastic models Synthesising evidence through a statistical model 2 Evidence Synthesis (Session 3), Helsinki, 28/10/11 Graphical modelling The kinds of models that
More informationThe continuous and discrete Fourier transforms
FYSA21 Mathematical Tools in Science The continuous and discrete Fourier transforms Lennart Lindegren Lund Observatory (Department of Astronomy, Lund University) 1 The continuous Fourier transform 1.1
More informationPerformance Optimization of I-4 I 4 Gasoline Engine with Variable Valve Timing Using WAVE/iSIGHT
Performance Optimization of I-4 I 4 Gasoline Engine with Variable Valve Timing Using WAVE/iSIGHT Sean Li, DaimlerChrysler (sl60@dcx dcx.com) Charles Yuan, Engineous Software, Inc (yuan@engineous.com) Background!
More informationSIZE OF A MOLECULE FROM A VISCOSITY MEASUREMENT
Experiment 8, page 1 Version of April 25, 216 Experiment 446.8 SIZE OF A MOLECULE FROM A VISCOSITY MEASUREMENT Theory Viscous Flow. Fluids attempt to minimize flow gradients by exerting a frictional force,
More information2. Spin Chemistry and the Vector Model
2. Spin Chemistry and the Vector Model The story of magnetic resonance spectroscopy and intersystem crossing is essentially a choreography of the twisting motion which causes reorientation or rephasing
More informationGraph Theory Problems and Solutions
raph Theory Problems and Solutions Tom Davis tomrdavis@earthlink.net http://www.geometer.org/mathcircles November, 005 Problems. Prove that the sum of the degrees of the vertices of any finite graph is
More informationPrentice Hall Algebra 2 2011 Correlated to: Colorado P-12 Academic Standards for High School Mathematics, Adopted 12/2009
Content Area: Mathematics Grade Level Expectations: High School Standard: Number Sense, Properties, and Operations Understand the structure and properties of our number system. At their most basic level
More informationNorth Carolina Math 2
Standards for Mathematical Practice 1. Make sense of problems and persevere in solving them. 2. Reason abstractly and quantitatively 3. Construct viable arguments and critique the reasoning of others 4.
More information1. (First passage/hitting times/gambler s ruin problem:) Suppose that X has a discrete state space and let i be a fixed state. Let
Copyright c 2009 by Karl Sigman 1 Stopping Times 1.1 Stopping Times: Definition Given a stochastic process X = {X n : n 0}, a random time τ is a discrete random variable on the same probability space as
More informationMaster s Theory Exam Spring 2006
Spring 2006 This exam contains 7 questions. You should attempt them all. Each question is divided into parts to help lead you through the material. You should attempt to complete as much of each problem
More informationMonte Carlo Sampling Methods
[] Monte Carlo Sampling Methods Jasmina L. Vujic Nuclear Engineering Department University of California, Berkeley Email: vujic@nuc.berkeley.edu phone: (50) 643-8085 fax: (50) 643-9685 [2] Monte Carlo
More informationThis Method will show you exactly how you can profit from this specific online casino and beat them at their own game.
This Method will show you exactly how you can profit from this specific online casino and beat them at their own game. It s NOT complicated, and you DON T need a degree in mathematics or statistics to
More information3.2 Roulette and Markov Chains
238 CHAPTER 3. DISCRETE DYNAMICAL SYSTEMS WITH MANY VARIABLES 3.2 Roulette and Markov Chains In this section we will be discussing an application of systems of recursion equations called Markov Chains.
More informationThe Force Table Vector Addition and Resolution
Name School Date The Force Table Vector Addition and Resolution Vectors? I don't have any vectors, I'm just a kid. From Flight of the Navigator Explore the Apparatus/Theory We ll use the Force Table Apparatus
More informationFeb 28 Homework Solutions Math 151, Winter 2012. Chapter 6 Problems (pages 287-291)
Feb 8 Homework Solutions Math 5, Winter Chapter 6 Problems (pages 87-9) Problem 6 bin of 5 transistors is known to contain that are defective. The transistors are to be tested, one at a time, until the
More informationChemical Kinetics. 2. Using the kinetics of a given reaction a possible reaction mechanism
1. Kinetics is the study of the rates of reaction. Chemical Kinetics 2. Using the kinetics of a given reaction a possible reaction mechanism 3. What is a reaction mechanism? Why is it important? A reaction
More informationIEOR 6711: Stochastic Models, I Fall 2012, Professor Whitt, Final Exam SOLUTIONS
IEOR 6711: Stochastic Models, I Fall 2012, Professor Whitt, Final Exam SOLUTIONS There are four questions, each with several parts. 1. Customers Coming to an Automatic Teller Machine (ATM) (30 points)
More informationProfit Forecast Model Using Monte Carlo Simulation in Excel
Profit Forecast Model Using Monte Carlo Simulation in Excel Petru BALOGH Pompiliu GOLEA Valentin INCEU Dimitrie Cantemir Christian University Abstract Profit forecast is very important for any company.
More informationCORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA
We Can Early Learning Curriculum PreK Grades 8 12 INSIDE ALGEBRA, GRADES 8 12 CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA April 2016 www.voyagersopris.com Mathematical
More informationNotes on Elastic and Inelastic Collisions
Notes on Elastic and Inelastic Collisions In any collision of 2 bodies, their net momentus conserved. That is, the net momentum vector of the bodies just after the collision is the same as it was just
More informationn 2 + 4n + 3. The answer in decimal form (for the Blitz): 0, 75. Solution. (n + 1)(n + 3) = n + 3 2 lim m 2 1
. Calculate the sum of the series Answer: 3 4. n 2 + 4n + 3. The answer in decimal form (for the Blitz):, 75. Solution. n 2 + 4n + 3 = (n + )(n + 3) = (n + 3) (n + ) = 2 (n + )(n + 3) ( 2 n + ) = m ( n
More informationSPEED, VELOCITY, AND ACCELERATION
reflect Look at the picture of people running across a field. What words come to mind? Maybe you think about the word speed to describe how fast the people are running. You might think of the word acceleration
More informationName Partners Date. Energy Diagrams I
Name Partners Date Visual Quantum Mechanics The Next Generation Energy Diagrams I Goal Changes in energy are a good way to describe an object s motion. Here you will construct energy diagrams for a toy
More informationAn introduction to Value-at-Risk Learning Curve September 2003
An introduction to Value-at-Risk Learning Curve September 2003 Value-at-Risk The introduction of Value-at-Risk (VaR) as an accepted methodology for quantifying market risk is part of the evolution of risk
More information2013 MBA Jump Start Program. Statistics Module Part 3
2013 MBA Jump Start Program Module 1: Statistics Thomas Gilbert Part 3 Statistics Module Part 3 Hypothesis Testing (Inference) Regressions 2 1 Making an Investment Decision A researcher in your firm just
More informationTHE CENTRAL LIMIT THEOREM TORONTO
THE CENTRAL LIMIT THEOREM DANIEL RÜDT UNIVERSITY OF TORONTO MARCH, 2010 Contents 1 Introduction 1 2 Mathematical Background 3 3 The Central Limit Theorem 4 4 Examples 4 4.1 Roulette......................................
More informationFigure 1.1 Vector A and Vector F
CHAPTER I VECTOR QUANTITIES Quantities are anything which can be measured, and stated with number. Quantities in physics are divided into two types; scalar and vector quantities. Scalar quantities have
More informationSouth Carolina College- and Career-Ready (SCCCR) Pre-Calculus
South Carolina College- and Career-Ready (SCCCR) Pre-Calculus Key Concepts Arithmetic with Polynomials and Rational Expressions PC.AAPR.2 PC.AAPR.3 PC.AAPR.4 PC.AAPR.5 PC.AAPR.6 PC.AAPR.7 Standards Know
More informationBiggar High School Mathematics Department. National 5 Learning Intentions & Success Criteria: Assessing My Progress
Biggar High School Mathematics Department National 5 Learning Intentions & Success Criteria: Assessing My Progress Expressions & Formulae Topic Learning Intention Success Criteria I understand this Approximation
More informationLINES AND PLANES IN R 3
LINES AND PLANES IN R 3 In this handout we will summarize the properties of the dot product and cross product and use them to present arious descriptions of lines and planes in three dimensional space.
More informationActivity Two. Getting to Know the Water Molecule
Activity Overview: Activity Two Getting to Know the Water Molecule Key concepts: Water molecules are small and highly polar. Their polar nature gives water its unusual, macroscopic properties. On a microscopic
More informationEighth Annual Student Research Forum
Eighth Annual Student Research Forum February 18, 2011 COMPUTER SCIENCE AND COMPUTATIONAL SCIENCE PRESENTATION SCHEDULE Session Chair: Dr. George Miminis Head, Computer Science: Dr. Edward Brown Director,
More informationcorrect-choice plot f(x) and draw an approximate tangent line at x = a and use geometry to estimate its slope comment The choices were:
Topic 1 2.1 mode MultipleSelection text How can we approximate the slope of the tangent line to f(x) at a point x = a? This is a Multiple selection question, so you need to check all of the answers that
More informationIn mathematics, there are four attainment targets: using and applying mathematics; number and algebra; shape, space and measures, and handling data.
MATHEMATICS: THE LEVEL DESCRIPTIONS In mathematics, there are four attainment targets: using and applying mathematics; number and algebra; shape, space and measures, and handling data. Attainment target
More informationMapping the Magnetic Field
I Mapping the Magnetic Field Mapping the Magnetic Field Vector Fields The electric field, E, and the magnetic field, B, are two examples of what are termed vector fields, quantities which have both magnitude
More informationWeb Design Issues. Thane B. Terrill Summer 1999
Web Design Issues Thane B. Terrill Summer 1999 This presentation covers some of the most common issues that are confronted by the serious web designer. Web design has many unique characteristics that make
More informationWhat mathematical optimization can, and cannot, do for biologists. Steven Kelk Department of Knowledge Engineering (DKE) Maastricht University, NL
What mathematical optimization can, and cannot, do for biologists Steven Kelk Department of Knowledge Engineering (DKE) Maastricht University, NL Introduction There is no shortage of literature about the
More information3 Some Integer Functions
3 Some Integer Functions A Pair of Fundamental Integer Functions The integer function that is the heart of this section is the modulo function. However, before getting to it, let us look at some very simple
More informationLab 11. Simulations. The Concept
Lab 11 Simulations In this lab you ll learn how to create simulations to provide approximate answers to probability questions. We ll make use of a particular kind of structure, called a box model, that
More informationReferences. Importance Sampling. Jessi Cisewski (CMU) Carnegie Mellon University. June 2014
Jessi Cisewski Carnegie Mellon University June 2014 Outline 1 Recall: Monte Carlo integration 2 3 Examples of (a) Monte Carlo, Monaco (b) Monte Carlo Casino Some content and examples from Wasserman (2004)
More informationSignal to Noise Instrumental Excel Assignment
Signal to Noise Instrumental Excel Assignment Instrumental methods, as all techniques involved in physical measurements, are limited by both the precision and accuracy. The precision and accuracy of a
More informationA Game Theoretical Framework for Adversarial Learning
A Game Theoretical Framework for Adversarial Learning Murat Kantarcioglu University of Texas at Dallas Richardson, TX 75083, USA muratk@utdallas Chris Clifton Purdue University West Lafayette, IN 47907,
More informationMathematics (Project Maths Phase 1)
2012. M128 S Coimisiún na Scrúduithe Stáit State Examinations Commission Leaving Certificate Examination, 2012 Sample Paper Mathematics (Project Maths Phase 1) Paper 2 Ordinary Level Time: 2 hours, 30
More informationE3: PROBABILITY AND STATISTICS lecture notes
E3: PROBABILITY AND STATISTICS lecture notes 2 Contents 1 PROBABILITY THEORY 7 1.1 Experiments and random events............................ 7 1.2 Certain event. Impossible event............................
More informationStudy the following diagrams of the States of Matter. Label the names of the Changes of State between the different states.
Describe the strength of attractive forces between particles. Describe the amount of space between particles. Can the particles in this state be compressed? Do the particles in this state have a definite
More information= δx x + δy y. df ds = dx. ds y + xdy ds. Now multiply by ds to get the form of the equation in terms of differentials: df = y dx + x dy.
ERROR PROPAGATION For sums, differences, products, and quotients, propagation of errors is done as follows. (These formulas can easily be calculated using calculus, using the differential as the associated
More informationProbability Models.S1 Introduction to Probability
Probability Models.S1 Introduction to Probability Operations Research Models and Methods Paul A. Jensen and Jonathan F. Bard The stochastic chapters of this book involve random variability. Decisions are
More information