Probability and Random Variable Primer

Size: px
Start display at page:

Download "Probability and Random Variable Primer"

Transcription

1 B. Maddah ENMG 622 Smulaton 2/22/ Probablty and Random Varable Prmer Sample space and Events Suppose that an eperment wth an uncertan outcome s performed (e.g., rollng a de). Whle the outcome of the eperment s not known n advance, the set of all possble outcomes s known. Ths set s the sample space, Ω. For eample, when rollng a de Ω = {, 2, 3, 4, 5, 6}. When tossng a con, Ω = {H, T}. When measurng lfe tme of a machne (years), Ω = {, 2, 3, }. A subset E Ω s known as an event. E.g., when rollng a de, E = {} s the event that one appears and F = {, 3, 5} s the event that an odd number appears. Probablty of an event If an eperment s repeated for a number of tmes whch s large enough, the fracton of tme that event E occurs s the probablty that event E occurs, P{E}. E.g., when rollng a far de, P{} = /6, and P{, 3, 5} = 3/6 = /2. When tossng a far con, P{H} = P{T} = /2. In some cases, events are not repeated many tmes. For such cases, probabltes can be a measure of belef (subjectve probablty).

2 Aoms of probablty () For E Ω, P{E} ; (2) P{ Ω} = ; (3) For events E, E 2,, E,, wth E Ω, E E j =, for all and j, P E = P{ E} =. = Implcatons The aoms of probablty mply the followng results: o For E and F Ω, P{E or F} = P{E F} = P{E} + P{F} P{E F} ; o If E and F are mutually eclusve (.e., E F = ), then P{E F} = P{E} + P{F}; o For E Ω, let E c be the complement of E (.e., E E c = Ω), P{E c } = P{E}; o P{ } =. Condtonal probablty The probablty that event E occurs gven that event F has already occurred s PE { F} PE { F} =. PF { } P{E F} = P{E and F}. 2

3 Independent events For E and F Ω, P{E F} = P{E F}P{F}. Two events are ndependent f an only f P{E F} = P{E}P{F}. That s, P{E F} = P{E}. Eample Suppose that two far cons are tossed. What s the probablty that ether the frst or the second con falls heads? In ths eample, Ω = {(H, H), (H, T), (T, H), (T,T)}. Let E (F) be the event that the frst (second) con falls heads, E ={(H, H), (H, T)} and F = {(H, H), (T, H)}, and E F ={H, H}. The desred probablty s PE { F} = PE { } + PF { } PE { F} = /2+ /2 /4 = 3/4. Eample 2 When rollng two far dce, suppose the frst de s 3, what s the probablty the sum of the two dce s 7? Let E be the event that the sum of the two dce s 7, E = {(, 6), (2, 5), (3, 4), (4, 3), (5, 2), (6, )}, and F be the event that the frst de s 3, F= {(3, ), (3, 2), (3, 3), (3, 4), (3, 5), (3, 6)}. Then, PE { F} P{(3,4)} PE { F} = = PF { } P{(3, ), (3, 2), (3, 3), (3, 4), (3, 5), (3, 6)} /36 = =. 6/36 6 Fndng Probablty by Condtonng Suppose that we know the probablty of event B once event A s realzed (or not). We also know P{A}. That s, we know P{B A}, and P{B A c } and P{A}. What s P{B}? 3

4 Note that B = (A B) (A c B) P{B} = P{A B} + P{A c B}. Therefore, P{B} = P{B A}P{A} + P{B A c }P{A c } = P{B A}P{A} + P{B A c }( P{A}). Here we are fndng P{B} by condtonng on A. In general, f the realzaton of B depends on a partton A of Ω, A A2 A =Ω, A A =, j, n j n P{ B} = P{ B A} P{ A}. = Bayes Formula Ths follows from condtonal probabltes. For two events, PA { B} PB { APA } { } PAB { } = =. c c PB { } PB { APA } { } + PB { A} PA { } Wth a partton A, Eample 3 PA { j B} PB { Aj} PA { j} PA { j B} = =. n PB { } P{ B A} P{ A} Consder two urns. The frst urn contans three whte and seven black balls, and the second contans fve whte and fve black balls. We flp a con and then draw a ball from the frst urn or the second urn dependng on whether the outcome was heads or tals. What s the probablty that a whte ball s selected? = 4

5 P{W} = P{W H}P{H} + P{W T}P{T} = (3/)(/2) + (5/)(/2) = 2/5. What s the probablty that a black ball s selected? P{B} = P{W} = 3/5. What s the probablty that the con has landed heads gven that a whte ball s selected? PW { H} PH { } (3/)(/ 2) 3 From Bayes formula, PH { W} = = =. PW { } 2/5 8 Random Varables Consder a functon that assgns real numbers to events (outcomes) n Ω. Such real-valued functon s a random varable. E.g., when rollng two far dce, defne as the sum of the two dce. Then, s a random varable wth P{ = 2} = P{(,)}=/36, P{ = 3} = P{(, 2), (2, )}=2/36=/8, etc. E.g., the salvage value of a machne, S, s $,5 f the market goes up (wth probablty.4) and $, f the market goes down (wth probablty.6). Then, S s a random varable wth P{S = 5} =.4 and P{S = } =.6. If the random varable can take on a lmted number of values. Then, ths s a dscrete random varable. E.g., the random varable representng the sum of two dce. 5

6 If the random varable can take on an uncountable number of values. Then, ths s a contnuous random varable. E.g., the random varable H representng heght of an AUB student. If s a dscrete random varable, the functon f () = P{ = } s the probablty mass functon (pmf) of. The functon F () = P{ } = f ( ) s the cumulatve dstrbuton functon (cdf) of. E.g., for the random varable S representng salvage value of a machne above,.6 f s= f s< fs() s =.4 f s= 5, FS() s =.6 f s< 5. othewse f s 5 For a contnuous random varable,, the cdf s defned based on a functon f () called the densty functon, where P { } = F( ) = f ( tdt ). Fact. For a dscrete random varable f( ) =. For a contnuous random varable, f ( ) =. Independent Random varables Two random varables and Y are sad to be ndependent f P{, Y y} = P{ } P{ Y y} = F ( ) F ( y). Y 6

