Chapter 6: Variance, the law of large numbers and the MonteCarlo method


 Gregory Smith
 3 years ago
 Views:
Transcription
1 Chapter 6: Variace, the law of large umbers ad the MoteCarlo 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 of X Expected value of X : E[X] = α α P (X = α) The expected value measures oly the average of X ad two radom variables with the same mea ca have very differet behavior. For example the radom variable X with P (X = +1) = 1/2, P (X = 1) = 1/2 ad the radom variable Y with have the same mea [P (X = +100) = 1/2, P (X = 100) = 1/2 E[X] = E[Y ] = 0 To measure the spread of a radom variable X, that is how likely it is to have value of X very far away from the mea we itroduce the variace of X, deoted by var(x). Let us cosider the distace to the expected value i.e., X E[X]. It is more coveiet to look at the square of this distace (X E[X]) 2 to get rid of the absolute value ad the variace is the give by Variace of X : var(x) = E [ (X E[X]) 2] We summarize some elemetary properties of expected value ad variace i the followig Theorem 1. We have 1. For ay two radom variables X ad Y, E[X + Y ] = E[X] + E[Y ]. 2. For ay real umber a, E[aX] = ae[x]. 3. For ay real umber c, E[X + c] = E[X] + c. 1
2 4. For ay real umber a, var(ax) = a 2 var(x). 5. For ay real umber c, var(x + c) = var(x). Proof. 1. should be obvious, the sum of averages is the average of the sum. For 2. oe otes that if X takes the value α with some probability the the radom variable ax takes the value aα with the same probability. 3 is a special case of 1 if we realize that E[a] = a. For 4. we use 2 ad we have var(x) = E [ (ax E[aX]) 2] = E [ a 2 (X E[X]) 2] = a 2 E [ (X E[X]) 2] = a 2 var(x). Fially for 5. ot that X + a E[X + a] = X E[x] ad so the variace does ot chage. Usig this rule we ca derive aother formula for the variace. var(x) = E [ (X E[X]) 2] = E[X 2 2XE[X] + E[X] 2 = E[X 2 ] + E[ 2XE[X]] + E[E[X] 2 ] = E[X 2 ] 2E[X] 2 + E[X] 2 = E[X 2 ] E[X] 2 So we obtai Variace of X : var(x) = E [ (X E[X]) 2] = E[X 2 ] E[X] 2 Example: The 0 1 radom variable. Suppose A is a evet the radom variable X A is give by { 1 if A occurs X A = 0 otherwise ad let us write The we have p = P (A) E[X A ] = 0 P (X A = 0) + 1 P (X A = 1) = 0 (1 p) + 1 p = p. 2
3 To compute the variace ote that X A E[X A ] = { 1 p if A occurs p otherwise ad so var(x) = ( p) 2 P (X A = 0) + (1 p) 2 P (X A = 1) = p 2 (1 p) + (1 p) 2 p = p(1 p) I summary we have The 0 1 radom variable P (X = 1) = p, P (X = 0) = (1 p) E[X] = p, var(x) = p(1 p) Chebyshev iequality: The Chebyshev iequality is a simple iequality which allows you to extract iformatio about the values that X ca take if you kow oly the mea ad the variace of X. Theorem 2. We have 1. Markov iequality. If X 0, i.e. X takes oly oegative values, the for ay a > 0 we have P (X a) E[X] α 2. Chebyshev iequality. For ay radom variable X ad ay ɛ > 0 we have P ( X E[X] ɛ) var(x) ɛ 2 Proof. Let us prove first Markov iequality. Pick a positive umber a. Sice X takes oly oegative values all terms i the sum givig the expectatios are oegative we have E[X] = α αp (X = α) α a αp (X = α) a α a P (X = α) = ap (X a) 3
4 ad thus P (X a) E[X]. a To prove Chebyshev we will use Markov iequality ad apply it to the radom variable Y = (X E[X]) 2 which is oegative ad with expected value We have the E[Y ] = E [ (X E[X]) 2] = var(x). P ( X E[X] ɛ) = P ((X E[X]) 2 ɛ 2 ) = P (Y ɛ 2 ) E[Y ] ɛ 2 = var(x) ɛ 2 (1) Idepedece ad sum of radom variables: Two radom variables are idepedet idepedet if the kowledge of Y does ot ifluece the results of X ad vice versa. This ca be expressed i terms of coditioal probabilities: the (coditioal) probability that Y takes a certai value, say β, does ot chage if we kow that X takes a value, say α. I other words Y is idepedet of X if P (Y = β X = α) = P (Y = β) for all α, β But usig the defiitio of coditioal probability we fid that or P (Y = β X = α) = P (Y = β X = α) P (X = α) = P (Y = β) P (Y = β X = α) = P (X = α)p (Y = β). This formula is symmetric i X ad Y ad so if Y is idepedet of X the X is also idepedet of Y ad we just say that X ad Y are idepedet. 4
5 X ad Y are idepedet if P (Y = β X = α) = P (X = α)p (Y = β) for all α, β Theorem 3. Suppose X ad Y are idepedet radom variable. The we have 1. E[XY ] = E[X]E[Y ]. 2. var(x + Y ) = var(x) + var(y ). Proof. : If X ad Y are idepedet we have E[XY ] = α,β = α,β αβp (X = αy = β) αβp (X = α)p (Y = β) = α αp (X = α) β βp (Y = β) = E[X]E[Y ] To compute the variace of X + Y it is best to ote that by Theorem 1, part 5, the variace is uchaged if we traslate the the radom variable. So we have for example var(x) = var(x E[X]) ad similarly for Y ad X + Y. So without loss of geerality we may assume that E[X] = E[Y ] = E[X + Y ] = 0. The var(x) = E[X 2 ], etc... var(x + Y ) = E [ (X + Y ) 2] = E [ X 2 + 2XY + Y 2] = E [ X 2] + E [ Y 2] + 2E [XY ] = E [ X 2] + E [ Y 2] + 2E [X] E [Y ] (X, Y idepedet) = E [ X 2] + E [ Y 2] (sice E[X] = E[Y ] = 0) = var(x) + var(y ) The Law of Large umbers Suppose we perform a experimet ad a measuremet ecoded i the radom variable X ad that we repeat this experimet times each time i the same coditios ad each time idepedetly of each other. We thus obtai idepedet copies of the radom variable X which we deote X 1, X 2,, X 5
6 Such a collectio of radom variable is called a IID sequece of radom variables where IID stads for idepedet ad idetically distributed. This meas that the radom variables X i have the same probability distributio. I particular they have all the same meas ad variace E[X i ] = µ, var(x i ) = σ 2, i = 1, 2,, Each time we perform the experimet tiimes, the X i provides a (radom) measuremet ad if the average value X X is called the empirical average. The Law of Large Numbers states for large the empirical average is very close to the expected value µ with very high probability Theorem 4. Let X 1,, X IID radom variables with E[X i ] = µ ad var(x i ) for all i. The we have ( ) X 1 + X P µ ɛ σ2 ɛ 2 I particular the right had side goes to 0 has. Proof. The proof of the law of large umbers is a simple applicatio from Chebyshev iequality to the radom variable X 1+ X. Ideed by the properties of expectatios we have [ ] X1 + X E = 1 E [X 1 + X ] = 1 (E [X 1] + E [X ]) = 1 µ = µ For the variace we use that the X i are idepedet ad so we have ( ) X1 + X var = 1 var (X X ]) = 1 (var(x 1) + + var(x 2 )) = σ2 By Chebyshev iequality we obtai the ( X 1 + X P ) µ ɛ σ2 ɛ 2 Coi flip Suppose we flip a fair coi 100 times. How likely it is to obtai betwee 40% ad 60% heads? We cosider the radom variable X which is 1 if the coi lads o head 6
7 ad 0 otherwise. We have µ = E[X] = 1/2 ad σ 2 = var(x) = 1/4 ad by Chebyshev P (betwee 40 ad 60 heads) = P (40 X 1 + X ) ( 4 = P 10 X 1 + X ) ( X 1 + X 100 = P ) 10 ( X 1 + X 100 = 1 P ) 10 1/4 1 =.75 (2) 100(1/10) 2 If we ow flip a fair coi ow 1000 obtaithe probability to obtai betwee 40% ad 60% heads ca be estimated by ( X 1 + X 1000 P (betwee 400 ad 600 heads) = P ) 10 ( X 1 + X 100 = 1 P ) 10 1/4 1 =.975 (3) 1000(1/10) 2 Variace as a measure of risk: I may problems the variace ca be iterpreted as measurig how risky a ivestmet is. As a example let us put ourselves i the casio shoes ad try to figure out what is more risky for a casio? A player bettig o red/black at roulette or a player bettig o umbers? Suppose X is the expected wi o red or black. The we have E[X] = ad 38 E[X2 ] = = 1 so Var(X) = = Suppose Y is the expected wi o a umber. The E[X] = = 2, ad E[X 2 ] = (35) = so Var(X) = It is obvious that that the riskier bet is to bet o umbers. To estimate the risk take by the casio, let us estimate usig Chebyshev iequality that the casio actually loses moey o bets of say $1. This is P {X X > 0} 7
8 Usig Chebyshev we have P {X X > 0} = P {X X µ > µ} P { X X µ > µ } σ 2 µ 2 (4) So for bets o red/black the estimates o the probability that the casio is aroud 33 times smaller for for a bet umbers. But of course, i ay case the probability that the casio lose at all is tiy ad i additio Chebyshev grossly overestimates these umbers. Probabilistic algorithms ad the MoteCarlo method: Uder the ame Mote Carlo methods, oe uderstads a algorithm which uses radomess ad the LLN to compute a certai quatity which might have othig to do with radomess. Such algorithm are becomig ubiquitous i may applicatios i statistics, computer sciece, physics ad egieerig. We will illustrate the ideas here with some very simple test examples. We start with a probabilistic algorithm which do ot use the LLN at all but use probability i a surprisig maer to make a decisio. Guessig the largest of two umber: Suppose you pick two distict itegers A < B, let us say betwee 1 ad 100. You ca do this i ay way you wish. You write the the 2 umbers o two pieces of papers ad put them face dow. I the pick oe of the two pieces of paper ad look at the umber o it. I should the decide whether this umber is the largest of the 2 or ot. We will describe a algorithm which always retur the largest of 2 with probability greater tha 1/2, o matter how you picked the umber. To describe the algorithm we let O be the observed umber by me. The I pick a radom umber N betwee 1 ad 100, for example uiformly, that is P (N = ) = with = 1, 2, 100. I could pick N accordig to aother distributio ad it would still works. The my aswer is simply If O > N the I guess that O is the largest umber. if O N the I switch ad guess that the other uobserved umber is the largest. To see how this works we distiguish three cases 1. If N < A < B the N < 0 ad thus pickig O as the largest give me a probability 1/2 to pick the largest. 2. If N B > A, the I decide to switch ad agai I pick the largest with probability 1/2. 8
9 3. If A N < B it gets iterestig, sice if O = A, the N A ad so I switch ad pick B which is the largest. O the other had if O = B, the N < O ad so i guess that O = B is the largest ad wi. So I always wi. Usig coditioal probabilities, we fid that P (Wi) = P (Wi N < A)P (N < A) + P (Wi A N < B)P (A N < B) +P (Wi B N)P (B N) = 1 2 P (N < A) + P (A N < B) P (B N) > 1 2 (5) For example is N is uiformly distributed, we have P (Wi) = 1 A B A B = B A Radom umbers: A computer comes equipped with a radom umber geerator, (usually the commad rad, which produces a umber which is uiformly distributed i [0, 1]. We call such a umber U ad such a umber is characterized by the fact that P (U [a, b]) = b a for ay iterval [a, b] [0, 1]. Every MoteCarlo method should be i priciple costructed with radom umber so as to be easily implemetable. For example we ca geerate a 0 1 radom variable X with P (X = 1) = p ad P (X = 0) = 1 p by usig a radom umber. We simply set { 1 if U p X = 0 if U > p The we have P (X = 1) = P (U [0, p]) = p. A algorithm to compute the umber π: To compute the umber π we draw a square with side legth 1 ad iscribe i it a circle of radius 1/2. The area of the square of 1 while the area of the circle is π/4. To compute π we geerate a radom poit i the square. If the poit geerated is iside the circle we accept it, while if it is outside we reject it. The we repeat the same experimet may times ad expect by the LLN to have a proportio of accepted poits equal to π/4 More precisely the algorithm ow goes as follows 9
10 Geerate two radom umbers U 1 ad V 1, this is the same as geeratig a radom poit i the square [0, 1] [0, 1]. If U V the set X 1 = 1 while if U 2 + V 2 > 1 set X 1 = 0. Repeat to the two previous steps to geerate X 2, X 3,, X. We have P (X 1 = 1) = P (U V 2 1 1) = ad P (X = 0) = 1 π/4. We have the area of circle area of the square = π/4 1 E[X] = µ = π/4 var(x) = σ 2 = π/4(1 π/4) So usig the LLN ad Chebyshev we have ( X 1 + X P π ) 4 ɛ π/4(1 π/4) ɛ 2 I order to get quatitative iformatio suppose we wat to compute π with a accuracy of ±1/1000, that is we take ɛ = 1/000. This is the same as computig π/4 with a accuracy of 1/4000. O the right had side we have the variace π/4(1 π/4) which is a umber we do t kow. But we ote that the fuctio p(1 p) o [0, 1] has its maximum at p = 1/2 ad the maximum is 1/4 so we ca obtai ( X 1 + X P π ) 4 4/100 4, 000, 000 That we eed to compute ru the algorithm 80 millios times to make this probability 5/100. The Motecarlo method to compute the itegral b f(x) dx. We cosider a fuctio f o the iterval [a, b] ad we wish to a compute I = b a f(x) dx. for some bouded fuctio f. Without loss of geerality we ca assume that f 0, otherwise we replace f by f + c for some costat c. Next we ca also assume that f 1 otherwise we replace f by cf for a sufficietly small c. Fially we may assume that a = 0 10
11 ad b = 1 otherwise we make the chage of variable y = (x a)/(b a). For example suppose we wat to compute the itegral 1 0 e si(x3 ) 3(1 + 5x 8 ) dx This caot be doe by had ad so we eed a umerical method. A stadard method would be to use a Riema sum, i.e. we divide the iterval [0, 1] i subiterval ad set x i = i the we ca approximate the itegral by f(x)dx 1 f(x i ) that is we approximate the area uder the graph of f by the sum of areas of rectagles of base legth 1/ ad height f(i/). We use istead a MoteCarlo method. We ote that i=1 I = Area uder the graph of f ad we costruct a 0 1 radom variable X so that E[X] = I. computig π. More precisely the algorithm ow goes as follows We proceed as for Geerate two radom umbers U 1 ad V 1, this is the same as geeratig a radom poit i the square [0, 1] [0, 1]. If V 1 f(u 1 ) the set X 1 = 1 while if V 1 > f(u 1 ) set X 1 = 0. Repeat to the two previous steps to geerate X 2, X 3,, X. We have P (X = 1) = P (V f(u)) = Area uder the graph of f Area of [0, 1] [0, 1] = I = 1 0 f(x) dx ad so E[X] = I ad var(x) = I(1 I). 11
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 informationApproximating 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 informationUniversity 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 Chisquare (χ ) distributio.
More informationOverview 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 informationUC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 9 Spring 2006
Exam format UC Bereley Departmet of Electrical Egieerig ad Computer Sciece EE 6: Probablity ad Radom Processes Solutios 9 Sprig 006 The secod midterm will be held o Wedesday May 7; CHECK the fial exam
More informationA 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 informationCase Study. Normal and t Distributions. Density Plot. Normal Distributions
Case Study Normal ad t Distributios Bret Halo ad Bret Larget Departmet of Statistics Uiversity of Wiscosi Madiso October 11 13, 2011 Case Study Body temperature varies withi idividuals over time (it ca
More informationI. Chisquared Distributions
1 M 358K Supplemet to Chapter 23: CHISQUARED DISTRIBUTIONS, TDISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad tdistributios, we first eed to look at aother family of distributios, the chisquared distributios.
More informationHypothesis 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 informationChapter 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 informationIn 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 informationAsymptotic 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 informationMaximum 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 information0.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 KolmogorovSmirov 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 informationWeek 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable
Week 3 Coditioal probabilities, Bayes formula, WEEK 3 page 1 Expected value of a radom variable We recall our discussio of 5 card poker hads. Example 13 : a) What is the probability of evet A that a 5
More informationSAMPLE 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 informationOutput 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 informationSection 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 informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13
EECS 70 Discrete Mathematics ad Probability Theory Sprig 2014 Aat Sahai Note 13 Itroductio At this poit, we have see eough examples that it is worth just takig stock of our model of probability ad may
More information1 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 informationMath 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 informationInfinite Sequences and Series
CHAPTER 4 Ifiite Sequeces ad Series 4.1. Sequeces A sequece is a ifiite ordered list of umbers, for example the sequece of odd positive itegers: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29...
More informationTHE 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 informationA PROBABILISTIC VIEW ON THE ECONOMICS OF GAMBLING
A PROBABILISTIC VIEW ON THE ECONOMICS OF GAMBLING MATTHEW ACTIPES Abstract. This paper begis by defiig a probability space ad establishig probability fuctios i this space over discrete radom variables.
More information5: 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 information1. 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 : pvalue
More informationSoving Recurrence Relations
Sovig Recurrece Relatios Part 1. Homogeeous liear 2d degree relatios with costat coefficiets. Cosider the recurrece relatio ( ) T () + at ( 1) + bt ( 2) = 0 This is called a homogeeous liear 2d degree
More informationChapter 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 information15.075 Exam 3. Instructor: Cynthia Rudin TA: Dimitrios Bisias. November 22, 2011
15.075 Exam 3 Istructor: Cythia Rudi TA: Dimitrios Bisias November 22, 2011 Gradig is based o demostratio of coceptual uderstadig, so you eed to show all of your work. Problem 1 A compay makes highdefiitio
More informationPROCEEDINGS OF THE YEREVAN STATE UNIVERSITY AN ALTERNATIVE MODEL FOR BONUSMALUS SYSTEM
PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical ad Mathematical Scieces 2015, 1, p. 15 19 M a t h e m a t i c s AN ALTERNATIVE MODEL FOR BONUSMALUS SYSTEM A. G. GULYAN Chair of Actuarial Mathematics
More informationThe 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 information4.3. The Integral and Comparison Tests
4.3. THE INTEGRAL AND COMPARISON TESTS 9 4.3. The Itegral ad Compariso Tests 4.3.. The Itegral Test. Suppose f is a cotiuous, positive, decreasig fuctio o [, ), ad let a = f(). The the covergece or divergece
More informationMeasures of Spread and Boxplots Discrete Math, Section 9.4
Measures of Spread ad Boxplots Discrete Math, Sectio 9.4 We start with a example: Example 1: Comparig Mea ad Media Compute the mea ad media of each data set: S 1 = {4, 6, 8, 10, 1, 14, 16} S = {4, 7, 9,
More informationOur aim is to show that under reasonable assumptions a given 2πperiodic function f can be represented as convergent series
8 Fourier Series Our aim is to show that uder reasoable assumptios a give periodic fuctio f ca be represeted as coverget series f(x) = a + (a cos x + b si x). (8.) By defiitio, the covergece of the series
More informationGCSE STATISTICS. 4) How to calculate the range: The difference between the biggest number and the smallest number.
GCSE STATISTICS You should kow: 1) How to draw a frequecy diagram: e.g. NUMBER TALLY FREQUENCY 1 3 5 ) How to draw a bar chart, a pictogram, ad a pie chart. 3) How to use averages: a) Mea  add up all
More informationNormal 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 informationMath 113 HW #11 Solutions
Math 3 HW # Solutios 5. 4. (a) Estimate the area uder the graph of f(x) = x from x = to x = 4 usig four approximatig rectagles ad right edpoits. Sketch the graph ad the rectagles. Is your estimate a uderestimate
More informationLesson 17 Pearson s Correlation Coefficient
Outlie Measures of Relatioships Pearso s Correlatio Coefficiet (r) types of data scatter plots measure of directio measure of stregth Computatio covariatio of X ad Y uique variatio i X ad Y measurig
More informationMARTINGALES AND A BASIC APPLICATION
MARTINGALES AND A BASIC APPLICATION TURNER SMITH Abstract. This paper will develop the measuretheoretic approach to probability i order to preset the defiitio of martigales. From there we will apply this
More informationConvexity, 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 informationZTEST / ZSTATISTIC: used to test hypotheses about. µ when the population standard deviation is unknown
ZTEST / ZSTATISTIC: used to test hypotheses about µ whe the populatio stadard deviatio is kow ad populatio distributio is ormal or sample size is large TTEST / TSTATISTIC: used to test hypotheses about
More informationChapter 5: Inner Product Spaces
Chapter 5: Ier Product Spaces Chapter 5: Ier Product Spaces SECION A Itroductio to Ier Product Spaces By the ed of this sectio you will be able to uderstad what is meat by a ier product space give examples
More informationSampling Distribution And Central Limit Theorem
() Samplig Distributio & Cetral Limit Samplig Distributio Ad Cetral Limit Samplig distributio of the sample mea If we sample a umber of samples (say k samples where k is very large umber) each of size,
More informationUniversal coding for classes of sources
Coexios module: m46228 Uiversal codig for classes of sources Dever Greee This work is produced by The Coexios Project ad licesed uder the Creative Commos Attributio Licese We have discussed several parametric
More informationIncremental 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 information1. MATHEMATICAL INDUCTION
1. MATHEMATICAL INDUCTION EXAMPLE 1: Prove that for ay iteger 1. Proof: 1 + 2 + 3 +... + ( + 1 2 (1.1 STEP 1: For 1 (1.1 is true, sice 1 1(1 + 1. 2 STEP 2: Suppose (1.1 is true for some k 1, that is 1
More informationIrreducible polynomials with consecutive zero coefficients
Irreducible polyomials with cosecutive zero coefficiets Theodoulos Garefalakis Departmet of Mathematics, Uiversity of Crete, 71409 Heraklio, Greece Abstract Let q be a prime power. We cosider the problem
More informationConfidence 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 informationCHAPTER 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 information3. Greatest Common Divisor  Least Common Multiple
3 Greatest Commo Divisor  Least Commo Multiple Defiitio 31: The greatest commo divisor of two atural umbers a ad b is the largest atural umber c which divides both a ad b We deote the greatest commo gcd
More informationCenter, Spread, and Shape in Inference: Claims, Caveats, and Insights
Ceter, Spread, ad Shape i Iferece: Claims, Caveats, ad Isights Dr. Nacy Pfeig (Uiversity of Pittsburgh) AMATYC November 2008 Prelimiary Activities 1. I would like to produce a iterval estimate for the
More informationConfidence 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 information5 Boolean Decision Trees (February 11)
5 Boolea Decisio Trees (February 11) 5.1 Graph Coectivity Suppose we are give a udirected graph G, represeted as a boolea adjacecy matrix = (a ij ), where a ij = 1 if ad oly if vertices i ad j are coected
More informationFactoring x n 1: cyclotomic and Aurifeuillian polynomials Paul Garrett <garrett@math.umn.edu>
(March 16, 004) Factorig x 1: cyclotomic ad Aurifeuillia polyomials Paul Garrett Polyomials of the form x 1, x 3 1, x 4 1 have at least oe systematic factorizatio x 1 = (x 1)(x 1
More information3 Basic Definitions of Probability Theory
3 Basic Defiitios of Probability Theory 3defprob.tex: Feb 10, 2003 Classical probability Frequecy probability axiomatic probability Historical developemet: Classical Frequecy Axiomatic The Axiomatic defiitio
More informationLecture 4: Cauchy sequences, BolzanoWeierstrass, and the Squeeze theorem
Lecture 4: Cauchy sequeces, BolzaoWeierstrass, ad the Squeeze theorem The purpose of this lecture is more modest tha the previous oes. It is to state certai coditios uder which we are guarateed that limits
More informationThe following example will help us understand The Sampling Distribution of the Mean. C1 C2 C3 C4 C5 50 miles 84 miles 38 miles 120 miles 48 miles
The followig eample will help us uderstad The Samplig Distributio of the Mea Review: The populatio is the etire collectio of all idividuals or objects of iterest The sample is the portio of the populatio
More informationLecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)
18.409 A Algorithmist s Toolkit October 27, 2009 Lecture 13 Lecturer: Joatha Keler Scribe: Joatha Pies (2009) 1 Outlie Last time, we proved the BruMikowski iequality for boxes. Today we ll go over the
More informationDepartment of Computer Science, University of Otago
Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS200609 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly
More informationDescriptive Statistics
Descriptive Statistics We leared to describe data sets graphically. We ca also describe a data set umerically. Measures of Locatio Defiitio The sample mea is the arithmetic average of values. We deote
More informationChapter 14 Nonparametric Statistics
Chapter 14 Noparametric Statistics A.K.A. distributiofree statistics! Does ot deped o the populatio fittig ay particular type of distributio (e.g, ormal). Sice these methods make fewer assumptios, they
More information1 The Gaussian channel
ECE 77 Lecture 0 The Gaussia chael Objective: I this lecture we will lear about commuicatio over a chael of practical iterest, i which the trasmitted sigal is subjected to additive white Gaussia oise.
More informationModified Line Search Method for Global Optimization
Modified Lie Search Method for Global Optimizatio Cria Grosa ad Ajith Abraham Ceter of Excellece for Quatifiable Quality of Service Norwegia Uiversity of Sciece ad Techology Trodheim, Norway {cria, ajith}@q2s.tu.o
More informationDetermining 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 informationDefinition. A variable X that takes on values X 1, X 2, X 3,...X k with respective frequencies f 1, f 2, f 3,...f k has mean
1 Social Studies 201 October 13, 2004 Note: The examples i these otes may be differet tha used i class. However, the examples are similar ad the methods used are idetical to what was preseted i class.
More informationLesson 15 ANOVA (analysis of variance)
Outlie Variability betwee group variability withi group variability total variability Fratio Computatio sums of squares (betwee/withi/total degrees of freedom (betwee/withi/total mea square (betwee/withi
More informationSolutions to Selected Problems In: Pattern Classification by Duda, Hart, Stork
Solutios to Selected Problems I: Patter Classificatio by Duda, Hart, Stork Joh L. Weatherwax February 4, 008 Problem Solutios Chapter Bayesia Decisio Theory Problem radomized rules Part a: Let Rx be the
More informationLecture 4: Cheeger s Inequality
Spectral Graph Theory ad Applicatios WS 0/0 Lecture 4: Cheeger s Iequality Lecturer: Thomas Sauerwald & He Su Statemet of Cheeger s Iequality I this lecture we assume for simplicity that G is a dregular
More informationSECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES
SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,
More informationSimple Annuities Present Value.
Simple Auities Preset Value. OBJECTIVES (i) To uderstad the uderlyig priciple of a preset value auity. (ii) To use a CASIO CFX9850GB PLUS to efficietly compute values associated with preset value auities.
More informationTrading the randomness  Designing an optimal trading strategy under a drifted random walk price model
Tradig the radomess  Desigig a optimal tradig strategy uder a drifted radom walk price model Yuao Wu Math 20 Project Paper Professor Zachary Hamaker Abstract: I this paper the author iteds to explore
More informationSequences 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 informationCS103X: Discrete Structures Homework 4 Solutions
CS103X: Discrete Structures Homewor 4 Solutios Due February 22, 2008 Exercise 1 10 poits. Silico Valley questios: a How may possible sixfigure salaries i whole dollar amouts are there that cotai at least
More informationChair for Network Architectures and Services Institute of Informatics TU München Prof. Carle. Network Security. Chapter 2 Basics
Chair for Network Architectures ad Services Istitute of Iformatics TU Müche Prof. Carle Network Security Chapter 2 Basics 2.4 Radom Number Geeratio for Cryptographic Protocols Motivatio It is crucial to
More informationChapter 7: Confidence Interval and Sample Size
Chapter 7: Cofidece Iterval ad Sample Size Learig Objectives Upo successful completio of Chapter 7, you will be able to: Fid the cofidece iterval for the mea, proportio, ad variace. Determie the miimum
More informationTaking DCOP to the Real World: Efficient Complete Solutions for Distributed MultiEvent Scheduling
Taig DCOP to the Real World: Efficiet Complete Solutios for Distributed MultiEvet Schedulig Rajiv T. Maheswara, Milid Tambe, Emma Bowrig, Joatha P. Pearce, ad Pradeep araatham Uiversity of Souther Califoria
More informationTHE HEIGHT OF qbinary SEARCH TREES
THE HEIGHT OF qbinary 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 informationRepeating Decimals are decimal numbers that have number(s) after the decimal point that repeat in a pattern.
5.5 Fractios ad Decimals Steps for Chagig a Fractio to a Decimal. Simplify the fractio, if possible. 2. Divide the umerator by the deomiator. d d Repeatig Decimals Repeatig Decimals are decimal umbers
More informationOverview. Learning Objectives. Point Estimate. Estimation. Estimating the Value of a Parameter Using Confidence Intervals
Overview Estimatig the Value of a Parameter Usig Cofidece Itervals We apply the results about the sample mea the problem of estimatio Estimatio is the process of usig sample data estimate the value of
More informationStatistical inference: example 1. Inferential Statistics
Statistical iferece: example 1 Iferetial Statistics POPULATION SAMPLE A clothig store chai regularly buys from a supplier large quatities of a certai piece of clothig. Each item ca be classified either
More informationAP Calculus BC 2003 Scoring Guidelines Form B
AP Calculus BC Scorig Guidelies Form B The materials icluded i these files are iteded for use by AP teachers for course ad exam preparatio; permissio for ay other use must be sought from the Advaced Placemet
More informationNOTES ON PROBABILITY Greg Lawler Last Updated: March 21, 2016
NOTES ON PROBBILITY Greg Lawler Last Updated: March 21, 2016 Overview This is a itroductio to the mathematical foudatios of probability theory. It is iteded as a supplemet or followup to a graduate course
More informationClass Meeting # 16: The Fourier Transform on R n
MATH 18.152 COUSE NOTES  CLASS MEETING # 16 18.152 Itroductio to PDEs, Fall 2011 Professor: Jared Speck Class Meetig # 16: The Fourier Trasform o 1. Itroductio to the Fourier Trasform Earlier i the course,
More informationFIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. 1. Powers of a matrix
FIBONACCI NUMBERS: AN APPLICATION OF LINEAR ALGEBRA. Powers of a matrix We begi with a propositio which illustrates the usefuless of the diagoalizatio. Recall that a square matrix A is diogaalizable if
More informationParameter estimation for nonlinear models: Numerical approaches to solving the inverse problem. Lecture 11 04/01/2008. Sven Zenker
Parameter estimatio for oliear models: Numerical approaches to solvig the iverse problem Lecture 11 04/01/2008 Sve Zeker Review: Trasformatio of radom variables Cosider probability distributio of a radom
More informationAn Efficient Polynomial Approximation of the Normal Distribution Function & Its Inverse Function
A Efficiet Polyomial Approximatio of the Normal Distributio Fuctio & Its Iverse Fuctio Wisto A. Richards, 1 Robi Atoie, * 1 Asho Sahai, ad 3 M. Raghuadh Acharya 1 Departmet of Mathematics & Computer Sciece;
More informationBASIC STATISTICS. f(x 1,x 2,..., x n )=f(x 1 )f(x 2 ) f(x n )= f(x i ) (1)
BASIC STATISTICS. SAMPLES, RANDOM SAMPLING AND SAMPLE STATISTICS.. Radom Sample. The radom variables X,X 2,..., X are called a radom sample of size from the populatio f(x if X,X 2,..., X are mutually idepedet
More informationEngineering 323 Beautiful Homework Set 3 1 of 7 Kuszmar Problem 2.51
Egieerig 33 eautiful Homewor et 3 of 7 Kuszmar roblem.5.5 large departmet store sells sport shirts i three sizes small, medium, ad large, three patters plaid, prit, ad stripe, ad two sleeve legths log
More informationCHAPTER 3 THE TIME VALUE OF MONEY
CHAPTER 3 THE TIME VALUE OF MONEY OVERVIEW A dollar i the had today is worth more tha a dollar to be received i the future because, if you had it ow, you could ivest that dollar ad ear iterest. Of all
More informationBuilding Blocks Problem Related to Harmonic Series
TMME, vol3, o, p.76 Buildig Blocks Problem Related to Harmoic Series Yutaka Nishiyama Osaka Uiversity of Ecoomics, Japa Abstract: I this discussio I give a eplaatio of the divergece ad covergece of ifiite
More informationA Mathematical Perspective on Gambling
A Mathematical Perspective o Gamblig Molly Maxwell Abstract. This paper presets some basic topics i probability ad statistics, icludig sample spaces, probabilistic evets, expectatios, the biomial ad ormal
More informationBetting on Football Pools
Bettig o Football Pools by Edward A. Beder I a pool, oe tries to guess the wiers i a set of games. For example, oe may have te matches this weeked ad oe bets o who the wiers will be. We ve put wiers i
More informationVladimir N. Burkov, Dmitri A. Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT
Keywords: project maagemet, resource allocatio, etwork plaig Vladimir N Burkov, Dmitri A Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT The paper deals with the problems of resource allocatio betwee
More informationTrigonometric Form of a Complex Number. The Complex Plane. axis. ( 2, 1) or 2 i FIGURE 6.44. The absolute value of the complex number z a bi is
0_0605.qxd /5/05 0:45 AM Page 470 470 Chapter 6 Additioal Topics i Trigoometry 6.5 Trigoometric Form of a Complex Number What you should lear Plot complex umbers i the complex plae ad fid absolute values
More informationAP Calculus AB 2006 Scoring Guidelines Form B
AP Calculus AB 6 Scorig Guidelies Form B The College Board: Coectig Studets to College Success The College Board is a otforprofit membership associatio whose missio is to coect studets to college success
More informationPractice Problems for Test 3
Practice Problems for Test 3 Note: these problems oly cover CIs ad hypothesis testig You are also resposible for kowig the samplig distributio of the sample meas, ad the Cetral Limit Theorem Review all
More informationSection 8.3 : De Moivre s Theorem and Applications
The Sectio 8 : De Moivre s Theorem ad Applicatios Let z 1 ad z be complex umbers, where z 1 = r 1, z = r, arg(z 1 ) = θ 1, arg(z ) = θ z 1 = r 1 (cos θ 1 + i si θ 1 ) z = r (cos θ + i si θ ) ad z 1 z =
More informationLecture 5: Span, linear independence, bases, and dimension
Lecture 5: Spa, liear idepedece, bases, ad dimesio Travis Schedler Thurs, Sep 23, 2010 (versio: 9/21 9:55 PM) 1 Motivatio Motivatio To uderstad what it meas that R has dimesio oe, R 2 dimesio 2, etc.;
More informationLecture 3. denote the orthogonal complement of S k. Then. 1 x S k. n. 2 x T Ax = ( ) λ x. with x = 1, we have. i = λ k x 2 = λ k.
18.409 A Algorithmist s Toolkit September 17, 009 Lecture 3 Lecturer: Joatha Keler Scribe: Adre Wibisoo 1 Outlie Today s lecture covers three mai parts: CouratFischer formula ad Rayleigh quotiets The
More informationWHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER?
WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER? JÖRG JAHNEL 1. My Motivatio Some Sort of a Itroductio Last term I tought Topological Groups at the Göttige Georg August Uiversity. This
More information