Lecture 3 Gaussian Probability Distribution

Similar documents
CS667 Lecture 6: Monte Carlo Integration 02/10/05

Continuous Random Variables

Chapter 5 : Continuous Random Variables

Normal Distribution. Lecture 6: More Binomial Distribution. Properties of the Unit Normal Distribution. Unit Normal Distribution

1 Probability Density Functions

Lecture 21: Order statistics

Expectation and Variance

7 - Continuous random variables

8 Laplace s Method and Local Limit Theorems

Problem. Statement. variable Y. Method: Step 1: Step 2: y d dy. Find F ( Step 3: Find f = Y. Solution: Assume

Tests for the Ratio of Two Poisson Rates

Unit #9 : Definite Integral Properties; Fundamental Theorem of Calculus

38.2. The Uniform Distribution. Introduction. Prerequisites. Learning Outcomes

Goals: Determine how to calculate the area described by a function. Define the definite integral. Explore the relationship between the definite

Properties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives

CS 109 Lecture 11 April 20th, 2016

Review of Calculus, cont d

X Z Y Table 1: Possibles values for Y = XZ. 1, p

Method: Step 1: Step 2: Find f. Step 3: = Y dy. Solution: 0, ( ) 0, y. Assume

Numerical integration

For the percentage of full time students at RCC the symbols would be:

Math 1B, lecture 4: Error bounds for numerical methods

Chapter 6 Continuous Random Variables and Distributions

Section 11.5 Estimation of difference of two proportions

The steps of the hypothesis test

Math 135, Spring 2012: HW 7

Exam 2, Mathematics 4701, Section ETY6 6:05 pm 7:40 pm, March 31, 2016, IH-1105 Instructor: Attila Máté 1

Theoretical foundations of Gaussian quadrature

Problem Set 9. Figure 1: Diagram. This picture is a rough sketch of the 4 parabolas that give us the area that we need to find. The equations are:

W. We shall do so one by one, starting with I 1, and we shall do it greedily, trying

Section 5.1 #7, 10, 16, 21, 25; Section 5.2 #8, 9, 15, 20, 27, 30; Section 5.3 #4, 6, 9, 13, 16, 28, 31; Section 5.4 #7, 18, 21, 23, 25, 29, 40

Numerical Integration

Acceptance Sampling by Attributes

CMDA 4604: Intermediate Topics in Mathematical Modeling Lecture 19: Interpolation and Quadrature

Monte Carlo method in solving numerical integration and differential equation

Riemann is the Mann! (But Lebesgue may besgue to differ.)

Math Calculus with Analytic Geometry II

Review of Probability Distributions. CS1538: Introduction to Simulations

4.1. Probability Density Functions

MATH 115 FINAL EXAM. April 25, 2005

5 Probability densities

How do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?

Solution for Assignment 1 : Intro to Probability and Statistics, PAC learning

Numerical Integration

ECO 317 Economics of Uncertainty Fall Term 2007 Notes for lectures 4. Stochastic Dominance

Lecture 17. Integration: Gauss Quadrature. David Semeraro. University of Illinois at Urbana-Champaign. March 20, 2014

Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17

Continuous Random Variables Class 5, Jeremy Orloff and Jonathan Bloom

SUMMER KNOWHOW STUDY AND LEARNING CENTRE

Lecture 1: Introduction to integration theory and bounded variation

Lecture 1. Functional series. Pointwise and uniform convergence.

ARITHMETIC OPERATIONS. The real numbers have the following properties: a b c ab ac

Chapter 9: Inferences based on Two samples: Confidence intervals and tests of hypotheses

A REVIEW OF CALCULUS CONCEPTS FOR JDEP 384H. Thomas Shores Department of Mathematics University of Nebraska Spring 2007

5 Accumulated Change: The Definite Integral

Lecture 20: Numerical Integration III

n f(x i ) x. i=1 In section 4.2, we defined the definite integral of f from x = a to x = b as n f(x i ) x; f(x) dx = lim i=1

Lecture 6: Singular Integrals, Open Quadrature rules, and Gauss Quadrature

Math 113 Fall Final Exam Review. 2. Applications of Integration Chapter 6 including sections and section 6.8

f(a+h) f(a) x a h 0. This is the rate at which

Chapter 0. What is the Lebesgue integral about?

Review of Riemann Integral

The Fundamental Theorem of Calculus. The Total Change Theorem and the Area Under a Curve.

Tutorial 4. b a. h(f) = a b a ln 1. b a dx = ln(b a) nats = log(b a) bits. = ln λ + 1 nats. = log e λ bits. = ln 1 2 ln λ + 1. nats. = ln 2e. bits.

c n φ n (x), 0 < x < L, (1) n=1

Lecture 14: Quadrature

We partition C into n small arcs by forming a partition of [a, b] by picking s i as follows: a = s 0 < s 1 < < s n = b.

Fundamental Theorem of Calculus

P 3 (x) = f(0) + f (0)x + f (0) 2. x 2 + f (0) . In the problem set, you are asked to show, in general, the n th order term is a n = f (n) (0)

Riemann Sums and Riemann Integrals

3.4 Numerical integration

Discrete Mathematics and Probability Theory Summer 2014 James Cook Note 17

Chapter 6 Notes, Larson/Hostetler 3e

THE EXISTENCE-UNIQUENESS THEOREM FOR FIRST-ORDER DIFFERENTIAL EQUATIONS.

Riemann Sums and Riemann Integrals

AP Calculus Multiple Choice: BC Edition Solutions

Name Solutions to Test 3 November 8, 2017

Operations with Polynomials

SOLUTIONS FOR ADMISSIONS TEST IN MATHEMATICS, COMPUTER SCIENCE AND JOINT SCHOOLS WEDNESDAY 5 NOVEMBER 2014

12 TRANSFORMING BIVARIATE DENSITY FUNCTIONS

The First Fundamental Theorem of Calculus. If f(x) is continuous on [a, b] and F (x) is any antiderivative. f(x) dx = F (b) F (a).

Numerical Analysis. 10th ed. R L Burden, J D Faires, and A M Burden

The final exam will take place on Friday May 11th from 8am 11am in Evans room 60.

CBSE-XII-2015 EXAMINATION. Section A. 1. Find the sum of the order and the degree of the following differential equation : = 0

Math 360: A primitive integral and elementary functions

Discrete Random Variables Class 4, Jeremy Orloff and Jonathan Bloom

Math 116 Calculus II

2008 Mathematical Methods (CAS) GA 3: Examination 2

Improper Integrals. Type I Improper Integrals How do we evaluate an integral such as

Infinite Geometric Series

Non-Linear & Logistic Regression

5.1 How do we Measure Distance Traveled given Velocity? Student Notes

Continuous probability distributions

Continuous Random Variables

Riemann Integrals and the Fundamental Theorem of Calculus

11.1 Exponential Functions

DISCRETE MATHEMATICS HOMEWORK 3 SOLUTIONS

Pi evaluation. Monte Carlo integration

Administrivia CSE 190: Reinforcement Learning: An Introduction

APPROXIMATE INTEGRATION

Transcription:

Introduction Lecture 3 Gussin Probbility Distribution Gussin probbility distribution is perhps the most used distribution in ll of science. lso clled bell shped curve or norml distribution Unlike the binomil nd Poisson distribution, the Gussin is continuous distribution: (y$µ) P(y) " # e$ " µ men of distribution (lso t the sme plce s mode nd medin) σ vrince of distribution y is continuous vrible (- y ) Probbility (P) of y being in the rnge [, b] is given by n integrl: P( < y ) " # e$ b (y$µ) " Krl Friedrich Guss 777-855 The integrl for rbitrry nd b cnnot be evluted nlyticlly The vlue of the integrl hs to be looked up in tble (e.g. Appendixes A nd B of Tylor). P(x) p(x) (x #µ ) #! " e! gussin Plot of Gussin pdf x K.K. Gn L3: Gussin Probbility Distribution

The totl re under the curve is normlized to one. the probbility integrl: P("# < y < #) $ We often tlk bout mesurement being certin number of stndrd devitions (σ) wy from the men (µ) of the Gussin. We cn ssocite probbility for mesurement to be µ - nσ from the men just by clculting the re outside of this region. nσ 0.67 0.5 0.3 0.05 3 0.003 4 0.00006 Prob. of exceeding ±nσ e "(y"µ) $ # "# It is very unlikely (< 0.3) tht mesurement tken t rndom from Gussin pdf will be more thn ± 3σ from the true men of the distribution. 95 of re within σ Only 5 of re outside σ Reltionship between Gussin nd Binomil distribution The Gussin distribution cn be derived from the binomil (or Poisson) ssuming: p is finite N is very lrge we hve continuous vrible rther thn discrete vrible K.K. Gn L3: Gussin Probbility Distribution

An exmple illustrting the smll difference between the two distributions under the bove conditions: Consider tossing coin 0,000 time. p(heds) 0.5 N 0,000 For binomil distribution: men number of heds µ Np 00 stndrd devition σ [Np( - p)] / The probbility to be within ±σ for this binomil distribution is: 00+ 0 4! P # (0 4 0.5 m 0.5 04 "m 0.69 m00" " m)!m! For Gussin distribution: µ+# P(µ "# < y < µ +# ) e "(y"µ) # 0.68 # $ µ"# Both distributions give bout the sme probbility! Centrl Limit Theorem Gussin distribution is very pplicble becuse of the Centrl Limit Theorem A crude sttement of the Centrl Limit Theorem: Things tht re the result of the ddition of lots of smll effects tend to become Gussin. A more exct sttement: Let Y, Y,...Y n be n infinite sequence of independent rndom vribles ech with the sme probbility distribution. Suppose tht the men (µ) nd vrince (σ ) of this distribution re both finite. Actully, the Y s cn be from different pdf s! K.K. Gn L3: Gussin Probbility Distribution 3

For ny numbers nd b: lim P < Y +Y +...Y n $ nµ ) n"# '( n * + ḇ, e$ y C.L.T. tells us tht under wide rnge of circumstnces the probbility distribution tht describes the sum of rndom vribles tends towrds Gussin distribution s the number of terms in the sum. Alterntively: lim P < Y $ µ n"# / n ) ' ( * + lim P < Y $ µ ) ( + ḇ n"# ' m *, e$ y σ m is sometimes clled the error in the men (more on tht lter). For CLT to be vlid: µ nd σ of pdf must be finite. No one term in sum should dominte the sum. A rndom vrible is not the sme s rndom number. Devore: Probbility nd Sttistics for Engineering nd the Sciences: A rndom vrible is ny rule tht ssocites number with ech outcome in S S is the set of possible outcomes. Recll if y is described by Gussin pdf with µ 0 nd σ then the probbility tht < y is given by: b " y P( < y )! e # The CLT is true even if the Y s re from different pdf s s long s the mens nd vrinces re defined for ech pdf! See Appendix of Brlow for proof of the Centrl Limit Theorem. K.K. Gn L3: Gussin Probbility Distribution 4

Exmple: Generte Gussin distribution using rndom numbers. Rndom number genertor gives numbers distributed uniformly in the intervl [0,] µ / nd σ / Procedure: Tke numbers (r i ) from your computer s rndom number genertor Add them together Subtrct 6 Get number tht looks s if it is from Gussin pdf! $ ' P < Y +Y +...Y n " nµ # n () $ ' + r i " * P < i * ) ) ) ( $ ' P "6 < + r i " 6 < 6 ( ) i 6 -, e" y "6 Thus the sum of uniform rndom numbers minus 6 is distributed s if it cme from Gussin pdf with µ 0 nd σ. A) 00 rndom numbers B) 00 pirs (r + r ) of rndom numbers C) 00 triplets (r + r + r 3 ) of rndom numbers D) 00 -plets (r + r + r ) of rndom numbers. E) 00 -plets -6 0 +6 K.K. Gn L3: Gussin Probbility Distribution 5 E is close to! (r + r + r - 6) of rndom numbers. Gussin µ 0 nd σ

Exmple: A wtch mkes n error of t most ±/ minute per dy. After one yer, wht s the probbility tht the wtch is ccurte to within ±5 minutes? Assume tht the dily errors re uniform in [-/, /]. For ech dy, the verge error is zero nd the stndrd devition / minutes. The error over the course of yer is just the ddition of the dily error. Since the dily errors come from uniform distribution with well defined men nd vrince Centrl Limit Theorem is pplicble: lim P < Y +Y +...Y n $ nµ ) n"# '( n * + ḇ, e$ y The upper limit corresponds to +5 minutes: b Y +Y +...Y n " nµ 5 " 365 $ 0 # n 365 4.5 The lower limit corresponds to -5 minutes: Y +Y +...Y n " nµ "5 " 365$ 0 "4.5 # n 365 The probbility to be within ± 5 minutes: 4.5 e # y P $ 0.999997 # 30 #6 " #4.5 less thn three in million chnce tht the wtch will be off by more thn 5 minutes in yer! K.K. Gn L3: Gussin Probbility Distribution 6

Exmple: The dily income of "crd shrk" hs uniform distribution in the intervl [-$40,$]. Wht is the probbility tht s/he wins more thn $0 in 60 dys? Lets use the CLT to estimte this probbility: lim P < Y +Y +...Y n $ nµ ) n"# '( n * + ḇ, e$ y The probbility distribution of dily income is uniform, p(y). need to be normlized in computing the verge dily winning (µ) nd its stndrd devition (σ). µ $ # yp(y) # p(y) [ " () ] 5 " () # y p(y) " µ 3 [ 3 " () 3 ] " 5 675 " () # p(y) The lower limit of the winning is $0: Y +Y +...Y n " nµ 0 " 60$ 5 # n 675 60 00 0 The upper limit is the mximum tht the shrk could win ($/dy for 60 dys): b Y +Y +...Y n " nµ 3000 " 60$ 5 # n 675 60 700 0 3.4 P 3.4 e " y ' ( e" y 0.6 6 chnce to win > $0 in 60 dys K.K. Gn L3: Gussin Probbility Distribution 7