7 Epectaton of a random varable The epectaton of a dscrete random varable s. E [ ] = P { = } = f ( ) The epectaton of a contnuous random varable s E[ ] = f ( d ). The epectaton of a random varable s the value obtaned f the underlyng eperence s repeated for a number of tmes whch s large enough and the resultng values are averaged. The epectaton s lnear. That s, for two random varables and Y, E[a + by] = ae[] + be[y]. The epectaton of a functon of random varable, g(), s Eg [ ( )] = g( ) f ( d ). An mportant measure s the n th moment of, n =, 2, n n E[ ] = f ( d ) Measures of varablty The varance of a random varable s ( ) Var[ ] E[( E[ ]) ] E[ ] E[ ] = =. The standard devaton of a random varable s σ = Var[ ]. 7

8 The coeffcent of varaton of s CV[] = σ /E[]. The varance (standard devaton) measures the spread of the random varable around the epectaton. The coeffcent of varaton s useful when comparng varablty of dfferent alternatves. Note that Var[a+b] =a 2 Var[], for any real number a and random varable a. Jont dstrbuton The jont dstrbuton functon of two random varables s F, Y(, y) = P{, Y y}. If and Y are dscrete random varables then, F (, y) = P{ =, Y = j} = f (, j), Y, Y,, j y, j y where f,y (.) s the jont pmf of and Y. If and Y are contnuous random varables then, y F (, y ) f (, y ) ddy, = Y, Y, where f,y (.) s the jont pdf of and Y. Fact. F, (, y) = F ( ) F ( y) f and only f (ff) and Y are ndependent. Y Y 8

9 Covarance The covarance measures the dependence of two random varables. For two random varables and Y, where, σ Y = Cov[, Y ] = E[( E[ ])( Y E[ Y ])] = E[ Y ] E[ ] E[ Y ], E [ Y ] yf (, y ) ddy, = Y, If σ > (<), and Y are sad to be postvely (negatvely) correlated. σ y = ff and Y are ndependent. Propertes of covarance Cov[, ] = Var[ ], Cov[ Y, ] = Cov[ Y, ], Cov[ a, Y ] = acov[ Y, ], Cov[, Y + Z] = Cov[, Y] + Cov[, Z], Cov[ Y, ] = σ σ σ. Y Y σ Y The coeffcent of correlaton s defned as ρ Y =. σ σ Note that ρ Y Note that Var[ + Y] = Var[ ] + 2Cov[, Y] + Var[ Y]. If and Y are ndependent, Var[+Y] = Var[] + Var[Y]. Y 9

10 The Bernoull Random Varable Suppose an eperment can result n success wth probablty p and falure wth probablty (w.p.) p. We defne a Bernoull random varable as = f the eperment outcome s a success and =, otherwse. The pmf of s p f = f ( ) = P{ = } = p f =. The epected value of s E[] = ( p) + (p) = p. The second moment of s E[ 2 ] = 2 ( p) + 2 (p) = p. The varance of s Var[] = E[ 2 ] (E[]) 2 = p p 2 = p( p). The Bnomal Random Varable Consder n ndependent trals, each of whch can results n a success w.p. p and falure w.p. p. We defne a Bnomal random varable,, as the number of successes n the n trals. The pmf of s defned as n n f () = P{ = } = p ( p), =,, n n n! where =. ( n )!!

11 .3 f ().2. Note that n n n n f () = p ( p) =, =,, n. = = Fact. Let =, =,, n, f the th tral results n success and =, otherwse. Then n =. = Note that are ndependent and dentcally dstrbuted (d) Bernoull random varable wth parameter p. Therefore, n E [ ] = E [ ] = np, Var [ ] = Var [ ] = np( p). Eample 4 = = A far con s flpped 5 tmes. What s the probablty that two heads are obtaned? The number of heads,, s a bnomal random varable wth parameters n = 5 and p =.5. Then, the desred probablty s P{ = 2} = [5!/(2! 3!)] (.5) 2 (.5) 3 =.33. n

12 The Geometrc Random Varable Suppose ndependent trals, each havng a probablty p of beng a success, are performed. We defne the geometrc random varable (rv) as the number of trals untl the frst success occurs. The pmf of s defned as f = P = = p p = () { } ( ),, 2,.5 f () Note that f () defnes a pmf snce f ( ) = p ( p) = p ( p) = p/[ ( p)] =. = = = Let q = p. The frst two moments and varance of are [ ], E = q p= = p 2 p 2 2 [ ] = =, 2 = p E p q p = E E = p 2 2 Var[ ] [ ] ( [ ]). 2 2

13 Eample 5. When rollng a de repettvely, what s the probablty that the frst 6 appears on the sth roll? Let be the number of rolls untl a 6 appears. Then, s a geometrc rv wth parameter p = /6, and the desred probablty s P{ = 6} = (5/6) 5 (/6) =.667. What s the epected number of rolls untl a 6 appears? E[] = /p = 6. The Posson Random Varable A rv, takng on values,,, s sad to be a Posson random varable wth parameter λ > f λ λ f () = P{ = } = e, =,,!.5 f () f () defnes a pmf snce λ () = = ( )( ) =. λ λ λ f e e e = =! The Posson rv s a good model for demand, arrvals, and certan rare events. 3

14 The frst two moments and the varance of are E [ ] = λ, E λ λ 2 2 [ ] = +, Var E E 2 2 [ ] = [ ] ( [ ]) =. λ Let and 2 be two ndependent Posson rv s wth means λ and λ 2. Then, Z = + 2 s a Posson rv wth mean λ + λ 2. Eample 6. The monthly demand for a certan arplane spare part of Fly Hgh Arlnes (FHA) fleet at Berut arport s estmated to be a Posson random varable wth mean.5. Suppose that FHA wll stock one spare part at the begnnng of March. Once the part s used, a new part s ordered. The delvery lead tme for a part s 2 months. What s the probablty that the spare part wll be used durng March? Let be the demand for the spare part. The desred probablty s P{ } = e λ = e.5 =.393. What s the probablty that FHA wll face a shortage on ths part n March? The desred probablty s P{ > } = P{ = } P{ = } = e.5.5e.5 =.9. The Unform Random Varable A rv that s equally lke to be near any pont of an nterval (a, b) s sad to have a unform dstrbuton. 4

15 The pdf of s, f a< < b f ( ) = b a, otherwse Note that f () defnes a pdf snce b a b f ( ) = d. b a = a.3 f ( ) The cdf of s, f < a a F( ) = f ( tdt ) =, f a b b a, otherwse The frst two moments of are b b 2 2 b a b a + E [ ] = f ( d ) = d= =, b a 2( b a) 2 a a b b b a a + ab+ b [ ] = ( ) = = =. b a 3( b a) 3 a a E f d d The varance of s E[ 2 ] (E[]) 2 = (b a) 2 / 2. 5

