1 Introduction to reducing variance in Monte Carlo simulations

Size: px
Start display at page:

Download "1 Introduction to reducing variance in Monte Carlo simulations"

Transcription

1 Copyright c 007 by Karl Sigma 1 Itroductio to reducig variace i Mote Carlo simulatios 11 Review of cofidece itervals for estimatig a mea I statistics, we estimate a uow mea µ = E(X) of a distributio by collectig iid samples from the distributio, X 1,, X ad usig the sample mea X() = 1 X j (1) Lettig σ = V ar(x) deote the variace of the distributio, we coclude that V ar(x()) = σ () The cetral limit theorem asserts that as, the distributio of def Z = σ (X() µ) teds to N(0, 1), the uit ormal distributio Lettig Z deote a N(0, 1) rv, we coclude that for sufficietly large, Z Z i distributio From here we obtai for ay z 0, P ( X() µ > z σ ) P ( Z > z) = P (Z > z) (We ca obtai ay value of P (Z > z) by referrig to tables, etc) For ay α > 0 o matter how small (such as α = 005), lettig z α/ be such that P (Z > z α/ ) = α/, we thus have P ( X() µ > z α/ σ ) α, which implies that the uow mea µ lies withi the iterval X() ± z α/ σ with (approximately) probability 1 α This allows us to costruct cofidece itervals for our estimate: we say that the iterval X() ± z α/ σ is a 100(1 α)% cofidece iterval for the mea µ Typically, we would use (say) α = 005 i which case z α/ = z 005 = 196, ad we thus obtai a 95% cofidece iterval X() ± (196) σ The legth of the cofidece iterval is (196) σ which of course teds to 0 as the sample size gets larger I practice we would ot actually ow the value of σ ; it would be uow (just as µ is) But this is ot really a problem: we istead use a estimate for it, the sample variace s () defied by s () = 1 1 (X j X ) It ca be show that s () σ, with probability 1, as ad that E(s ()) = σ, 1

2 So, i practice we would use s() is place of σ whe costructig our cofidece itervals For example, a 95% cofidece iterval is give by X() ± (196) s() The followig recursios ca be derived; they are useful whe implemetig a simulatio requirig a cofidece iterval: X +1 = X + X +1 X, + 1 ( S+1 = 1 1 ) S + ( + 1)(X +1 X ) 1 Applicatio to Mote Carlo simulatio I Mote Carlo simulatio, istead of collectig the iid data X 1,, X, we simulate it Moreover, we ca choose as large as we wat; = 10, 000 for example, so the cetral limit theorem justificatio for costructig cofidece itervals ca safely be used Thus we ca immediately obtai cofidece itervals for Mote Carlo estimates But simulatio also allows us to be clever: We ca purposely try to iduce egative correlatio amog the variables X 1,, X, or geerate copies that while havig the same mea, have a smaller variace, so that the variace of the estimator i (1) becomes smaller tha σ resultig i a smaller cofidece iterval The idea is to try to get eve better estimates by reducig the ucertaity i our estimate I the ext sectios, we explore ways of doig this 13 Atithetic variates method Let X i deote our copies of X (each has the same distributio hece the same mea µ ad variace σ ) but let us ot assume that they are idepedet Let = m, for some m 1, that is, is eve Note that where X() = 1 m m X j = 1 m Y j = Y (m), (3) m ad we coclude that Y 1 = X 1 + X Y = X 3 + X 4 Y m = X 1 + X, The two estimators Y (m) ad X() for E(X) i (3) are idetical Because they are idetical, we ca ad will use Y (m) i what follows Moreover, E(Y i ) = E(X) = µ (remember we are assumig that the X i all have the same distributio hece the same mea) This meas that for purposes of argumet here we ca view each Y i as the ed

3 copy that we wish to simulate from (istead of the X i ) We let Y = X 1+X deote a geeric Y i The problem of estimatio ca be re-cast as we are tryig to estimate µ = E(Y ) Computig variaces, V ar(y ) = (1/4)(σ + σ + Cov(X 1, X )) = (1/)(σ + Cov(X 1, X )) I the case whe the X i are iid, Cov(X 1, X ) = 0 ad thus V ar(y ) = σ / yieldig (as we already ow, recall ()) V ar(y (m)) = σ But if Cov(X 1, X ) < 0, the V ar(y ) < (1/)σ yieldig V ar(y (m)) < σ ; variace is reduced So it is i our iterest to somehow create some egative correlatio withi each pair (X 1, X ), (X 3, X 4 ),, but eep the pairs iid so that the Y i are iid (ad thus the CLT still applies); for the V ar(y (m)) will be lowered from what it would be if we simply used iid copies of the X i To motivate how we might create the desired egative correlatio, recall that we ca geerate a expoetially distributed rv X 1 = (1/λ) l (U) with U uiformly distributed o (0, 1) Now istead of usig a ew idepedet uiform to geerate a secod such copy, use 1 U which we well ow is also uiformly distributed o (0, 1); that is, defie X = (1/λ) l (1 U) Clearly X 1 ad X are egatively correlated sice if U icreases, the 1 U decreases ad the fuctio l(y) is a icreasig fuctio of y: X 1 icreases iff U icreases iff 1 U decreases iff X decreases More geerally, for ay distributio F (x) = P (X x) with iverse F 1 (y) we could geerate a egatively correlated pair via X 1 = F 1 (U), X = F 1 (1 U) sice F 1 (y) is a mootoe icreasig fuctio of y The radom variables U ad 1 U have a correlatio coefficiet ρ = 1, they are egatively correlated (to the largest extet), thus the mootoicity preserves the property of egative correlatio; ρ X1,X < 0 (ot ecessarily 1 though) I a geeral Mote Carlo simulatio our X is of the form X = h(u 1,, U ), for some (perhaps very complicated) fuctio h, ad some (perhaps large), that is, we eed iid U i to geerate each copy of X For example, if we are cosiderig X = C = ( 1 S i K) +, the payoff at time T = of a Asia call optio uder the biomial lattice model, the re-writig where the Y i are the iid up-dow rvs, we have h(u 1, U ) = 1 S i = (1/)S 0 Y 1 [1 + Y ], ( (1/)S 0 (ui{u 1 p} + di{u 1 > p})[1 + (ui{u p} + di{u > p})] K) + This fuctio is mootoe decreasig i U 1 ad U : as either variable icreases, they will exceed the value p ad hece the idicators will ted towards the lower value d as opposed to the higher value u > d Because the vectors (U 1, U ) ad (1 U 1, 1 U ) are idetically distributed, so are the rvs X 1 = h(u 1, U ) ad X = h(1 U 1, 1 U ); i particular they have the same mea E(X) But the mootoicity of h results i egative correlatio betwee them, Cov(X 1, X ) < 0 I geeral, as log as the fuctio h is mootoe (either icreasig or decreasig) i each variable, the it ca be show that X 1 = h(u 1,, U ) ad X = h(1 U 1,, 1 U ) are 3