16 The Eponental Random Varable An eponental rv wth parameter λ s a rv whose pdf s f λe λ, f ( ) =, othewse.5 f ( ) Note that f () defnes a pdf snce λ λ f ( ) = λe d= e =. The eponental rv s a good model for tme between arrvals or tme to falure of certan equpments. The cdf of s λt λ λ λ F ( ) = f ( t) dt = e dt = e = e,. A useful property of the eponental dstrbuton s that P{ > } = e λ. 6

17 The frst two moments and the varance of are E [ ] =, λ 2 E = λ 2 [ ], 2 Var = E E = λ 2 2 [ ] [ ] ( [ ]). 2 Preposton. The eponental dstrbuton has the memoryless property. I.e., P { > t+ u > t} = P { > u}. Proof. P { > t+ u, > t} P { > t+ u} P { > t+ u > t} = = P { > t} P { > t} λ ( t+ u) e λu = = e = P{ > u}. λt e The memoryless property allows developng tractable analytcal models wth the eponental dstrbuton. It makes the eponental dstrbuton very popular n modelng. Preposton. Let and 2 be two ndependent eponental random varables wth parameters λ `and λ 2. Let = mn(, 2 ). Then, s an eponental random varable wth parameter λ `+ λ 2. Proof. P{ > } = P{ >, 2 > } = P{ > }P{ 2 > } λ λ2 ( λ+ λ2) = e e = e. 7

18 Eample 7. The amount of tme one spends n the bank s eponentally dstrbuted wth mean mnutes. A customer arrves at : PM. What s the probablty that the customer wll be n the bank at :5 PM? Let be the tme the customers spends n the bank. Then, s eponentally dstrbuted wth parameter λ = /. The desred probablty s P{ > 5} = e 5λ = e 5/ =.223. It s now :2 PM and the customer s stll n the bank? What s the probablty that the customer wll be n the bank at :35 PM?.223 (by the memoryless property). The Normal Random Varable We say that a random varable s a normal rv wth parameters μ and σ > f t has the followng pdf: 2 2 ( μ) /(2 σ ) e f ( ) =, (, ). 2πσ.5 f ( )

19 Note that f () defnes a pdf. Wth a change of varable z = ( μ)/σ and usng the fact that z 2 /2 2 2 e e dz = 2 π, ( μ) /(2 σ ) 2 z /2 f ( ) d = d = e dz =. 2πσ 2 π The normal rv s a good model for quanttes that can be seen as sums or averages of a large number of rv s. The cdf of, F( ) = f( t) dt, has no closed-form. The frst two moments of and varance of are E[ ] = μ, E [ ], Var = σ + μ = σ 2 [ ]. Fact. If s a normal rv, then Z = ( μ)/σ s a standard normal r.v. wth parameters and. Proof. Note that μ + σ z 2 2 ( t μ ) /(2 σ ) μ e P{ Z < z} = P{ < z} = P{ < μ+ σz} = dt. σ 2πσ Let u = (t μ)/σ, then z u 2 /2 e P{ Z < z} = du, whch s the cdf of 2π the standard normal. Ths fact mples that = μ + σ Z. 9

20 The cdf of, F (), s evaluates through the cdf of Z, F Z (z), whch s often tabulated, μ μ P { < } = PZ { < } F( ) = FZ σ σ. Proposton If and 2 are two ndependent normal rvs wth means μ and varances σ 2, =,2, then Z = + 2 s normal wth mean μ + μ 2 and varance σ 2 + σ 2 2. Theorem (central lmt theorem). If, =, 2,, n, are d rv s wth mean μ and varance σ 2. Then, for n large enough, n = s normally dstrbuted wth mean nμ and varance nσ 2. Eample 8. The heght of an AUB male student s a normal rv wth mean 7 cm and standard devaton 8 cm. What s the probablty that the heght of an AUB student s less than 8 cm? Let be the heght of the student. Then, the desred probablty s P{ < 8} = P{Z < (8 7)/8} = P{Z <.25} =

Chapter 1. Probability

Chapter 1. Probability Chapter. Probablty Mcroscopc propertes of matter: quantum mechancs, atomc and molecular propertes Macroscopc propertes of matter: thermodynamcs, E, H, C V, C p, S, A, G How do we relate these two propertes?

More information

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number

More information

j) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1

j) = 1 (note sigma notation) ii. Continuous random variable (e.g. Normal distribution) 1. density function: f ( x) 0 and f ( x) dx = 1 Random varables Measure of central tendences and varablty (means and varances) Jont densty functons and ndependence Measures of assocaton (covarance and correlaton) Interestng result Condtonal dstrbutons

More information

CS-433: Simulation and Modeling Modeling and Probability Review

CS-433: Simulation and Modeling Modeling and Probability Review CS-433: Smulaton and Modelng Modelng and Probablty Revew Exercse 1. (Probablty of Smple Events) Exercse 1.1 The owner of a camera shop receves a shpment of fve cameras from a camera manufacturer. Unknown

More information

Simulation and Random Number Generation

Simulation and Random Number Generation Smulaton and Random Number Generaton Summary Dscrete Tme vs Dscrete Event Smulaton Random number generaton Generatng a random sequence Generatng random varates from a Unform dstrbuton Testng the qualty

More information

Expected Value and Variance

Expected Value and Variance MATH 38 Expected Value and Varance Dr. Neal, WKU We now shall dscuss how to fnd the average and standard devaton of a random varable X. Expected Value Defnton. The expected value (or average value, or

More information

Engineering Risk Benefit Analysis

Engineering Risk Benefit Analysis Engneerng Rsk Beneft Analyss.55, 2.943, 3.577, 6.938, 0.86, 3.62, 6.862, 22.82, ESD.72, ESD.72 RPRA 2. Elements of Probablty Theory George E. Apostolaks Massachusetts Insttute of Technology Sprng 2007

More information

Lecture 3: Probability Distributions

Lecture 3: Probability Distributions Lecture 3: Probablty Dstrbutons Random Varables Let us begn by defnng a sample space as a set of outcomes from an experment. We denote ths by S. A random varable s a functon whch maps outcomes nto the

More information

CS 798: Homework Assignment 2 (Probability)

CS 798: Homework Assignment 2 (Probability) 0 Sample space Assgned: September 30, 2009 In the IEEE 802 protocol, the congeston wndow (CW) parameter s used as follows: ntally, a termnal wats for a random tme perod (called backoff) chosen n the range

More information

PhysicsAndMathsTutor.com

PhysicsAndMathsTutor.com PhscsAndMathsTutor.com phscsandmathstutor.com June 005 5. The random varable X has probablt functon k, = 1,, 3, P( X = ) = k ( + 1), = 4, 5, where k s a constant. (a) Fnd the value of k. (b) Fnd the eact

More information

Statistics Spring MIT Department of Nuclear Engineering

Statistics Spring MIT Department of Nuclear Engineering Statstcs.04 Sprng 00.04 S00 Statstcs/Probablty Analyss of eperments Measurement error Measurement process systematc vs. random errors Nose propertes of sgnals and mages quantum lmted mages.04 S00 Probablty

More information

Homework 9 for BST 631: Statistical Theory I Problems, 11/02/2006

Homework 9 for BST 631: Statistical Theory I Problems, 11/02/2006 Due Tme: 5:00PM Thursda, on /09/006 Problem (8 ponts) Book problem 45 Let U = X + and V = X, then the jont pmf of ( UV, ) s θ λ θ e λ e f( u, ) = ( = 0, ; u =, +, )! ( u )! Then f( u, ) u θ λ f ( x x+

More information

Distributions /06. G.Serazzi 05/06 Dimensionamento degli Impianti Informatici distrib - 1

Distributions /06. G.Serazzi 05/06 Dimensionamento degli Impianti Informatici distrib - 1 Dstrbutons 8/03/06 /06 G.Serazz 05/06 Dmensonamento degl Impant Informatc dstrb - outlne densty, dstrbuton, moments unform dstrbuton Posson process, eponental dstrbuton Pareto functon densty and dstrbuton

More information

Maximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models

Maximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models ECO 452 -- OE 4: Probt and Logt Models ECO 452 -- OE 4 Maxmum Lkelhood Estmaton of Bnary Dependent Varables Models: Probt and Logt hs note demonstrates how to formulate bnary dependent varables models

More information

Notes prepared by Prof Mrs) M.J. Gholba Class M.Sc Part(I) Information Technology

Notes prepared by Prof Mrs) M.J. Gholba Class M.Sc Part(I) Information Technology Inverse transformatons Generaton of random observatons from gven dstrbutons Assume that random numbers,,, are readly avalable, where each tself s a random varable whch s unformly dstrbuted over the range(,).

More information

A random variable is a function which associates a real number to each element of the sample space

A random variable is a function which associates a real number to each element of the sample space Introducton to Random Varables Defnton of random varable Defnton of of random varable Dscrete and contnuous random varable Probablty blt functon Dstrbuton functon Densty functon Sometmes, t s not enough

More information

Maximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models

Maximum Likelihood Estimation of Binary Dependent Variables Models: Probit and Logit. 1. General Formulation of Binary Dependent Variables Models ECO 452 -- OE 4: Probt and Logt Models ECO 452 -- OE 4 Mamum Lkelhood Estmaton of Bnary Dependent Varables Models: Probt and Logt hs note demonstrates how to formulate bnary dependent varables models for

More information

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction

The Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also

More information

Applied Stochastic Processes

Applied Stochastic Processes STAT455/855 Fall 23 Appled Stochastc Processes Fnal Exam, Bref Solutons 1. (15 marks) (a) (7 marks) The dstrbuton of Y s gven by ( ) ( ) y 2 1 5 P (Y y) for y 2, 3,... The above follows because each of

More information

Convergence of random processes

Convergence of random processes DS-GA 12 Lecture notes 6 Fall 216 Convergence of random processes 1 Introducton In these notes we study convergence of dscrete random processes. Ths allows to characterze phenomena such as the law of large

More information

PROBABILITY PRIMER. Exercise Solutions

PROBABILITY PRIMER. Exercise Solutions PROBABILITY PRIMER Exercse Solutons 1 Probablty Prmer, Exercse Solutons, Prncples of Econometrcs, e EXERCISE P.1 (b) X s a random varable because attendance s not known pror to the outdoor concert. Before

More information

A be a probability space. A random vector

A be a probability space. A random vector Statstcs 1: Probablty Theory II 8 1 JOINT AND MARGINAL DISTRIBUTIONS In Probablty Theory I we formulate the concept of a (real) random varable and descrbe the probablstc behavor of ths random varable by

More information

Introduction to Random Variables

Introduction to Random Variables Introducton to Random Varables Defnton of random varable Defnton of random varable Dscrete and contnuous random varable Probablty functon Dstrbuton functon Densty functon Sometmes, t s not enough to descrbe

More information

First Year Examination Department of Statistics, University of Florida

First Year Examination Department of Statistics, University of Florida Frst Year Examnaton Department of Statstcs, Unversty of Florda May 7, 010, 8:00 am - 1:00 noon Instructons: 1. You have four hours to answer questons n ths examnaton.. You must show your work to receve

More information

Probability Theory (revisited)

Probability Theory (revisited) Probablty Theory (revsted) Summary Probablty v.s. plausblty Random varables Smulaton of Random Experments Challenge The alarm of a shop rang. Soon afterwards, a man was seen runnng n the street, persecuted

More information

MIMA Group. Chapter 2 Bayesian Decision Theory. School of Computer Science and Technology, Shandong University. Xin-Shun SDU

MIMA Group. Chapter 2 Bayesian Decision Theory. School of Computer Science and Technology, Shandong University. Xin-Shun SDU Group M D L M Chapter Bayesan Decson heory Xn-Shun Xu @ SDU School of Computer Scence and echnology, Shandong Unversty Bayesan Decson heory Bayesan decson theory s a statstcal approach to data mnng/pattern

More information

9.07 Introduction to Probability and Statistics for Brain and Cognitive Sciences Emery N. Brown

9.07 Introduction to Probability and Statistics for Brain and Cognitive Sciences Emery N. Brown 9.07 Introducton to Probablty and Statstcs for Bran and Cogntve Scences Emery N. Brown Lecture 6: Epectaton and Varance, Covarance and Correlaton, And Movement Generatng Functons I. Objectves Understand

More information

Propagation of error for multivariable function