4 ideed egatively correlated, ad are referred to as atithetic variates Agai, because the vectors (U 1, U, U ) ad (1 U 1, 1 U, 1 U ) have the same distributio, so do X 1 ad X ; i particular they have the same mea E(X) But because of the iduced egative correlatio (whe h is mootoe) the two are themselves egatively correlated copies: Propositio 11 If the fuctio h for geeratig X = h(u 1,, U ) is mootoe i each variable, the X 1 = h(u 1,, U ) ad X = h(1 U 1,, 1 U ) with the U i iid uiform o (0, 1) are i fact egatively correlated; Cov(X 1, X ) < 0 (Equivaletly E(X 1 X ) < E(X 1 )E(X ) = E (X)) Algorithm for usig atithetic variates to estimate µ = E(X), whe X = h(u 1,, U ) is mootoe i the U i : The method of simulatig our pairs is straightforward: 1 Geerate U 1, U Costruct a first pair: Set X 1 = h(u 1,, U ) ad X = h(1 U 1,, 1 U ) Now idepedetly geerate ew iid uiforms to costruct aother pair X 3, X 4 ad so o pair by pair util reachig m (large) desired pairs 3 Use the estimate where m Y (m) = Y j, Y 1 = X 1 + X Y = X 3 + X 4 Y m = X m 1 + X m To costruct our (ew ad better) cofidece iterval: Defie the sample variace as s (m) = 1 m 1 m (Y j Y m ) The the iterval Y (m) ± z α/ s(m) is a 100(1 α)% cofidece iterval for the mea µ As a very simple example recall that we ca estimate π by observig that π/4 = E( 1 U ) Sice h(y) = 1 y is mootoe decreasig i y, we ca use atithetic variates Thus we would use X 1 = 1 U1, X = 1 (1 U 1 ) for our first pair, X 3 = 1 U, X 4 = 1 (1 U ) ad so o 4

5 Remar 11 I a real simulatio applicatio, computig exactly Cov(X 1, X ) whe X 1 ad X are atithetic is ever possible i geeral; after all, we do ot eve ow (i geeral) either E(X) or V ar(x) But this is ot importat sice our objective was oly to reduce the variace, ad we accomplished that 14 Atithetic ormal rvs I may fiace applicatios, the fudametal rvs eeded to costruct a desired output copy X are uit ormals, Z 1, Z, For example, whe usig geometric Browia motio for asset pricig, our payoffs typically ca be writte i the form X = h(z 1,, Z ) Notig that Z is also a uit ormal if Z is, ad that the correlatio coefficiet betwee them is ρ = 1, the followig is the Gaussia aalogue to Propositio 11 Propositio 1 If the fuctio h for geeratig X = h(z 1,, Z ) is mootoe i each variable, the X 1 = h(z 1,, Z ) ad X = h( Z 1,, Z ) with the Z i iid N(0, 1) are i fact egatively correlated; Cov(X 1, X ) < 0 Example with a Asia call optio: Suppose for example you wish to estimate the expected payoff of a Asia call optio (termiatio date T ) averaged over the time poits 0 = t 0 < t 1 < t < < t = T The payoff is the X = C T = ( 1 S(t ) K) + We ext show how to costruct the atithetic pairs 1 Geerate iid N(0, 1) rvs, Z 1,, Z Set Recursively set L i = e σ t i t i 1 Z i +µ(t i t i 1 ), i {1,,, } (4) S(t 1 ) = S(0)L 1 S(t ) = S(t 1 )L = S 0 L 1 L S(t ) = S(t 1 )L = S 0 L 1 L L Set X 1 = ( 1 S(t ) K) + 3 Now reset the L i i (5) by usig Z 1,, Z i place of Z 1,, Z, that is, set L i = e σ t i t i 1 Z i +µ(t i t i 1 ), i {1,,, } (5) 5

6 4 Recursively set S(t 1 ) = S(0)L 1 S(t ) = S(t 1 )L = S 0 L 1 L S(t ) = S(t 1 )L = S 0 L 1 L L Set X = ( 1 S(t ) K) + 5 Set Y = X 1 + X Deotig the above copy by Y 1 = Y, we ca geerate a secod idepedet such copy by startig agai at (1) with a ew (idepedet) Z 1,, Z ad settigy = Y Repeatig this procedure m times yields our desired m iid copies of Y 15 Cotrol variates Suppose we wish to estimate µ = E(X) usig Mote Carlo simulatio (eg, usig X() with iid copies of X) Lettig C be ay other rv, with mea E(C), ad b a costat, ote that the rv Y give by Y = X b(c E(C)), (6) has the same desired mea: E(Y ) = E(X) Thus, if we could simulate iid copies of Y, Y 1, Y, the we could use as our estimate Y () istead of X() Notig further that σ Y = V ar(y ) = σ X + b σ C bσ X,C, (7) we see that by choosig C ad b wisely, it might be possible to reduce variace, that is, to have σy < σ X thus resultig i the lower variace estimator Y () tha the usual X() If X is oegative, the this would amout to choosig b > 0 ad selectig C ad X to have high positive correlatio, but i geeral may possibilities might come ito play Before we ivestigate this further, ote that it would be very helpful if C was already part of the simulatio of X i the sese that wheever we simulated a copy of X, a copy of C ecessarily came out for free alog the way Also we wat C to be such that we exactly ow the value E(C) The idea beig that we do ot wat to have to icrease our wor A example would be X = ([S(t 1 )+S(t )]/ K) + ad C = S(t ) for a Asia call optio This method of itroducig such a C for purpose of reducig variace is the cotrol variates method, ad C E(C) is called the cotrol variate for estimatig E(X) For a give C, we ca view (7) as a fuctio of b, g(b) = σy (b), ad the usig elemetary calculus, set g (b) = bσc σ x,c = 0 ad solve for the miimum b This yields: b = σ X,C σc, (8) σy (b ) = σx(1 ρ X,C), (9) 6

7 where ρ X,C = σ X,C /(σ X σ C ) deotes the correlatio coefficiet Thus by choosig ay C for which σ X,C 0 we ca always reduce variace, ad it is desirable to choose a C that is strogly correlated with X I practice we would ot be able to compute the value of b exactly sice it is uliely that we would ow σ X,C ad maybe ot eve σc But we could estimate it i advace by simulatio: Choose large ad use b b () = (X i X())(C i E(C)) (C i E(C)) (10) I other words we would first (just oce) ru a simulatio (large ) to obtai the estimate b (), ad the use that fixed value throughout our desired Mote Carlo simulatio Examples with GBM 1 Asia call optio: With 0 < t 1 < < t = T, the payoff at time T is X = ( 1 S(t i ) K) + A atural choice for C is the stoc itself at the termial value, C = S(T ) = S(t ) We certaily ca compute E(C) it is part of the simulatio ayhow ad is clearly positively correlated with X Aother choice would be the payoff of a Europea call C = (S(T ) K) +, sice i this case E(C) is ow exactly from the Blac-Scholes optios pricig formula A eve better choice (more correlatio) would be to use C = (Π S(t i) K) +, the payoff of a geometrically averaged Asia optio Here to, it turs out that the expected payoff E(C) is exactly ow (a formula exists), ad because it icorporates all values of the GBM, it yields a higher correlatio with X It should ot be surprisig that the choice of C might also deped o the strie price K For example, if K is very small compared to S(0), oe would, with high probability, obtai a positive payoff of 1 S(t i ) K, yieldig a high correlatio with (say) ay of the choices of C metioed above, whereas if K is very large compared to S(0) the oe would, with high probability, obtai o payoff at all, thus yieldig a low correlatio with a choice of C = S(T ) (but still a high oe with the geometrically averaged payoff above) There is o obvious best choice that wors with all payoffs; oe must tae ito cosideratio the specific structure of a payoff, ad its parameters I payoffs with multiple assets such as a spread optio, oe ca use a cotrol that uses all (or some) of the assets For example, for X = ( S 1 (T ) S (T ) K) + oe might try C = S 1 (T ) S (T ) 7

Output Analysis (2, Chapters 10 &11 Law)

Output Analysis (2, Chapters 10 &11 Law) B. Maddah ENMG 6 Simulatio 05/0/07 Output Aalysis (, Chapters 10 &11 Law) Comparig alterative system cofiguratio Sice the output of a simulatio is radom, the comparig differet systems via simulatio should

More information

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008 I ite Sequeces Dr. Philippe B. Laval Keesaw State Uiversity October 9, 2008 Abstract This had out is a itroductio to i ite sequeces. mai de itios ad presets some elemetary results. It gives the I ite Sequeces

More information

1 Notes on Little s Law (l = λw)

1 Notes on Little s Law (l = λw) Copyright c 29 by Karl Sigma Notes o Little s Law (l λw) We cosider here a famous ad very useful law i queueig theory called Little s Law, also kow as l λw, which asserts that the time average umber of

More information

Confidence Intervals for the Mean of Non-normal Data Class 23, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom

Confidence Intervals for the Mean of Non-normal Data Class 23, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom Cofidece Itervals for the Mea of No-ormal Data Class 23, 8.05, Sprig 204 Jeremy Orloff ad Joatha Bloom Learig Goals. Be able to derive the formula for coservative ormal cofidece itervals for the proportio

More information

Hypothesis testing. Null and alternative hypotheses

Hypothesis testing. Null and alternative hypotheses Hypothesis testig Aother importat use of samplig distributios is to test hypotheses about populatio parameters, e.g. mea, proportio, regressio coefficiets, etc. For example, it is possible to stipulate

More information

Properties of MLE: consistency, asymptotic normality. Fisher information.

Properties of MLE: consistency, asymptotic normality. Fisher information. Lecture 3 Properties of MLE: cosistecy, asymptotic ormality. Fisher iformatio. I this sectio we will try to uderstad why MLEs are good. Let us recall two facts from probability that we be used ofte throughout

More information

Simulation and Monte Carlo integration

Simulation and Monte Carlo integration Chapter 3 Simulatio ad Mote Carlo itegratio I this chapter we itroduce the cocept of geeratig observatios from a specified distributio or sample, which is ofte called Mote Carlo geeratio. The ame of Mote

More information

7. Sample Covariance and Correlation

7. Sample Covariance and Correlation 1 of 8 7/16/2009 6:06 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 7. Sample Covariace ad Correlatio The Bivariate Model Suppose agai that we have a basic radom experimet, ad that X ad Y

More information

1 Review of Probability

1 Review of Probability Copyright c 27 by Karl Sigma 1 Review of Probability Radom variables are deoted by X, Y, Z, etc. The cumulative distributio fuctio (c.d.f.) of a radom variable X is deoted by F (x) = P (X x), < x

More information

Using Excel to Construct Confidence Intervals

Using Excel to Construct Confidence Intervals OPIM 303 Statistics Ja Stallaert Usig Excel to Costruct Cofidece Itervals This hadout explais how to costruct cofidece itervals i Excel for the followig cases: 1. Cofidece Itervals for the mea of a populatio