Propagation of error for multivariable function Propagaton o error or multvarable uncton ow consder a multvarable uncton (u, v, w, ). I measurements o u, v, w,. All have uncertant u, v, w,., how wll ths aect the uncertant o the uncton? L tet) o (Equaton

More information

Suites of Tests. DIEHARD TESTS (Marsaglia, 1985) See

Suites of Tests. DIEHARD TESTS (Marsaglia, 1985) See Sutes of Tests DIEHARD TESTS (Marsagla, 985 See http://stat.fsu.edu/~geo/dehard.html NIST Test sute- 6 tests on the sequences of bts http://csrc.nst.gov/rng/ Test U0 Includes the above tests. http://www.ro.umontreal.ca/~lecuyer/

More information

Statistical analysis using matlab. HY 439 Presented by: George Fortetsanakis

Statistical analysis using matlab. HY 439 Presented by: George Fortetsanakis Statstcal analyss usng matlab HY 439 Presented by: George Fortetsanaks Roadmap Probablty dstrbutons Statstcal estmaton Fttng data to probablty dstrbutons Contnuous dstrbutons Contnuous random varable X

More information

Binomial Distribution: Tossing a coin m times. p = probability of having head from a trial. y = # of having heads from n trials (y = 0, 1,..., m).

Binomial Distribution: Tossing a coin m times. p = probability of having head from a trial. y = # of having heads from n trials (y = 0, 1,..., m). [7] Count Data Models () Some Dscrete Probablty Densty Functons Bnomal Dstrbuton: ossng a con m tmes p probablty of havng head from a tral y # of havng heads from n trals (y 0,,, m) m m! fb( y n) p ( p)

More information

Chapter 2 Transformations and Expectations. , and define f

Chapter 2 Transformations and Expectations. , and define f Revew for the prevous lecture Defnton: support set of a ranom varable, the monotone functon; Theorem: How to obtan a cf, pf (or pmf) of functons of a ranom varable; Eamples: several eamples Chapter Transformatons

More information

THE ROYAL STATISTICAL SOCIETY 2006 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE

THE ROYAL STATISTICAL SOCIETY 2006 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE THE ROYAL STATISTICAL SOCIETY 6 EXAMINATIONS SOLUTIONS HIGHER CERTIFICATE PAPER I STATISTICAL THEORY The Socety provdes these solutons to assst canddates preparng for the eamnatons n future years and for

More information

SELECTED PROOFS. DeMorgan s formulas: The first one is clear from Venn diagram, or the following truth table:

SELECTED PROOFS. DeMorgan s formulas: The first one is clear from Venn diagram, or the following truth table: SELECTED PROOFS DeMorgan s formulas: The frst one s clear from Venn dagram, or the followng truth table: A B A B A B Ā B Ā B T T T F F F F T F T F F T F F T T F T F F F F F T T T T The second one can be

More information

DS-GA 1002 Lecture notes 5 Fall Random processes

DS-GA 1002 Lecture notes 5 Fall Random processes DS-GA Lecture notes 5 Fall 6 Introducton Random processes Random processes, also known as stochastc processes, allow us to model quanttes that evolve n tme (or space n an uncertan way: the trajectory of

More information

Statistics and Probability Theory in Civil, Surveying and Environmental Engineering

Statistics and Probability Theory in Civil, Surveying and Environmental Engineering Statstcs and Probablty Theory n Cvl, Surveyng and Envronmental Engneerng Pro. Dr. Mchael Havbro Faber ETH Zurch, Swtzerland Contents o Todays Lecture Overvew o Uncertanty Modelng Random Varables - propertes

More information

Module 2. Random Processes. Version 2 ECE IIT, Kharagpur

Module 2. Random Processes. Version 2 ECE IIT, Kharagpur Module Random Processes Lesson 6 Functons of Random Varables After readng ths lesson, ou wll learn about cdf of functon of a random varable. Formula for determnng the pdf of a random varable. Let, X be

More information

Department of Computer Science Artificial Intelligence Research Laboratory. Iowa State University MACHINE LEARNING

Department of Computer Science Artificial Intelligence Research Laboratory. Iowa State University MACHINE LEARNING MACHINE LEANING Vasant Honavar Bonformatcs and Computatonal Bology rogram Center for Computatonal Intellgence, Learnng, & Dscovery Iowa State Unversty honavar@cs.astate.edu www.cs.astate.edu/~honavar/

More information

1. Inference on Regression Parameters a. Finding Mean, s.d and covariance amongst estimates. 2. Confidence Intervals and Working Hotelling Bands

1. Inference on Regression Parameters a. Finding Mean, s.d and covariance amongst estimates. 2. Confidence Intervals and Working Hotelling Bands Content. Inference on Regresson Parameters a. Fndng Mean, s.d and covarance amongst estmates.. Confdence Intervals and Workng Hotellng Bands 3. Cochran s Theorem 4. General Lnear Testng 5. Measures of

More information

RELIABILITY ASSESSMENT

RELIABILITY ASSESSMENT CHAPTER Rsk Analyss n Engneerng and Economcs RELIABILITY ASSESSMENT A. J. Clark School of Engneerng Department of Cvl and Envronmental Engneerng 4a CHAPMAN HALL/CRC Rsk Analyss for Engneerng Department

More information

β0 + β1xi and want to estimate the unknown

β0 + β1xi and want to estimate the unknown SLR Models Estmaton Those OLS Estmates Estmators (e ante) v. estmates (e post) The Smple Lnear Regresson (SLR) Condtons -4 An Asde: The Populaton Regresson Functon B and B are Lnear Estmators (condtonal

More information

ANSWERS CHAPTER 9. TIO 9.2: If the values are the same, the difference is 0, therefore the null hypothesis cannot be rejected.

ANSWERS CHAPTER 9. TIO 9.2: If the values are the same, the difference is 0, therefore the null hypothesis cannot be rejected. ANSWERS CHAPTER 9 THINK IT OVER thnk t over TIO 9.: χ 2 k = ( f e ) = 0 e Breakng the equaton down: the test statstc for the ch-squared dstrbuton s equal to the sum over all categores of the expected frequency

More information

Here is the rationale: If X and y have a strong positive relationship to one another, then ( x x) will tend to be positive when ( y y)

Here is the rationale: If X and y have a strong positive relationship to one another, then ( x x) will tend to be positive when ( y y) Secton 1.5 Correlaton In the prevous sectons, we looked at regresson and the value r was a measurement of how much of the varaton n y can be attrbuted to the lnear relatonshp between y and x. In ths secton,

More information

Equilibrium Analysis of the M/G/1 Queue

Equilibrium Analysis of the M/G/1 Queue Eulbrum nalyss of the M/G/ Queue Copyrght, Sanay K. ose. Mean nalyss usng Resdual Lfe rguments Secton 3.. nalyss usng an Imbedded Marov Chan pproach Secton 3. 3. Method of Supplementary Varables done later!

More information

1. Fundamentals 1.1 Probability Theory Sample Space and Probability Random Variables Limit Theories

1. Fundamentals 1.1 Probability Theory Sample Space and Probability Random Variables Limit Theories 1. undamentals 1.1 robablt Theor 1.1.1 Sample Space and robablt 1.1.2 Random Varables 1.1.3 Lmt Theores 1.1 robablt Theor A statstcal model probablt model deals wth eperment whose outcome s not precsel

More information

MATH 829: Introduction to Data Mining and Analysis The EM algorithm (part 2)

MATH 829: Introduction to Data Mining and Analysis The EM algorithm (part 2) 1/16 MATH 829: Introducton to Data Mnng and Analyss The EM algorthm (part 2) Domnque Gullot Departments of Mathematcal Scences Unversty of Delaware Aprl 20, 2016 Recall 2/16 We are gven ndependent observatons

More information

Problem Set 9 - Solutions Due: April 27, 2005

Problem Set 9 - Solutions Due: April 27, 2005 Problem Set - Solutons Due: Aprl 27, 2005. (a) Frst note that spam messages, nvtatons and other e-mal are all ndependent Posson processes, at rates pλ, qλ, and ( p q)λ. The event of the tme T at whch you

More information

Multiple Choice. Choose the one that best completes the statement or answers the question.

Multiple Choice. Choose the one that best completes the statement or answers the question. ECON 56 Homework Multple Choce Choose the one that best completes the statement or answers the queston ) The probablty of an event A or B (Pr(A or B)) to occur equals a Pr(A) Pr(B) b Pr(A) + Pr(B) f A

More information

Stochastic Structural Dynamics

Stochastic Structural Dynamics Stochastc Structural Dynamcs Lecture-1 Defnton of probablty measure and condtonal probablty Dr C S Manohar Department of Cvl Engneerng Professor of Structural Engneerng Indan Insttute of Scence angalore

More information

Statistics and Quantitative Analysis U4320. Segment 3: Probability Prof. Sharyn O Halloran

Statistics and Quantitative Analysis U4320. Segment 3: Probability Prof. Sharyn O Halloran Statstcs and Quanttatve Analyss U430 Segment 3: Probablty Prof. Sharyn O Halloran Revew: Descrptve Statstcs Code book for Measures Sample Data Relgon Employed 1. Catholc 0. Unemployed. Protestant 1. Employed

More information

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)

Econ107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4) I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes

More information

} Often, when learning, we deal with uncertainty:

} Often, when learning, we deal with uncertainty: Uncertanty and Learnng } Often, when learnng, we deal wth uncertanty: } Incomplete data sets, wth mssng nformaton } Nosy data sets, wth unrelable nformaton } Stochastcty: causes and effects related non-determnstcally