More information

Overview of some probability distributions.

Overview of some probability distributions. Lecture Overview of some probability distributios. I this lecture we will review several commo distributios that will be used ofte throughtout the class. Each distributio is usually described by its probability

More information

8 The Poisson Distribution

8 The Poisson Distribution 8 The Poisso Distributio Let X biomial, p ). Recall that this meas that X has pmf ) p,p k) p k k p ) k for k 0,,...,. ) Agai, thik of X as the umber of successes i a series of idepedet experimets, each

More information

Estimating the Mean and Variance of a Normal Distribution

Estimating the Mean and Variance of a Normal Distribution Estimatig the Mea ad Variace of a Normal Distributio Learig Objectives After completig this module, the studet will be able to eplai the value of repeatig eperimets eplai the role of the law of large umbers

More information

= 1. n n 2 )= n n 2 σ2 = σ2

= 1. n n 2 )= n n 2 σ2 = σ2 SAMLE STATISTICS A rado saple of size fro a distributio f(x is a set of rado variables x 1,x,,x which are idepedetly ad idetically distributed with x i f(x for all i Thus, the joit pdf of the rado saple

More information

Confidence Intervals for One Mean with Tolerance Probability

Confidence Intervals for One Mean with Tolerance Probability Chapter 421 Cofidece Itervals for Oe Mea with Tolerace Probability Itroductio This procedure calculates the sample size ecessary to achieve a specified distace from the mea to the cofidece limit(s) with

More information

NPTEL STRUCTURAL RELIABILITY

NPTEL STRUCTURAL RELIABILITY NPTEL Course O STRUCTURAL RELIABILITY Module # 0 Lecture 1 Course Format: Web Istructor: Dr. Aruasis Chakraborty Departmet of Civil Egieerig Idia Istitute of Techology Guwahati 1. Lecture 01: Basic Statistics

More information

I. Chi-squared Distributions

I. Chi-squared Distributions 1 M 358K Supplemet to Chapter 23: CHI-SQUARED DISTRIBUTIONS, T-DISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad t-distributios, we first eed to look at aother family of distributios, the chi-squared distributios.

More information

ORDERS OF GROWTH KEITH CONRAD

ORDERS OF GROWTH KEITH CONRAD ORDERS OF GROWTH KEITH CONRAD Itroductio Gaiig a ituitive feel for the relative growth of fuctios is importat if you really wat to uderstad their behavior It also helps you better grasp topics i calculus

More information

Section 7-3 Estimating a Population. Requirements

Section 7-3 Estimating a Population. Requirements Sectio 7-3 Estimatig a Populatio Mea: σ Kow Key Cocept This sectio presets methods for usig sample data to fid a poit estimate ad cofidece iterval estimate of a populatio mea. A key requiremet i this sectio

More information

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method Chapter 6: Variace, the law of large umbers ad the Mote-Carlo method Expected value, variace, ad Chebyshev iequality. If X is a radom variable recall that the expected value of X, E[X] is the average value

More information

Chapter 7 - Sampling Distributions. 1 Introduction. What is statistics? It consist of three major areas:

Chapter 7 - Sampling Distributions. 1 Introduction. What is statistics? It consist of three major areas: Chapter 7 - Samplig Distributios 1 Itroductio What is statistics? It cosist of three major areas: Data Collectio: samplig plas ad experimetal desigs Descriptive Statistics: umerical ad graphical summaries

More information

0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5

0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5 Sectio 13 Kolmogorov-Smirov test. Suppose that we have a i.i.d. sample X 1,..., X with some ukow distributio P ad we would like to test the hypothesis that P is equal to a particular distributio P 0, i.e.

More information

A probabilistic proof of a binomial identity

A probabilistic proof of a binomial identity A probabilistic proof of a biomial idetity Joatho Peterso Abstract We give a elemetary probabilistic proof of a biomial idetity. The proof is obtaied by computig the probability of a certai evet i two

More information

3. Covariance and Correlation

3. Covariance and Correlation Virtual Laboratories > 3. Expected Value > 1 2 3 4 5 6 3. Covariace ad Correlatio Recall that by takig the expected value of various trasformatios of a radom variable, we ca measure may iterestig characteristics

More information

Joint Probability Distributions and Random Samples

Joint Probability Distributions and Random Samples STAT5 Sprig 204 Lecture Notes Chapter 5 February, 204 Joit Probability Distributios ad Radom Samples 5. Joitly Distributed Radom Variables Chapter Overview Joitly distributed rv Joit mass fuctio, margial

More information

Riemann Sums y = f (x)

Riemann Sums y = f (x) Riema Sums Recall that we have previously discussed the area problem I its simplest form we ca state it this way: The Area Problem Let f be a cotiuous, o-egative fuctio o the closed iterval [a, b] Fid

More information

University of California, Los Angeles Department of Statistics. Distributions related to the normal distribution

University of California, Los Angeles Department of Statistics. Distributions related to the normal distribution Uiversity of Califoria, Los Ageles Departmet of Statistics Statistics 100B Istructor: Nicolas Christou Three importat distributios: Distributios related to the ormal distributio Chi-square (χ ) distributio.

More information

B1. Fourier Analysis of Discrete Time Signals

B1. Fourier Analysis of Discrete Time Signals B. Fourier Aalysis of Discrete Time Sigals Objectives Itroduce discrete time periodic sigals Defie the Discrete Fourier Series (DFS) expasio of periodic sigals Defie the Discrete Fourier Trasform (DFT)

More information

4.1 Sigma Notation and Riemann Sums

4.1 Sigma Notation and Riemann Sums 0 the itegral. Sigma Notatio ad Riema Sums Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each simple shape, ad the add these smaller areas

More information

CHAPTER 7: Central Limit Theorem: CLT for Averages (Means)

CHAPTER 7: Central Limit Theorem: CLT for Averages (Means) CHAPTER 7: Cetral Limit Theorem: CLT for Averages (Meas) X = the umber obtaied whe rollig oe six sided die oce. If we roll a six sided die oce, the mea of the probability distributio is X P(X = x) Simulatio:

More information

Gregory Carey, 1998 Linear Transformations & Composites - 1. Linear Transformations and Linear Composites

Gregory Carey, 1998 Linear Transformations & Composites - 1. Linear Transformations and Linear Composites Gregory Carey, 1998 Liear Trasformatios & Composites - 1 Liear Trasformatios ad Liear Composites I Liear Trasformatios of Variables Meas ad Stadard Deviatios of Liear Trasformatios A liear trasformatio

More information

Chapter 7 Methods of Finding Estimators

Chapter 7 Methods of Finding Estimators Chapter 7 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 011 Chapter 7 Methods of Fidig Estimators Sectio 7.1 Itroductio Defiitio 7.1.1 A poit estimator is ay fuctio W( X) W( X1, X,, X ) of

More information

Economics 140A Confidence Intervals and Hypothesis Testing

Economics 140A Confidence Intervals and Hypothesis Testing Ecoomics 140A Cofidece Itervals ad Hypothesis Testig Obtaiig a estimate of a parameter is ot the al purpose of statistical iferece because it is highly ulikely that the populatio value of a parameter is

More information

Confidence Intervals. CI for a population mean (σ is known and n > 30 or the variable is normally distributed in the.

Confidence Intervals. CI for a population mean (σ is known and n > 30 or the variable is normally distributed in the. Cofidece Itervals A cofidece iterval is a iterval whose purpose is to estimate a parameter (a umber that could, i theory, be calculated from the populatio, if measuremets were available for the whole populatio).

More information

Binet Formulas for Recursive Integer Sequences

Binet Formulas for Recursive Integer Sequences Biet Formulas for Recursive Iteger Sequeces Homer W. Austi Jatha W. Austi Abstract May iteger sequeces are recursive sequeces ad ca be defied either recursively or explicitly by use of Biet-type formulas.

More information

Derivation of the Poisson distribution

Derivation of the Poisson distribution Gle Cowa RHUL Physics 1 December, 29 Derivatio of the Poisso distributio I this ote we derive the fuctioal form of the Poisso distributio ad ivestigate some of its properties. Cosider a time t i which

More information

Divide and Conquer. Maximum/minimum. Integer Multiplication. CS125 Lecture 4 Fall 2015

Divide and Conquer. Maximum/minimum. Integer Multiplication. CS125 Lecture 4 Fall 2015 CS125 Lecture 4 Fall 2015 Divide ad Coquer We have see oe geeral paradigm for fidig algorithms: the greedy approach. We ow cosider aother geeral paradigm, kow as divide ad coquer. We have already see a

More information

The Euler Totient, the Möbius and the Divisor Functions

The Euler Totient, the Möbius and the Divisor Functions The Euler Totiet, the Möbius ad the Divisor Fuctios Rosica Dieva July 29, 2005 Mout Holyoke College South Hadley, MA 01075 1 Ackowledgemets This work was supported by the Mout Holyoke College fellowship

More information

Definition. Definition. 7-2 Estimating a Population Proportion. Definition. Definition

Definition. Definition. 7-2 Estimating a Population Proportion. Definition. Definition 7- stimatig a Populatio Proportio I this sectio we preset methods for usig a sample proportio to estimate the value of a populatio proportio. The sample proportio is the best poit estimate of the populatio

More information

Hypothesis Tests Applied to Means

Hypothesis Tests Applied to Means The Samplig Distributio of the Mea Hypothesis Tests Applied to Meas Recall that the samplig distributio of the mea is the distributio of sample meas that would be obtaied from a particular populatio (with

More information

Key Ideas Section 8-1: Overview hypothesis testing Hypothesis Hypothesis Test Section 8-2: Basics of Hypothesis Testing Null Hypothesis

Key Ideas Section 8-1: Overview hypothesis testing Hypothesis Hypothesis Test Section 8-2: Basics of Hypothesis Testing Null Hypothesis Chapter 8 Key Ideas Hypothesis (Null ad Alterative), Hypothesis Test, Test Statistic, P-value Type I Error, Type II Error, Sigificace Level, Power Sectio 8-1: Overview Cofidece Itervals (Chapter 7) are

More information

1 The Binomial Theorem: Another Approach

1 The Binomial Theorem: Another Approach The Biomial Theorem: Aother Approach Pascal s Triagle I class (ad i our text we saw that, for iteger, the biomial theorem ca be stated (a + b = c a + c a b + c a b + + c ab + c b, where the coefficiets

More information

if A S, then X \ A S, and if (A n ) n is a sequence of sets in S, then n A n S,

if A S, then X \ A S, and if (A n ) n is a sequence of sets in S, then n A n S, Lecture 5: Borel Sets Topologically, the Borel sets i a topological space are the σ-algebra geerated by the ope sets. Oe ca build up the Borel sets from the ope sets by iteratig the operatios of complemetatio

More information

Divide and Conquer, Solving Recurrences, Integer Multiplication Scribe: Juliana Cook (2015), V. Williams Date: April 6, 2016

Divide and Conquer, Solving Recurrences, Integer Multiplication Scribe: Juliana Cook (2015), V. Williams Date: April 6, 2016 CS 6, Lecture 3 Divide ad Coquer, Solvig Recurreces, Iteger Multiplicatio Scribe: Juliaa Cook (05, V Williams Date: April 6, 06 Itroductio Today we will cotiue to talk about divide ad coquer, ad go ito

More information

1 Computing the Standard Deviation of Sample Means

1 Computing the Standard Deviation of Sample Means Computig the Stadard Deviatio of Sample Meas Quality cotrol charts are based o sample meas ot o idividual values withi a sample. A sample is a group of items, which are cosidered all together for our aalysis.

More information

when n = 1, 2, 3, 4, 5, 6, This list represents the amount of dollars you have after n days. Note: The use of is read as and so on.

when n = 1, 2, 3, 4, 5, 6, This list represents the amount of dollars you have after n days. Note: The use of is read as and so on. Geometric eries Before we defie what is meat by a series, we eed to itroduce a related topic, that of sequeces. Formally, a sequece is a fuctio that computes a ordered list. uppose that o day 1, you have

More information

Confidence Intervals for One Mean

Confidence Intervals for One Mean Chapter 420 Cofidece Itervals for Oe Mea Itroductio This routie calculates the sample size ecessary to achieve a specified distace from the mea to the cofidece limit(s) at a stated cofidece level for a

More information

ON SMALL SAMPLE PROPERTIES OF PERMUTATION TESTS: A SIGNIFICANCE TEST FOR REGRESSION MODELS*

ON SMALL SAMPLE PROPERTIES OF PERMUTATION TESTS: A SIGNIFICANCE TEST FOR REGRESSION MODELS* Kobe Uiversity Ecoomic Review 52 (2006) 27 ON SMALL SAMPLE PROPERTIES OF PERMUTATION TESTS: A SIGNIFICANCE TEST FOR REGRESSION MODELS* By HISASHI TANIZAKI I this paper, we cosider a oparametric permutatio

More information

3. Continuous Random Variables

3. Continuous Random Variables Statistics ad probability: 3-1 3. Cotiuous Radom Variables A cotiuous radom variable is a radom variable which ca take values measured o a cotiuous scale e.g. weights, stregths, times or legths. For ay

More information

Normal Distribution.

Normal Distribution. Normal Distributio www.icrf.l Normal distributio I probability theory, the ormal or Gaussia distributio, is a cotiuous probability distributio that is ofte used as a first approimatio to describe realvalued

More information

Lecture 7: Borel Sets and Lebesgue Measure

Lecture 7: Borel Sets and Lebesgue Measure EE50: Probability Foudatios for Electrical Egieers July-November 205 Lecture 7: Borel Sets ad Lebesgue Measure Lecturer: Dr. Krisha Jagaatha Scribes: Ravi Kolla, Aseem Sharma, Vishakh Hegde I this lecture,

More information

1. C. The formula for the confidence interval for a population mean is: x t, which was

1. C. The formula for the confidence interval for a population mean is: x t, which was s 1. C. The formula for the cofidece iterval for a populatio mea is: x t, which was based o the sample Mea. So, x is guarateed to be i the iterval you form.. D. Use the rule : p-value

More information

Sequences and Series

Sequences and Series CHAPTER 9 Sequeces ad Series 9.. Covergece: Defiitio ad Examples Sequeces The purpose of this chapter is to itroduce a particular way of geeratig algorithms for fidig the values of fuctios defied by their

More information

Lesson 12. Sequences and Series

Lesson 12. Sequences and Series Retur to List of Lessos Lesso. Sequeces ad Series A ifiite sequece { a, a, a,... a,...} ca be thought of as a list of umbers writte i defiite order ad certai patter. It is usually deoted by { a } =, or

More information

TAYLOR SERIES, POWER SERIES

TAYLOR SERIES, POWER SERIES TAYLOR SERIES, POWER SERIES The followig represets a (icomplete) collectio of thigs that we covered o the subject of Taylor series ad power series. Warig. Be prepared to prove ay of these thigs durig the

More information

MIDTERM EXAM - MATH 563, SPRING 2016

MIDTERM EXAM - MATH 563, SPRING 2016 MIDTERM EXAM - MATH 563, SPRING 2016 NAME: SOLUTION Exam rules: There are 5 problems o this exam. You must show all work to receive credit, state ay theorems ad defiitios clearly. The istructor will NOT

More information

A Recursive Formula for Moments of a Binomial Distribution

A Recursive Formula for Moments of a Binomial Distribution A Recursive Formula for Momets of a Biomial Distributio Árpád Béyi beyi@mathumassedu, Uiversity of Massachusetts, Amherst, MA 01003 ad Saverio M Maago smmaago@psavymil Naval Postgraduate School, Moterey,

More information

{{1}, {2, 4}, {3}} {{1, 3, 4}, {2}} {{1}, {2}, {3, 4}} 5.4 Stirling Numbers

{{1}, {2, 4}, {3}} {{1, 3, 4}, {2}} {{1}, {2}, {3, 4}} 5.4 Stirling Numbers . Stirlig Numbers Whe coutig various types of fuctios from., we quicly discovered that eumeratig the umber of oto fuctios was a difficult problem. For a domai of five elemets ad a rage of four elemets,

More information

Sequences II. Chapter 3. 3.1 Convergent Sequences

Sequences II. Chapter 3. 3.1 Convergent Sequences Chapter 3 Sequeces II 3. Coverget Sequeces Plot a graph of the sequece a ) = 2, 3 2, 4 3, 5 + 4,...,,... To what limit do you thik this sequece teds? What ca you say about the sequece a )? For ǫ = 0.,

More information

Determining the sample size

Determining the sample size Determiig the sample size Oe of the most commo questios ay statisticia gets asked is How large a sample size do I eed? Researchers are ofte surprised to fid out that the aswer depeds o a umber of factors

More information

1 Hypothesis testing for a single mean

1 Hypothesis testing for a single mean BST 140.65 Hypothesis Testig Review otes 1 Hypothesis testig for a sigle mea 1. The ull, or status quo, hypothesis is labeled H 0, the alterative H a or H 1 or H.... A type I error occurs whe we falsely

More information

Section 11.3: The Integral Test

Section 11.3: The Integral Test Sectio.3: The Itegral Test Most of the series we have looked at have either diverged or have coverged ad we have bee able to fid what they coverge to. I geeral however, the problem is much more difficult

More information

THE HEIGHT OF q-binary SEARCH TREES

THE HEIGHT OF q-binary SEARCH TREES THE HEIGHT OF q-binary SEARCH TREES MICHAEL DRMOTA AND HELMUT PRODINGER Abstract. q biary search trees are obtaied from words, equipped with the geometric distributio istead of permutatios. The average

More information

Math C067 Sampling Distributions

Math C067 Sampling Distributions Math C067 Samplig Distributios Sample Mea ad Sample Proportio Richard Beigel Some time betwee April 16, 2007 ad April 16, 2007 Examples of Samplig A pollster may try to estimate the proportio of voters

More information

Z-TEST / Z-STATISTIC: used to test hypotheses about. µ when the population standard deviation is unknown

Z-TEST / Z-STATISTIC: used to test hypotheses about. µ when the population standard deviation is unknown Z-TEST / Z-STATISTIC: used to test hypotheses about µ whe the populatio stadard deviatio is kow ad populatio distributio is ormal or sample size is large T-TEST / T-STATISTIC: used to test hypotheses about

More information

Standard Errors and Confidence Intervals

Standard Errors and Confidence Intervals Stadard Errors ad Cofidece Itervals Itroductio I the documet Data Descriptio, Populatios ad the Normal Distributio a sample had bee obtaied from the populatio of heights of 5-year-old boys. If we assume

More information

8.5 Alternating infinite series

8.5 Alternating infinite series 65 8.5 Alteratig ifiite series I the previous two sectios we cosidered oly series with positive terms. I this sectio we cosider series with both positive ad egative terms which alterate: positive, egative,

More information

9.8: THE POWER OF A TEST

9.8: THE POWER OF A TEST 9.8: The Power of a Test CD9-1 9.8: THE POWER OF A TEST I the iitial discussio of statistical hypothesis testig, the two types of risks that are take whe decisios are made about populatio parameters based

More information

Asymptotic Growth of Functions

Asymptotic Growth of Functions CMPS Itroductio to Aalysis of Algorithms Fall 3 Asymptotic Growth of Fuctios We itroduce several types of asymptotic otatio which are used to compare the performace ad efficiecy of algorithms As we ll

More information

The second difference is the sequence of differences of the first difference sequence, 2

The second difference is the sequence of differences of the first difference sequence, 2 Differece Equatios I differetial equatios, you look for a fuctio that satisfies ad equatio ivolvig derivatives. I differece equatios, istead of a fuctio of a cotiuous variable (such as time), we look for

More information

SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx

SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx SAMPLE QUESTIONS FOR FINAL EXAM REAL ANALYSIS I FALL 006 3 4 Fid the followig usig the defiitio of the Riema itegral: a 0 x + dx 3 Cosider the partitio P x 0 3, x 3 +, x 3 +,......, x 3 3 + 3 of the iterval

More information

A Gentle Introduction to Algorithms: Part II

A Gentle Introduction to Algorithms: Part II A Getle Itroductio to Algorithms: Part II Cotets of Part I:. Merge: (to merge two sorted lists ito a sigle sorted list.) 2. Bubble Sort 3. Merge Sort: 4. The Big-O, Big-Θ, Big-Ω otatios: asymptotic bouds

More information

THE ABRACADABRA PROBLEM

THE ABRACADABRA PROBLEM THE ABRACADABRA PROBLEM FRANCESCO CARAVENNA Abstract. We preset a detailed solutio of Exercise E0.6 i [Wil9]: i a radom sequece of letters, draw idepedetly ad uiformly from the Eglish alphabet, the expected

More information

Maximum Likelihood Estimators.

Maximum Likelihood Estimators. Lecture 2 Maximum Likelihood Estimators. Matlab example. As a motivatio, let us look at oe Matlab example. Let us geerate a radom sample of size 00 from beta distributio Beta(5, 2). We will lear the defiitio

More information

Methods of Evaluating Estimators

Methods of Evaluating Estimators Math 541: Statistical Theory II Istructor: Sogfeg Zheg Methods of Evaluatig Estimators Let X 1, X 2,, X be i.i.d. radom variables, i.e., a radom sample from f(x θ), where θ is ukow. A estimator of θ is

More information

Institute for the Advancement of University Learning & Department of Statistics

Institute for the Advancement of University Learning & Department of Statistics Istitute for the Advacemet of Uiversity Learig & Departmet of Statistics Descriptive Statistics for Research (Hilary Term, 00) Lecture 5: Cofidece Itervals (I.) Itroductio Cofidece itervals (or regios)

More information

Module 4: Mathematical Induction

Module 4: Mathematical Induction Module 4: Mathematical Iductio Theme 1: Priciple of Mathematical Iductio Mathematical iductio is used to prove statemets about atural umbers. As studets may remember, we ca write such a statemet as a predicate

More information

Statistical Confidence Levels for Estimating Error Probability

Statistical Confidence Levels for Estimating Error Probability HFTA-5. Rev 2; 11/7 Statistical Cofidece Levels for Estimatig Error Probability ote: This article has bee previously published i Lightwave Magazie (April 2), ad i the Maxim Egieerig Joural (volume 37).

More information

The frequency relationship can also be written in term of logarithms

The frequency relationship can also be written in term of logarithms Pitch ad Frequecy by Mark Frech Departmet of Mechaical Egieerig Techology Purdue Uiversity rmfrech@purdue.edu There are two differet kids of scales importat to a guitar player, eve tempered ad diatoic.

More information

Department of Computer Science, University of Otago

Department of Computer Science, University of Otago Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS-2006-09 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly

More information

Approximating Area under a curve with rectangles. To find the area under a curve we approximate the area using rectangles and then use limits to find

Approximating Area under a curve with rectangles. To find the area under a curve we approximate the area using rectangles and then use limits to find 1.8 Approximatig Area uder a curve with rectagles 1.6 To fid the area uder a curve we approximate the area usig rectagles ad the use limits to fid 1.4 the area. Example 1 Suppose we wat to estimate 1.

More information

Linear Algebra II. Notes 6 25th November 2010

Linear Algebra II. Notes 6 25th November 2010 MTH6140 Liear Algebra II Notes 6 25th November 2010 6 Quadratic forms A lot of applicatios of mathematics ivolve dealig with quadratic forms: you meet them i statistics (aalysis of variace) ad mechaics

More information

Convexity, Inequalities, and Norms

Convexity, Inequalities, and Norms Covexity, Iequalities, ad Norms Covex Fuctios You are probably familiar with the otio of cocavity of fuctios. Give a twicedifferetiable fuctio ϕ: R R, We say that ϕ is covex (or cocave up) if ϕ (x) 0 for

More information

The Field of Complex Numbers

The Field of Complex Numbers The Field of Complex Numbers S. F. Ellermeyer The costructio of the system of complex umbers begis by appedig to the system of real umbers a umber which we call i with the property that i = 1. (Note that

More information

Statistics Lecture 14. Introduction to Inference. Administrative Notes. Hypothesis Tests. Last Class: Confidence Intervals

Statistics Lecture 14. Introduction to Inference. Administrative Notes. Hypothesis Tests. Last Class: Confidence Intervals Statistics 111 - Lecture 14 Itroductio to Iferece Hypothesis Tests Admiistrative Notes Sprig Break! No lectures o Tuesday, March 8 th ad Thursday March 10 th Exteded Sprig Break! There is o Stat 111 recitatio

More information

Chapter 14 Nonparametric Statistics

Chapter 14 Nonparametric Statistics Chapter 14 Noparametric Statistics A.K.A. distributio-free statistics! Does ot deped o the populatio fittig ay particular type of distributio (e.g, ormal). Sice these methods make fewer assumptios, they

More information

x(x 1)(x 2)... (x k + 1) = [x] k n+m 1

x(x 1)(x 2)... (x k + 1) = [x] k n+m 1 1 Coutig mappigs For every real x ad positive iteger k, let [x] k deote the fallig factorial ad x(x 1)(x 2)... (x k + 1) ( ) x = [x] k k k!, ( ) k = 1. 0 I the sequel, X = {x 1,..., x m }, Y = {y 1,...,

More information

MATH 140A - HW 5 SOLUTIONS

MATH 140A - HW 5 SOLUTIONS MATH 40A - HW 5 SOLUTIONS Problem WR Ch 3 #8. If a coverges, ad if {b } is mootoic ad bouded, rove that a b coverges. Solutio. Theorem 3.4 states that if a the artial sums of a form a bouded sequece; b

More information

Incremental calculation of weighted mean and variance

Incremental calculation of weighted mean and variance Icremetal calculatio of weighted mea ad variace Toy Fich faf@cam.ac.uk dot@dotat.at Uiversity of Cambridge Computig Service February 009 Abstract I these otes I eplai how to derive formulae for umerically

More information

The Stable Marriage Problem

The Stable Marriage Problem The Stable Marriage Problem William Hut Lae Departmet of Computer Sciece ad Electrical Egieerig, West Virgiia Uiversity, Morgatow, WV William.Hut@mail.wvu.edu 1 Itroductio Imagie you are a matchmaker,

More information

5: Introduction to Estimation

5: Introduction to Estimation 5: Itroductio to Estimatio Cotets Acroyms ad symbols... 1 Statistical iferece... Estimatig µ with cofidece... 3 Samplig distributio of the mea... 3 Cofidece Iterval for μ whe σ is kow before had... 4 Sample

More information

Confidence Intervals and Sample Size

Confidence Intervals and Sample Size 8/7/015 C H A P T E R S E V E N Cofidece Itervals ad Copyright 015 The McGraw-Hill Compaies, Ic. Permissio required for reproductio or display. 1 Cofidece Itervals ad Outlie 7-1 Cofidece Itervals for the

More information

An example of non-quenched convergence in the conditional central limit theorem for partial sums of a linear process

An example of non-quenched convergence in the conditional central limit theorem for partial sums of a linear process A example of o-queched covergece i the coditioal cetral limit theorem for partial sums of a liear process Dalibor Volý ad Michael Woodroofe Abstract A causal liear processes X,X 0,X is costructed for which

More information

Section IV.5: Recurrence Relations from Algorithms

Section IV.5: Recurrence Relations from Algorithms Sectio IV.5: Recurrece Relatios from Algorithms Give a recursive algorithm with iput size, we wish to fid a Θ (best big O) estimate for its ru time T() either by obtaiig a explicit formula for T() or by

More information

1 Correlation and Regression Analysis

1 Correlation and Regression Analysis 1 Correlatio ad Regressio Aalysis I this sectio we will be ivestigatig the relatioship betwee two cotiuous variable, such as height ad weight, the cocetratio of a ijected drug ad heart rate, or the cosumptio

More information

The Field Q of Rational Numbers

The Field Q of Rational Numbers Chapter 3 The Field Q of Ratioal Numbers I this chapter we are goig to costruct the ratioal umber from the itegers. Historically, the positive ratioal umbers came first: the Babyloias, Egyptias ad Grees

More information

Confidence Intervals

Confidence Intervals Cofidece Itervals Cofidece Itervals are a extesio of the cocept of Margi of Error which we met earlier i this course. Remember we saw: The sample proportio will differ from the populatio proportio by more

More information

Notes on Expected Revenue from Auctions

Notes on Expected Revenue from Auctions Notes o Expected Reveue from Auctios Ecoomics 1C, Professor Bergstrom These otes spell out some of the mathematical details aout first ad secod price sealed id auctios that were discussed i Thursday s

More information

MATH 361 Homework 9. Royden Royden Royden

MATH 361 Homework 9. Royden Royden Royden MATH 61 Homework 9 Royde..9 First, we show that for ay subset E of the real umbers, E c + y = E + y) c traslatig the complemet is equivalet to the complemet of the traslated set). Without loss of geerality,

More information

Chapter 10. Hypothesis Tests Regarding a Parameter. 10.1 The Language of Hypothesis Testing

Chapter 10. Hypothesis Tests Regarding a Parameter. 10.1 The Language of Hypothesis Testing Chapter 10 Hypothesis Tests Regardig a Parameter A secod type of statistical iferece is hypothesis testig. Here, rather tha use either a poit (or iterval) estimate from a simple radom sample to approximate

More information