More information

Limited Dependent Variables

Limited Dependent Variables Lmted Dependent Varables. What f the left-hand sde varable s not a contnuous thng spread from mnus nfnty to plus nfnty? That s, gven a model = f (, β, ε, where a. s bounded below at zero, such as wages

More information

Randomness and Computation

Randomness and Computation Randomness and Computaton or, Randomzed Algorthms Mary Cryan School of Informatcs Unversty of Ednburgh RC 208/9) Lecture 0 slde Balls n Bns m balls, n bns, and balls thrown unformly at random nto bns usually

More information

= z 20 z n. (k 20) + 4 z k = 4

= z 20 z n. (k 20) + 4 z k = 4 Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5

More information

UNIVERSITY OF TORONTO Faculty of Arts and Science. December 2005 Examinations STA437H1F/STA1005HF. Duration - 3 hours

UNIVERSITY OF TORONTO Faculty of Arts and Science. December 2005 Examinations STA437H1F/STA1005HF. Duration - 3 hours UNIVERSITY OF TORONTO Faculty of Arts and Scence December 005 Examnatons STA47HF/STA005HF Duraton - hours AIDS ALLOWED: (to be suppled by the student) Non-programmable calculator One handwrtten 8.5'' x

More information

1.4. Experiments, Outcome, Sample Space, Events, and Random Variables

1.4. Experiments, Outcome, Sample Space, Events, and Random Variables 1.4. Experments, Outcome, Sample Space, Events, and Random Varables In Secton 1.2.5, we dscuss how to fnd probabltes based on countng. Whle the probablty of any complex event s bult on countng, brute force

More information

7. Multivariate Probability

7. Multivariate Probability 7. Multvarate Probablty Chrs Pech and Mehran Saham May 2017 Often you wll work on problems where there are several random varables (often nteractng wth one another). We are gong to start to formally look

More information

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 3: Large deviations bounds and applications Lecturer: Sanjeev Arora

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 3: Large deviations bounds and applications Lecturer: Sanjeev Arora prnceton unv. F 13 cos 521: Advanced Algorthm Desgn Lecture 3: Large devatons bounds and applcatons Lecturer: Sanjeev Arora Scrbe: Today s topc s devaton bounds: what s the probablty that a random varable

More information

Chapter 3 Describing Data Using Numerical Measures

Chapter 3 Describing Data Using Numerical Measures Chapter 3 Student Lecture Notes 3-1 Chapter 3 Descrbng Data Usng Numercal Measures Fall 2006 Fundamentals of Busness Statstcs 1 Chapter Goals To establsh the usefulness of summary measures of data. The

More information

An Experiment/Some Intuition (Fall 2006): Lecture 18 The EM Algorithm heads coin 1 tails coin 2 Overview Maximum Likelihood Estimation

An Experiment/Some Intuition (Fall 2006): Lecture 18 The EM Algorithm heads coin 1 tails coin 2 Overview Maximum Likelihood Estimation An Experment/Some Intuton I have three cons n my pocket, 6.864 (Fall 2006): Lecture 18 The EM Algorthm Con 0 has probablty λ of heads; Con 1 has probablty p 1 of heads; Con 2 has probablty p 2 of heads

More information

TAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES

TAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES TAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES SVANTE JANSON Abstract. We gve explct bounds for the tal probabltes for sums of ndependent geometrc or exponental varables, possbly wth dfferent

More information

A Robust Method for Calculating the Correlation Coefficient

A Robust Method for Calculating the Correlation Coefficient A Robust Method for Calculatng the Correlaton Coeffcent E.B. Nven and C. V. Deutsch Relatonshps between prmary and secondary data are frequently quantfed usng the correlaton coeffcent; however, the tradtonal

More information

A REVIEW OF ERROR ANALYSIS

A REVIEW OF ERROR ANALYSIS A REVIEW OF ERROR AALYI EEP Laborator EVE-4860 / MAE-4370 Updated 006 Error Analss In the laborator we measure phscal uanttes. All measurements are subject to some uncertantes. Error analss s the stud

More information

Analysis of Discrete Time Queues (Section 4.6)

Analysis of Discrete Time Queues (Section 4.6) Analyss of Dscrete Tme Queues (Secton 4.6) Copyrght 2002, Sanjay K. Bose Tme axs dvded nto slots slot slot boundares Arrvals can only occur at slot boundares Servce to a job can only start at a slot boundary

More information

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family

Using T.O.M to Estimate Parameter of distributions that have not Single Exponential Family IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran

More information

4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA

4 Analysis of Variance (ANOVA) 5 ANOVA. 5.1 Introduction. 5.2 Fixed Effects ANOVA 4 Analyss of Varance (ANOVA) 5 ANOVA 51 Introducton ANOVA ANOVA s a way to estmate and test the means of multple populatons We wll start wth one-way ANOVA If the populatons ncluded n the study are selected

More information

Durban Watson for Testing the Lack-of-Fit of Polynomial Regression Models without Replications

Durban Watson for Testing the Lack-of-Fit of Polynomial Regression Models without Replications Durban Watson for Testng the Lack-of-Ft of Polynomal Regresson Models wthout Replcatons Ruba A. Alyaf, Maha A. Omar, Abdullah A. Al-Shha ralyaf@ksu.edu.sa, maomar@ksu.edu.sa, aalshha@ksu.edu.sa Department

More information

Predictive Analytics : QM901.1x Prof U Dinesh Kumar, IIMB. All Rights Reserved, Indian Institute of Management Bangalore

Predictive Analytics : QM901.1x Prof U Dinesh Kumar, IIMB. All Rights Reserved, Indian Institute of Management Bangalore Sesson Outlne Introducton to classfcaton problems and dscrete choce models. Introducton to Logstcs Regresson. Logstc functon and Logt functon. Maxmum Lkelhood Estmator (MLE) for estmaton of LR parameters.

More information

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U) Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of

More information

CS 2750 Machine Learning. Lecture 5. Density estimation. CS 2750 Machine Learning. Announcements

CS 2750 Machine Learning. Lecture 5. Density estimation. CS 2750 Machine Learning. Announcements CS 750 Machne Learnng Lecture 5 Densty estmaton Mlos Hauskrecht mlos@cs.ptt.edu 539 Sennott Square CS 750 Machne Learnng Announcements Homework Due on Wednesday before the class Reports: hand n before

More information

Probability Theory. The nth coefficient of the Taylor series of f(k), expanded around k = 0, gives the nth moment of x as ( ik) n n!

Probability Theory. The nth coefficient of the Taylor series of f(k), expanded around k = 0, gives the nth moment of x as ( ik) n n! 8333: Statstcal Mechancs I Problem Set # 3 Solutons Fall 3 Characterstc Functons: Probablty Theory The characterstc functon s defned by fk ep k = ep kpd The nth coeffcent of the Taylor seres of fk epanded

More information

Markov chains. Definition of a CTMC: [2, page 381] is a continuous time, discrete value random process such that for an infinitesimal

Markov chains. Definition of a CTMC: [2, page 381] is a continuous time, discrete value random process such that for an infinitesimal Markov chans M. Veeraraghavan; March 17, 2004 [Tp: Study the MC, QT, and Lttle s law lectures together: CTMC (MC lecture), M/M/1 queue (QT lecture), Lttle s law lecture (when dervng the mean response tme

More information

HMMT February 2016 February 20, 2016

HMMT February 2016 February 20, 2016 HMMT February 016 February 0, 016 Combnatorcs 1. For postve ntegers n, let S n be the set of ntegers x such that n dstnct lnes, no three concurrent, can dvde a plane nto x regons (for example, S = {3,

More information

See Book Chapter 11 2 nd Edition (Chapter 10 1 st Edition)

See Book Chapter 11 2 nd Edition (Chapter 10 1 st Edition) Count Data Models See Book Chapter 11 2 nd Edton (Chapter 10 1 st Edton) Count data consst of non-negatve nteger values Examples: number of drver route changes per week, the number of trp departure changes

More information

b ), which stands for uniform distribution on the interval a x< b. = 0 elsewhere

b ), which stands for uniform distribution on the interval a x< b. = 0 elsewhere Fall Analyss of Epermental Measurements B. Esensten/rev. S. Errede Some mportant probablty dstrbutons: Unform Bnomal Posson Gaussan/ormal The Unform dstrbuton s often called U( a, b ), hch stands for unform

More information

Correlation and Regression. Correlation 9.1. Correlation. Chapter 9

Correlation and Regression. Correlation 9.1. Correlation. Chapter 9 Chapter 9 Correlaton and Regresson 9. Correlaton Correlaton A correlaton s a relatonshp between two varables. The data can be represented b the ordered pars (, ) where s the ndependent (or eplanator) varable,

More information

Chapter 7 Channel Capacity and Coding

Chapter 7 Channel Capacity and Coding Chapter 7 Channel Capacty and Codng Contents 7. Channel models and channel capacty 7.. Channel models Bnary symmetrc channel Dscrete memoryless channels Dscrete-nput, contnuous-output channel Waveform

More information

Computation of Higher Order Moments from Two Multinomial Overdispersion Likelihood Models

Computation of Higher Order Moments from Two Multinomial Overdispersion Likelihood Models Computaton of Hgher Order Moments from Two Multnomal Overdsperson Lkelhood Models BY J. T. NEWCOMER, N. K. NEERCHAL Department of Mathematcs and Statstcs, Unversty of Maryland, Baltmore County, Baltmore,

More information

Why Monte Carlo Integration? Introduction to Monte Carlo Method. Continuous Probability. Continuous Probability

Why Monte Carlo Integration? Introduction to Monte Carlo Method. Continuous Probability. Continuous Probability Introducton to Monte Carlo Method Kad Bouatouch IRISA Emal: kad@rsa.fr Wh Monte Carlo Integraton? To generate realstc lookng mages, we need to solve ntegrals of or hgher dmenson Pel flterng and lens smulaton

More information

Rules of Probability

Rules of Probability ( ) ( ) = for all Corollary: Rules of robablty The probablty of the unon of any two events and B s roof: ( Φ) = 0. F. ( B) = ( ) + ( B) ( B) If B then, ( ) ( B). roof: week 2 week 2 2 Incluson / Excluson

More information

Statistical Inference. 2.3 Summary Statistics Measures of Center and Spread. parameters ( population characteristics )

Statistical Inference. 2.3 Summary Statistics Measures of Center and Spread. parameters ( population characteristics ) Ismor Fscher, 8//008 Stat 54 / -8.3 Summary Statstcs Measures of Center and Spread Dstrbuton of dscrete contnuous POPULATION Random Varable, numercal True center =??? True spread =???? parameters ( populaton

More information

Strong Markov property: Same assertion holds for stopping times τ.

Strong Markov property: Same assertion holds for stopping times τ. Brownan moton Let X ={X t : t R + } be a real-valued stochastc process: a famlty of real random varables all defned on the same probablty space. Defne F t = nformaton avalable by observng the process up

More information

6. Stochastic processes (2)

6. Stochastic processes (2) Contents Markov processes Brth-death processes Lect6.ppt S-38.45 - Introducton to Teletraffc Theory Sprng 5 Markov process Consder a contnuous-tme and dscrete-state stochastc process X(t) wth state space

More information

Marginal Effects in Probit Models: Interpretation and Testing. 1. Interpreting Probit Coefficients

Marginal Effects in Probit Models: Interpretation and Testing. 1. Interpreting Probit Coefficients ECON 5 -- NOE 15 Margnal Effects n Probt Models: Interpretaton and estng hs note ntroduces you to the two types of margnal effects n probt models: margnal ndex effects, and margnal probablty effects. It

More information

6. Stochastic processes (2)

6. Stochastic processes (2) 6. Stochastc processes () Lect6.ppt S-38.45 - Introducton to Teletraffc Theory Sprng 5 6. Stochastc processes () Contents Markov processes Brth-death processes 6. Stochastc processes () Markov process

More information

A note on almost sure behavior of randomly weighted sums of φ-mixing random variables with φ-mixing weights

A note on almost sure behavior of randomly weighted sums of φ-mixing random variables with φ-mixing weights ACTA ET COMMENTATIONES UNIVERSITATIS TARTUENSIS DE MATHEMATICA Volume 7, Number 2, December 203 Avalable onlne at http://acutm.math.ut.ee A note on almost sure behavor of randomly weghted sums of φ-mxng

More information

Lecture Notes on Linear Regression

Lecture Notes on Linear Regression Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume

More information

Cathy Walker March 5, 2010

Cathy Walker March 5, 2010 Cathy Walker March 5, 010 Part : Problem Set 1. What s the level of measurement for the followng varables? a) SAT scores b) Number of tests or quzzes n statstcal course c) Acres of land devoted to corn

More information

Economics 130. Lecture 4 Simple Linear Regression Continued

Economics 130. Lecture 4 Simple Linear Regression Continued Economcs 130 Lecture 4 Contnued Readngs for Week 4 Text, Chapter and 3. We contnue wth addressng our second ssue + add n how we evaluate these relatonshps: Where do we get data to do ths analyss? How do

More information

CHAPTER 3: BAYESIAN DECISION THEORY

CHAPTER 3: BAYESIAN DECISION THEORY HATER 3: BAYESIAN DEISION THEORY Decson mang under uncertanty 3 Data comes from a process that s completely not nown The lac of nowledge can be compensated by modelng t as a random process May be the underlyng

More information

Chapter 13: Multiple Regression

Chapter 13: Multiple Regression Chapter 13: Multple Regresson 13.1 Developng the multple-regresson Model The general model can be descrbed as: It smplfes for two ndependent varables: The sample ft parameter b 0, b 1, and b are used to

More information

BIO Lab 2: TWO-LEVEL NORMAL MODELS with school children popularity data

BIO Lab 2: TWO-LEVEL NORMAL MODELS with school children popularity data Lab : TWO-LEVEL NORMAL MODELS wth school chldren popularty data Purpose: Introduce basc two-level models for normally dstrbuted responses usng STATA. In partcular, we dscuss Random ntercept models wthout

More information

Resource Allocation and Decision Analysis (ECON 8010) Spring 2014 Foundations of Regression Analysis

Resource Allocation and Decision Analysis (ECON 8010) Spring 2014 Foundations of Regression Analysis Resource Allocaton and Decson Analss (ECON 800) Sprng 04 Foundatons of Regresson Analss Readng: Regresson Analss (ECON 800 Coursepak, Page 3) Defntons and Concepts: Regresson Analss statstcal technques

More information

Hydrological statistics. Hydrological statistics and extremes

Hydrological statistics. Hydrological statistics and extremes 5--0 Stochastc Hydrology Hydrologcal statstcs and extremes Marc F.P. Berkens Professor of Hydrology Faculty of Geoscences Hydrologcal statstcs Mostly concernes wth the statstcal analyss of hydrologcal

More information

Error Probability for M Signals

Error Probability for M Signals Chapter 3 rror Probablty for M Sgnals In ths chapter we dscuss the error probablty n decdng whch of M sgnals was transmtted over an arbtrary channel. We assume the sgnals are represented by a set of orthonormal

More information

MACHINE APPLIED MACHINE LEARNING LEARNING. Gaussian Mixture Regression

MACHINE APPLIED MACHINE LEARNING LEARNING. Gaussian Mixture Regression 11 MACHINE APPLIED MACHINE LEARNING LEARNING MACHINE LEARNING Gaussan Mture Regresson 22 MACHINE APPLIED MACHINE LEARNING LEARNING Bref summary of last week s lecture 33 MACHINE APPLIED MACHINE LEARNING

More information

CSCE 790S Background Results

CSCE 790S Background Results CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each

More information

Hidden Markov Models

Hidden Markov Models Hdden Markov Models Namrata Vaswan, Iowa State Unversty Aprl 24, 204 Hdden Markov Model Defntons and Examples Defntons:. A hdden Markov model (HMM) refers to a set of hdden states X 0, X,..., X t,...,

More information

Machine learning: Density estimation

Machine learning: Density estimation CS 70 Foundatons of AI Lecture 3 Machne learnng: ensty estmaton Mlos Hauskrecht mlos@cs.ptt.edu 539 Sennott Square ata: ensty estmaton {.. n} x a vector of attrbute values Objectve: estmate the model of

More information