A be a probability space. A random vector

Size: px
Start display at page:

Download "A be a probability space. A random vector"

Transcription

1 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 the dstrbutons that t nduces on the real lne In that development attenton s drected to a sngle number assocated wth each outcome of the basc experment That s the problem focuses on a sngle random varable that descrbes the outcome of the experment In the study of many random experments there are or can be more than one random varable of nterest The outcome of an experment mght be best descrbed usng several numbers and thus there may be a need to defne two or more random varables These numbers may be vewed separately as values of the ndvdual random varables but they may be consdered jontly as elements of a random vector As n the case of a sngle random varable we use fundamental mappng deas to arrve at a jont dstrbuton that descrbes the probablstc behavor of the random vector as well as the probablstc relatons among the random varables n the random vector 11 Jont Dstrbutons 111 The Noton of a Random Vector Def n: Let P A be a probablty space A random vector functon wth doman and counterdoman that s ' s a 1 ( 1 )': such that for any set of real numbers say x1 x x : 1 x1 x x A Def n: In the bvarate case e for = for a probablty space A P we defne a bvarate random vector Y ' to be a functon wth doman and counterdoman that s ( Y)': such that for any par of real numbers say u and v : ( ) u Y( ) v A How s t defned on a Borel set B of the plane? A y A (() Y()) x A = {: (() Y()) B}

2 Statstcs 1: Probablty Theory II 9 As n the one-dmensonal case we may map the probablty from the events on the basc space of the Borel subsets on For example n the dagram above we assgn to regon B (a Borel set) on the plane the probablty mass n event A In a general settng suppose and Y are two real valued functons defned on the probablty space A P For any pont the values of and Y can be represented as an ordered par ( ) Y( ) ' so that ths defnes a functon from to Defnng ths (jont) functon of and Y as Y ' we have a functon ( ( ) ( ) ' For ths functon Y ' be a bvarate random vector t must be that for every Borel set B (a regon Y)': whch maps every nto Y or a pont or an nterval) n the Cartesan plane Y beng a bvarate random vector defned over P Also ' probablty measure Borel sets e : ( ) Y( ) ' B A A nduces a P whch translates probabltes on events to probabltes on : ( ) ( ) ' P Y B P B Remars: 1 The functon Y ' nduces a probablty measure on the Borel subsets B of the Cartesan plane Ths probablty measure denoted by P s a functon wth Y doman B ( )and counterdoman the nterval 01 that s P : B( ) [01] and s defned as P ( B) P : ( Y ' B A smlar probablty measure may be defned for the case of a random vector wth three or more random varables However t wll nvolve more complcated notatons and the geometrc vsualzatons wll be more dffcult 3 For convenence we shall use the notaton Y ' : ( Y ' B Example: u Y v : ( ) u Y( ) v Example: B to represent

3 Statstcs 1: Probablty Theory II Defnton of a Jont Dstrbuton Functon Def n: Let 1 be random varables all defned on the same probablty space A P The jont cumulatve dstrbuton functon (or jont CDF) or smply jont dstrbuton functon of the random varables 1 denoted by F s defned as F 1 or smply 1 F x x x P x x x x x ) 1 x ( 1 x Remars: 1 Thus a jont CDF s a functon wth doman the -dmensonal Eucldean space counterdoman the nterval 01 FY or For = the jont CDF F has doman and counterdoman and 01 In ths case the jont CDF s smply an extenson of the noton of a dstrbuton functon n the unvarate case Whereas we use the nfnte nterval x to defne the CDF n the unvarate case we shall use the nfnte rectangle where B uv ( x y)' R : x u y v Also ( x y)' R : x u ( x y)' R : y v B uv uv F u v P B Y P ) Y ( ) ' B P ) u Y ( ) v P u Y v uv B uv n the bvarate case 1 Suppose we are to toss a balanced con twce and we defne the followng random varables: = number of heads on the 1 st toss Y = number of heads on the nd toss What s the jont CDF of and Y? Consder the experment of tossng two tetrahedra (regular 4-sded polyhedron) each wth sdes labeled 1 to 4 Defne the followng random varables: = the number on the downturned face of the 1 st tetrahedron Y = the larger of the two downturned numbers What s the jont CDF of and Y?

4 Statstcs 1: Probablty Theory II Propertes of Jont Dstrbuton Functons Let F be the jont CDF of two random varables and Y 1 Boundedness: F v lm F u v 0 Thus Proof: Y Y u F u lm F u v 0 Y Y v F lm F u v 1 Y u Y v ( u v) R FY u v 0 1 Monotoncty: If a b c d are any real numbers a b c d R a b and c d then P a b c Y d F b d F b c F a d F a c 0 Y Y Y Y Note: The result s analogous to P(a< b) = F(b) F(a) n the unvarate case Proof: 3 Contnuty from the Rght: F s contnuous from the rght n each of the varables That s for any fxed x F s contnuous from the rght n Y and for any fxed y the rght n That s lm F u h v F u v F u v Proof: h0 h0 Y Y Y lm F u v h F u v F u v Y Y Y Remars: 1 The boundedness property does not mply that F v lm F u v 1 nor Y Y u F u lm F u v 1 Y Y v Both arguments must be nfnte for F to converge to 1 F s contnuous from The monotoncty property s not a strct monotoncty However F s a monotone non-decreasng functon n each of the varables That s for any fxed x F s non-decreasng n Y and for any fxed y F s non-decreasng n For a fxed x y y F x y F x y Proof: For a fxed 1 Y 1 Y y x x F x y F x y 1 Y 1 Y

5 Statstcs 1: Probablty Theory II 1 3 The rght contnuty property mples the ff: For any fxed constants a b c d R a b and c d Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y P a bc Y d F bd F bc F a d F a c P a bc Y d F b d F b c F a d F a c P a bc Y d F b d F b c F ad F ac P b Y d F bd F b d F bd F b d Note that F Y ( b d ) lm F Y ( b d h) lm F Y ( b d h) h 0 4 If h0 F s contnuous at the pont (bd) n one of the varables then P b Y d (The proof s easy) Thus f P b Y d 0 h0 0 then F must be dscontnuous at the pont (bd) Hence f we want to locate the ponts (bd) at whch P b Y d 0 then we need only to consder those ponts at whch F s dscontnuous e those ponts at whch the functon F jumps 1 Whch of the followng functons do not represent a genune jont CDF? 1 exp x y x 0 and y 0 a FY x y 0 elsewhere b F x y c F x y 1 exp x y x 0 and y 0 0 elsewhere 1 x y0 0 elsewhere Suppose that the jont CDF of the random varables and Y s gven by: 0 x or y 5 3 x and 5 y 3 8 F 1 Y x y x and 5 y 3 1 x and y 3 1 x and y 3 Determne the ponts probabltes at these ponts bd for whch P b Y d 0 and evaluate the

6 Statstcs 1: Probablty Theory II Classfcaton of Jont (Cumulatve) Dstrbuton Functons The classfcaton of the jont dstrbuton functons s carred out on the bass of the nature of the jont dstrbuton functon dscrete and (absolutely) contnuous However the two do not exhaust all the possble cases: t s possble to have bvarate dstrbutons whch are absolutely contnuous n one varable and dscrete n the other 1141 Dscrete Jont Dstrbutons Def n: Gven a probablty space A P a -dmensonal random vector 1 ' s defned to be a -dmensonal dscrete random vector f and only f t can assume values only at a countable number of ponts x x x n the - dmensonal Eucldean space Def n: If 1 ' s a -dmensonal dscrete random vector then the jont probablty mass functon (or jont PMF) or jont dscrete densty functon of the random varables 1 denoted by p or p s defned 1 as p x p 1 x 1 x x P 1 x1 x x ( )' s a possble value of ' where x x1 x x be 0 otherwse ( ) 0 1 (jont probablty functon n general even for later on contnuous random vectors) 1 ; and s defned to 4 The collecton of all ponts x ( x1 x x )' for whch the jont PMF s strctly greater p ( x) p x x x 0 s called the set of mass ponts than zero e 1 1 of the dscrete random vector 1 ' Remars: 1 The random varables 1 are referred to as jontly dscrete random varables Alternatvely we can defne the jont PMF p ( x) p 1 x1 x x functon from nto the nterval 01 satsfyng the followng: a 1 b p x p x x x as a p ( x) p x x x 0 x ( x x x )' 1 1 ( ) where the summaton s taen over the set of mass ponts of 3 As n the unvarate case we can obtan the jont CDF of a dscrete random vector from ts jont PMF and vce versa For the bvarate case we have

7 Statstcs 1: Probablty Theory II 14 FY ( u v) P( u Y v) P( x Y y) xu yv py ( a b) P( a Y b) F ( a b) F ( a b) F ( a b ) F ( a b ) Y Y Y Y Theorem: If and Y are jontly dscrete random varables then nowledge of F Y ( ) s equvalent to nowledge of p Y ( ) Also the statement extends to -dmensonal dscrete random vector Proof: (Assgnment) 1 Suppose that we are to toss a balanced con twce and we defne the followng random varables: = the number of heads on the 1 st toss Y = the number of heads on the nd toss What s the jont PMF of and Y? Consder the experment of tossng two tetrahedra each wth sdes labeled 1 to 4 Defne the followng varables: = the number on the downturned face of the 1 st tetrahedron Y = the larger of the two downturned numbers What s the jont PMF of and Y? 3 Suppose that the jont PMF of the random varables and Y s gven by the table below Fnd the jont CDF of and Y What s the probablty that Y? Y /1 /1 1/1 0 3 /1 1/1 0 1/ /1 /1 1/1 4 Suppose that the jont PMF of the random varables and Y s gven by the formula: P( x Y y) ( x y ) x 1013 and y 13 Fnd the value of the constant What s the probablty that 0? Y

8 Statstcs 1: Probablty Theory II Some Specal (Dscrete) Multvarate Dstrbutons A Multnomal Dstrbuton Def n: A Multnomal experment s one that possesses the followng propertes: a The experment conssts of n repeated trals b Each tral can result n any one of the (+1) dstnct possble outcomes denoted by E1 E E 1 c The probablty of the th possble outcome E s P( E ) p 1 1 d The repeated trals are ndependent Def n: If n a Multnomal experment denotes the number of trals (out of n) that result n the outcome E 1 1 then the random varables 1 (excludng 1 ) are sad to have a Multnomal dstrbuton wth jont PMF: n x1 x x1 p1 ( x1 x x ; 1 ) p p p n p1 p p 1 x1 x x 1 wth 1 1 x n and p Remars: 1 The Bnomal experment becomes a Multnomal experment f each tral can have more than possble outcomes The PMF of the Multnomal Dstrbuton gves the probablty that the outcome E 1 occurs exactly x 1 tmes the outcome E occurs exactly x tmes and so on up to the (+1) th outcome occurs exactly x 1 tmes n the n ndependent trals 3 The Multnomal dstrbuton has (+1) parameters: n p1 p p The quantty p 1 le q n the Bnomal dstrbuton s exactly determned by p 1 1 p 1 p p 4 If 1 has a Multnomal dstrbuton then each s Bnomally dstrbuted e B( n p ) 1 If a par of dce s tossed sx tmes what s the probablty of obtanng a total of 7 or 11 twce and a matchng par once? A certan devce can fal n any one of three possble mutually exclusve ways The probablty that t wll fal n the 1 st way s p1 03 and the probablty that t wll fal n the nd way s p 05 Ten devces are receved for servce The devces can be

9 Statstcs 1: Probablty Theory II 16 assumed to have faled ndependently of each other What s the probablty that there wll be 4 falures of the 1 st nd and 3 falures of the nd nd? B Generalzed Hypergeometrc Dstrbuton Def n: A generalzed Hypergeometrc experment s one that possesses the followng propertes: a A sample of sze n s taen randomly wthout replacement from a populaton wth N elements b N 1 of the N populaton elements are of 1 nd N of the N populaton elements are of a nd nd and so on and the N +1 of the N populaton elements are of a (+1) th nd Def n: If n a generalzed Hypergeometrc experment denotes the number of sample th elements that are of the nd 1 1 then the random varables 1 (excludng 1) are sad to have a generalzed Hypergeometrc dstrbuton wth jont PMF: N1 N N 1 x1 x x 1 p1 ( x1 x x ; 1 ) N N N N n N n wth 1 1 x n and N N 1 1 Remars: 1 The Hypergeometrc experment n whch each element of the populaton can be classfed as ether a success or falure becomes a generalzed Hypergeometrc experment f each element of the populaton can be classfed nto more than nds The PMF of the generalzed Hypergeometrc dstrbuton gves the probablty that n the sample there wll be exactly x 1 samples of the 1 st nd exactly x sample elements of the nd nd and so on and exactly x 1 sample elements of the (+1) th nd 3 The generalzed Hypergeometrc dstrbuton has (+) parameters: N N1 N N n The quantty N 1 s exactly determned by N 1 N N 1 N N 4 If 1 has a generalzed Hypergeometrc dstrbuton then each s unvarate Hypergeometrc e Hyp( N n N ) 1 Two reflls of a ballpont pen are selected at random from a box that contans 3 blue red and 3 green reflls If denotes the number of blue reflls selected and Y denotes the

10 Statstcs 1: Probablty Theory II 17 number of red reflls selected fnd the jont PMF of and Y Fnd the probablty that the total number of blue and red reflls selected s less than Three cards are drawn wthout replacement from the 1 face cards (jacs queens or ngs) of an ordnary dec of playng cards If denotes the number of ngs selected and Y denotes the number of jacs selected fnd the jont PMF of and Y Fnd the probablty that the total number of ngs and jacs selected s at least 1143 (Absolutely) Contnuous Jont Dstrbutons Def n: Gven a probablty space A P a -dmensonal random vector 1 ' a postve nteger s defned to be a (-dmensonal absolutely) contnuous random vector f and only f there exsts a nonnegatve functon denoted f ( ) or f () such that for any x x1 x x ' 1 x x1 x1 ( ) 1 ( 1 ) 1 F x f u u u du du du Def n: If ' s a -dmensonal contnuous random vector then the 1 nonnegatve functon f 1 ( ) s called the jont probablty densty functon (or jont PDF) of the random varables 1 Remars: 1 The random varables 1 are referred to as jontly (absolutely) contnuous random varables Alternatvely we can defne the jont PDF f ( x) f 1 ( x1 x x ) as a functon from nto the postve real lne satsfyng the followng: f ( ) f ( x x x ) 0 x ( x x x ) a x f ( x x x ) dx dx dx 1 b As n the unvarate case we can obtan the jont CDF of a contnuous random vector from ts jont PDF and vce versa For the bvarate case we have F ( u v ) P ( u v u Y v ) f ( x y ) dxdy f F ( x y) ( x y) xy ponts (xy) where F s dfferentable

11 Statstcs 1: Probablty Theory II 18 v u 4 The followng results are mmedate from F Y ( u v) f Y ( x y) dxdy a f ( x y) dxdy 1 Proof: Y b P ( a b d b c Y d ) f ( x y ) dxdy c a Proof: : 5 Whle probabltes are represented as areas n the case of a contnuous unvarate random varable for a contnuous bvarate random vector probabltes are represented as volumes That s If s a contnuous random varable wth PDF f then P( a b) can be vewed as the area under the curve f ( x ) above the -axs and between the ponts a and b Smlarly f ( )' s a bvarate contnuous random vector wth jont PDF f then P( a b c Y d) can be vewed as the volume under the surface (or plane) f ( x y ) above the -Y plane and wthn the rectangle wth vertces a b c and d Y 6 The jont PDF represents the lmt of the rato of the amount of probablty n a rectangle to the area of the rectangle as the area goes to zero (e as the sdes of the rectangle shrn to zero) Hence the jont PDF reflects how densely the probablty mass s spread over the plane ( ) x y F x y F( x h y ) F( x y ) F( x h y) F( x y) = lm 0 0 h = h P( x x h y Y y ) lm 0 0 h h 7 The jont PDF does not represent a probablty e f ( x y) P( x Y y) The jont PDF f ( x y ) gves the heght (or smply the value) of the functon f at the pont ( ) xy 8 If h and are small then we have P(x<x+h y<yy+) = h f(x y) Y

12 Statstcs 1: Probablty Theory II 19 1 Let and Y be jontly contnuous random varables wth jont PDF gven by: f ( x y) exp x y I ( x) I ( y) (0 ) (0 ) a Determne the jont CDF F b Fnd P( Y ) c Fnd P( Y) d Fnd P( 1 Y ) Let and Y be jontly contnuous random varables wth jont PDF gven by: f ( x y) ( x y) I ( x) I ( y) (01) (01) a Fnd the constant b Fnd P 1 Y Two random varables and Y are sad to be jontly unformly dstrbuted over (01) f and only f ther jont PDF s gven by: f ( x y) I ( x) I ( y) (01) (01) a Fnd P( Y 1) b Fnd P(1 3 Y 3 ) c Fnd P( Y) 4 A candy company dstrbutes boxes of chocolates wth a mxture of creams toffees and cordals Suppose that the weght of each box s 1 logram but the ndvdual weghts of the creams toffees and cordals vary from box to box For a randomly selected box let and Y represent the weghts of the creams and the toffees respectvely and suppose that and Y are jontly contnuous random varables wth the jont PDF gven by: f ( x y) 4 xyi ( x) I ( y) x y 1 [01] [01] Fnd the probablty that for a gven box the cordals account more than half the weght of the box 5 Let and Y be jontly contnuous random varables wth jont PDF gven by: f ( x y) 4 xyi ( x) I ( y) (01) (01) Fnd the jont CDF of and Y

13 Statstcs 1: Probablty Theory II 0 6 Let and Y be jontly contnuous random varables wth jont PDF gven by: f ( x y) 4 y(1 x) I ( y) I ( x) Y (0 x) (01) a Fnd P( Y) b Fnd P( Y) c Fnd P(1/ 3 1/ Y 1/ ) d Fnd PY ( 1/ ) e Fnd P(1/ 3 1/ ) f Fnd P(1/ 3 1/ ) ( Y 1/ ) 7 Let and Y be jontly contnuous random varables wth jont CDF gven by: 0 x 0 or y 0 1 ( x y xy ) 0 x1 0 y1 1 FY ( x y) ( x x) 0 x 1 y 1 1 x1 0 y1 ( y y) 1 x1 x1 Fnd the jont PDF of and Y 1144 Some Specal (Contnuous) Multvarate Dstrbutons A Bvarate Unform Dstrbuton Def n: A bvarate contnuous random vector ( )' s sad to have a Bvarate Unform dstrbuton over the regon A f and only f the jont PDF of and Y s gven by: f ( x y) ( x y) A 0 otherwse where 1 area of A Remars: 1 The constant s chosen so that the total volume under the surface f and above the Y Cartesan plane s equal to 1 e f ( x y) dxdy 1 The constant gves the heght of the functon f at a partcular pont ( x y) A Geometrcally the Bvarate Unform dstrbuton over the regon A can be represented by the (flat) surface Z f ( x y) whch generates a cylndrcal sold wth the Y regon A as ts base as ts heght and the plane Z= as ts top

14 Statstcs 1: Probablty Theory II 1 3 The regon A s a subset of or any regon n the -Y plane It may tae any shape but commonly t s a rectangle n the -Y plane 1 Let and Y be two contnuous random varables that are jontly Unformly dstrbuted over the unt square What s the jont PDF of and Y? Fnd P( Y 1/ ) Let and Y be jontly contnuous random varables wth jont PDF gven below Fnd P( 31 Y 3/ ) f 1 ( x y) I(4) ( x) I(1) ( y) 3 Let and Y be jontly contnuous random varables havng a Bvarate Unform dstrbuton over a crcle centered at the orgn and wth radus equal to 1 a Fnd the jont PDF of and Y b Fnd P(0 1/ 0 Y 1/ ) c Fnd P( Y) B Bvarate Normal Dstrbuton Def n: A bvarate contnuous random vector ( )' s sad to have a Bvarate Normal dstrbuton f and only f the jont PDF of and Y s gven by: f 1 1 x x y Y y Y ( x y) exp (1 ) Y Y Y 1 where Y Y and are constants such that: We wrte Y Y Y Y ( Y)' BVN ( ) Remars: 1 The total volume under the surface generated by the Bvarate Normal PDF f and Y above the -Y plane s equal to 1 e f ( x y) dxdy 1 For any pont ( xy ) the computed value of the jont PDF s the heght of the functon at that pont Geometrcally the Bvarate Normal dstrbuton can be represented by a bellshaped surface Z f ( x y) whch generates a bell-shaped sold floatng above the Y

15 Statstcs 1: Probablty Theory II Y plane A horzontal cross-secton of ths sold s an ellptc curve whle a vertcal cross-secton of the sold s a (unvarate) Normal curve 3 The Bvarate Normal dstrbuton has 5 parameters: Y Y and Example: Let and Y be jontly contnuous random varables havng a Bvarate Normal dstrbuton wth parameters Y 0 Y 1 and 0 Fnd the jont PDF of and Y What s the probablty that and Y are both less than? 1 Margnal Dstrbutons Def n: Gven a probablty space a -dmensonal random vector ( 1 )' wth jont dstrbuton F () or F 1 ( ) For some 1 the margnal (cumulatve) dstrbuton functon (or margnal CDF) of denoted F ( ) s defned as: F ( x ) lm F ( x x x x ) all x 1 1 j j F ( x ) 1 Remars: 1 For the bvarate case f and Y have jont CDF F the margnal dstrbutons (margnal CDFs) of and Y are gven by: F ( x) lm F ( x y) F ( x ) Y Y y F ( y) lm F ( x y) F ( y) Y Y Y x In general the jont dstrbuton of any sub-vector of a random vector 1 ' s obtaned from the dstrbuton of by allowng the arguments NOT correspondng to the sub-vector to tend to nfnty For nstance the jont dstrbuton of ( Z )' s obtaned from the jont dstrbuton of ( Y Z )' as: F ( x z) F ( x z) Z Y Z a Let ' be a random vector wth jont CDF F ( x ) F ( x ) F ( x x ) F ( x x ) F

16 Statstcs 1: Probablty Theory II 3 b Let ' be a random vector wth jont CDF F ( x ) F ( x ) F ( x x ) F ( x x ) F ( x x x ) F ( x x x ) Although nowledge of the dstrbuton of F ' s suffcent to determne the jont dstrbuton of any sub-vector of ncludng the margnal dstrbutons of the s the converse s not true That s the margnal dstrbutons are unquely determned from the jont dstrbuton but nowledge of the margnal dstrbuton s NOT suffcent to determne the jont dstrbuton (See example below) 1 Fnd the margnal dstrbuton of the random varables and Y f ther jont dstrbuton s gven by: 0 x 0 or y 0 y y FY ( x y) 1 e e x y y 0 x ( x y) y 1 e e e x 0 y x Consder the followng jont dstrbutons and show that both wll gve rse to the same set of margnal dstrbutons of and Y 0 x 0 or y xy x y 0 x 1 0 y (1) FY ( x y) x x 0 x 1 y y y x 1 0 y x1 y1 0 x 0 or y x x y Y 0 x 1 0 y () FY ( x y) x x 0 x 1 y y y x 1 0 y x1 y1

17 Statstcs 1: Probablty Theory II 4 11 Dscrete Case Def n: Gven a -dmensonal dscrete random vector 1 ' wth jont PMF p () or p 1 ( ) For some 1 the margnal probablty mass functon (or margnal PMF) of denoted p () s defned as: p ( x ) p ( x x x x ) 1 1 where the summaton s taen wth respect to all j j Remars: 1 For the bvarate case f and Y have jont PMF p the margnal PMFs of and Y are gven by p ( u) p Y ( u y) all mass pts of Y py ( v) p Y ( x v) all mass pts of Thus for a dscrete random vector ( )' the margnal PMF of each random varable s found by summng the jont probabltes over all mass ponts of the random varable If the jont PMF of and Y s expressed as a table wth the rows and columns representng the mass ponts of and the mass ponts of Y respectvely the totals n the horzontal and vertcal margns wll rse to the margnal PMFs Hence the name margnal dstrbutons Y Y y1 x x Y y j Y y p ( x ) p ( x y ) py ( x1 y ) p Y ( x1 y j ) p ( x 1) 1 p ( x y ) py ( x y ) p Y ( x y j ) p ( x ) x Y 1 p ( x y ) p Y ( x y ) p Y ( x y j ) p ( x ) py ( y ) py ( y 1) py ( y ) py( y j) 1 In general the jont PMF of any sub-vector of a dscrete random vector s obtaned from the dstrbuton of by summng (over the set of mass ponts) the jont PMF wth respect to the varables NOT correspondng to the sub-vector For nstance the jont PMF of ( Z )' s obtaned from the jont PMF of ( W Y Z )' as: p ( x z) p ( w x y z) Z W Y Z all y all w

18 Statstcs 1: Probablty Theory II 5 3 If ( 1 )' s a dscrete random vector the jont PMF of any sub-vector of ncludng the margnal PMFs of the ' s can be obtaned from the jont PMF of the entre random vector ( 1 )' but not conversely 1 Fnd the margnal PMFs of and Y f ther jont PMF s gven by: p ( ) ( x y) x y x 14 and y Consder the experment of tossng two tetrahedra (regular four sded polygon) each wth sdes labeled 1 to 4 Defne the followng varables: = the number on the downturned face of the 1 st tetrahedron Y = the larger of the two downturned numbers Recall the jont PMF of and Y s gven below Y Y 1 Y Y 3 Y 4 p ( x ) 1 1/16 1/16 1/16 1/16 0 /16 1/16 1/ /16 1/ /16 p ( y ) Y Fnd the margnal PMFs of and Y 3 Fnd the margnal PMFs of and Y assumng that and Y are jontly Trnomally dstrbuted wth parameters n p1 p 1 (Absolutely) Contnuous Case Def n: Gven a -dmensonal (absolutely) contnuous random vector ( 1 )' wth jont PDF f () or f ( ) 1 For some 1 the margnal probablty densty functon (or margnal PDF) of denoted f () s defned as : f ( x ) f ( x x x ) dx dx dx dx dx where the ntegrals are taen over the entre real lne

19 Statstcs 1: Probablty Theory II 6 Remars: 1 For the bvarate case f and Y have jont PDF f the margnal PDFs of and Y are gven by: f ( x) f Y ( x y) dy fy ( y) f Y ( x y) dx Thus for a contnuous random vector ( )' the margnal PDF of each random varable s found by ntegratng (over ) the jont PDF wth respect to the other random varable In general the jont PDF of any sub-vector of a contnuous random vector s obtaned from the dstrbuton of by ntegratng (over ) the jont PDF wth respect to the varables NOT correspondng to the sub-vector For nstance the jont PDF of ( Z )' s obtaned from the jont PDF of ( W Y Z )' as: f ( x z) f ( w x y z) dwdy Z W Y Z 3 If ( 1 )' s a contnuous random vector the jont PDF of any sub-vector of ncludng the margnal PDFs of the ' s can be obtaned from the jont PDF of the entre random vector ( 1 )' but not conversely 4 If and Y are jontly contnuous random varables then and Y are each contnuous But f and Y are contnuous the vector ( )' may not be jontly contnuous 1 Fnd the margnal PDFs of and Y f ther jont PDF s gven by: f ( x y) ( x y) I ( x) I ( y) (01) (01) Fnd the margnal PDFs of and Y f ther jont PDF s gven by: f ( x y) I ( y) I ( x) Y ( x x) (01) 3 Fnd the margnal PDFs of and Y f ther jont PDF s a Bvarate Normal Dstrbuton wth parameters 0 1 and Y Y 4 Fnd the margnal PDFs of and Y f ther jont PDF s gven by: 5 x y 0 x 1 and x y f ( x y) 6 x 0 x 1 and x y 0 ow 5 Fnd the margnal PDFs of and Y and P ( 1/ ) f ther jont PDF s gven by: f ( x y) 6/ 7 1 x y I ( x) I ( y) (01) (01)

20 Statstcs 1: Probablty Theory II 7 6 Fnd the margnal PDFs of and Y and PY ( 3/ 4) f ther jont PDF s gven by: f ( x y) 10 xy 0 0 y x1 ow 7 Consder the followng jont PDFs and show that both wll gve rse to the same set of margnal PDFs for and Y (1) f ( x y) 1/ 4 1 xy I ( x) I ( y) [ 11] [ 11] () [ 11] [ 11] f ( x y) 1/ 4 I ( x) I ( y)

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

More metrics on cartesian products

More metrics on cartesian products More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of

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

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

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

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

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

Probability and Random Variable Primer

Probability and Random Variable Primer 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

More information

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

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

APPENDIX A Some Linear Algebra

APPENDIX A Some Linear Algebra APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,

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

Affine transformations and convexity

Affine transformations and convexity Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/

More information

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could

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

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity

Week3, Chapter 4. Position and Displacement. Motion in Two Dimensions. Instantaneous Velocity. Average Velocity Week3, Chapter 4 Moton n Two Dmensons Lecture Quz A partcle confned to moton along the x axs moves wth constant acceleraton from x =.0 m to x = 8.0 m durng a 1-s tme nterval. The velocty of the partcle

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

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

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

Composite Hypotheses testing

Composite Hypotheses testing Composte ypotheses testng In many hypothess testng problems there are many possble dstrbutons that can occur under each of the hypotheses. The output of the source s a set of parameters (ponts n a parameter

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

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

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

Stat 642, Lecture notes for 01/27/ d i = 1 t. n i t nj. n j

Stat 642, Lecture notes for 01/27/ d i = 1 t. n i t nj. n j Stat 642, Lecture notes for 01/27/05 18 Rate Standardzaton Contnued: Note that f T n t where T s the cumulatve follow-up tme and n s the number of subjects at rsk at the mdpont or nterval, and d s the

More information

NP-Completeness : Proofs

NP-Completeness : Proofs NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem

More information

2.3 Nilpotent endomorphisms

2.3 Nilpotent endomorphisms s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms

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

Lecture 12: Discrete Laplacian

Lecture 12: Discrete Laplacian Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly

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

The Second Anti-Mathima on Game Theory

The Second Anti-Mathima on Game Theory The Second Ant-Mathma on Game Theory Ath. Kehagas December 1 2006 1 Introducton In ths note we wll examne the noton of game equlbrum for three types of games 1. 2-player 2-acton zero-sum games 2. 2-player

More information

20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The first idea is connectedness.

20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The first idea is connectedness. 20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The frst dea s connectedness. Essentally, we want to say that a space cannot be decomposed

More information

COMPLEX NUMBERS AND QUADRATIC EQUATIONS

COMPLEX NUMBERS AND QUADRATIC EQUATIONS COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not

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

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

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

Appendix B. Criterion of Riemann-Stieltjes Integrability

Appendix B. Criterion of Riemann-Stieltjes Integrability Appendx B. Crteron of Remann-Steltes Integrablty Ths note s complementary to [R, Ch. 6] and [T, Sec. 3.5]. The man result of ths note s Theorem B.3, whch provdes the necessary and suffcent condtons for

More information

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,

More information

Complete subgraphs in multipartite graphs

Complete subgraphs in multipartite graphs Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G

More information

Chapter Twelve. Integration. We now turn our attention to the idea of an integral in dimensions higher than one. Consider a real-valued function f : D

Chapter Twelve. Integration. We now turn our attention to the idea of an integral in dimensions higher than one. Consider a real-valued function f : D Chapter Twelve Integraton 12.1 Introducton We now turn our attenton to the dea of an ntegral n dmensons hgher than one. Consder a real-valued functon f : R, where the doman s a nce closed subset of Eucldean

More information

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0 MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector

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

Another converse of Jensen s inequality

Another converse of Jensen s inequality Another converse of Jensen s nequalty Slavko Smc Abstract. We gve the best possble global bounds for a form of dscrete Jensen s nequalty. By some examples ts frutfulness s shown. 1. Introducton Throughout

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

Spectral Graph Theory and its Applications September 16, Lecture 5

Spectral Graph Theory and its Applications September 16, Lecture 5 Spectral Graph Theory and ts Applcatons September 16, 2004 Lecturer: Danel A. Spelman Lecture 5 5.1 Introducton In ths lecture, we wll prove the followng theorem: Theorem 5.1.1. Let G be a planar graph

More information

Structure and Drive Paul A. Jensen Copyright July 20, 2003

Structure and Drive Paul A. Jensen Copyright July 20, 2003 Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.

More information

REAL ANALYSIS I HOMEWORK 1

REAL ANALYSIS I HOMEWORK 1 REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α

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

x = , so that calculated

x = , so that calculated Stat 4, secton Sngle Factor ANOVA notes by Tm Plachowsk n chapter 8 we conducted hypothess tests n whch we compared a sngle sample s mean or proporton to some hypotheszed value Chapter 9 expanded ths to

More information

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars

More information

PES 1120 Spring 2014, Spendier Lecture 6/Page 1

PES 1120 Spring 2014, Spendier Lecture 6/Page 1 PES 110 Sprng 014, Spender Lecture 6/Page 1 Lecture today: Chapter 1) Electrc feld due to charge dstrbutons -> charged rod -> charged rng We ntroduced the electrc feld, E. I defned t as an nvsble aura

More information

Linear Regression Analysis: Terminology and Notation

Linear Regression Analysis: Terminology and Notation ECON 35* -- Secton : Basc Concepts of Regresson Analyss (Page ) Lnear Regresson Analyss: Termnology and Notaton Consder the generc verson of the smple (two-varable) lnear regresson model. It s represented

More information

8.1 Arc Length. What is the length of a curve? How can we approximate it? We could do it following the pattern we ve used before

8.1 Arc Length. What is the length of a curve? How can we approximate it? We could do it following the pattern we ve used before .1 Arc Length hat s the length of a curve? How can we approxmate t? e could do t followng the pattern we ve used before Use a sequence of ncreasngly short segments to approxmate the curve: As the segments

More information

Joint Statistical Meetings - Biopharmaceutical Section

Joint Statistical Meetings - Biopharmaceutical Section Iteratve Ch-Square Test for Equvalence of Multple Treatment Groups Te-Hua Ng*, U.S. Food and Drug Admnstraton 1401 Rockvlle Pke, #200S, HFM-217, Rockvlle, MD 20852-1448 Key Words: Equvalence Testng; Actve

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

χ x B E (c) Figure 2.1.1: (a) a material particle in a body, (b) a place in space, (c) a configuration of the body

χ x B E (c) Figure 2.1.1: (a) a material particle in a body, (b) a place in space, (c) a configuration of the body Secton.. Moton.. The Materal Body and Moton hyscal materals n the real world are modeled usng an abstract mathematcal entty called a body. Ths body conssts of an nfnte number of materal partcles. Shown

More information

Maximizing the number of nonnegative subsets

Maximizing the number of nonnegative subsets Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum

More information

Exercise Solutions to Real Analysis

Exercise Solutions to Real Analysis xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there

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

Notes on Frequency Estimation in Data Streams

Notes on Frequency Estimation in Data Streams Notes on Frequency Estmaton n Data Streams In (one of) the data streamng model(s), the data s a sequence of arrvals a 1, a 2,..., a m of the form a j = (, v) where s the dentty of the tem and belongs to

More information

Edge Isoperimetric Inequalities

Edge Isoperimetric Inequalities November 7, 2005 Ross M. Rchardson Edge Isopermetrc Inequaltes 1 Four Questons Recall that n the last lecture we looked at the problem of sopermetrc nequaltes n the hypercube, Q n. Our noton of boundary

More information

Vapnik-Chervonenkis theory

Vapnik-Chervonenkis theory Vapnk-Chervonenks theory Rs Kondor June 13, 2008 For the purposes of ths lecture, we restrct ourselves to the bnary supervsed batch learnng settng. We assume that we have an nput space X, and an unknown

More information

STATISTICAL MECHANICS

STATISTICAL MECHANICS STATISTICAL MECHANICS Thermal Energy Recall that KE can always be separated nto 2 terms: KE system = 1 2 M 2 total v CM KE nternal Rgd-body rotaton and elastc / sound waves Use smplfyng assumptons KE of

More information

F statistic = s2 1 s 2 ( F for Fisher )

F statistic = s2 1 s 2 ( F for Fisher ) Stat 4 ANOVA Analyss of Varance /6/04 Comparng Two varances: F dstrbuton Typcal Data Sets One way analyss of varance : example Notaton for one way ANOVA Comparng Two varances: F dstrbuton We saw that the

More information

ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM

ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM ELASTIC WAVE PROPAGATION IN A CONTINUOUS MEDIUM An elastc wave s a deformaton of the body that travels throughout the body n all drectons. We can examne the deformaton over a perod of tme by fxng our look

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

a b a In case b 0, a being divisible by b is the same as to say that

a b a In case b 0, a being divisible by b is the same as to say that Secton 6.2 Dvsblty among the ntegers An nteger a ε s dvsble by b ε f there s an nteger c ε such that a = bc. Note that s dvsble by any nteger b, snce = b. On the other hand, a s dvsble by only f a = :

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

Complex Numbers Alpha, Round 1 Test #123

Complex Numbers Alpha, Round 1 Test #123 Complex Numbers Alpha, Round Test #3. Wrte your 6-dgt ID# n the I.D. NUMBER grd, left-justfed, and bubble. Check that each column has only one number darkened.. In the EXAM NO. grd, wrte the 3-dgt Test

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

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples

More information

Problem Set 9 Solutions

Problem Set 9 Solutions Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem

More information

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS

BOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all

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

XII.3 The EM (Expectation-Maximization) Algorithm

XII.3 The EM (Expectation-Maximization) Algorithm XII.3 The EM (Expectaton-Maxzaton) Algorth Toshnor Munaata 3/7/06 The EM algorth s a technque to deal wth varous types of ncoplete data or hdden varables. It can be appled to a wde range of learnng probles

More information

10-801: Advanced Optimization and Randomized Methods Lecture 2: Convex functions (Jan 15, 2014)

10-801: Advanced Optimization and Randomized Methods Lecture 2: Convex functions (Jan 15, 2014) 0-80: Advanced Optmzaton and Randomzed Methods Lecture : Convex functons (Jan 5, 04) Lecturer: Suvrt Sra Addr: Carnege Mellon Unversty, Sprng 04 Scrbes: Avnava Dubey, Ahmed Hefny Dsclamer: These notes

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

Credit Card Pricing and Impact of Adverse Selection

Credit Card Pricing and Impact of Adverse Selection Credt Card Prcng and Impact of Adverse Selecton Bo Huang and Lyn C. Thomas Unversty of Southampton Contents Background Aucton model of credt card solctaton - Errors n probablty of beng Good - Errors n

More information

Lecture 3. Ax x i a i. i i

Lecture 3. Ax x i a i. i i 18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest

More information

Math1110 (Spring 2009) Prelim 3 - Solutions

Math1110 (Spring 2009) Prelim 3 - Solutions Math 1110 (Sprng 2009) Solutons to Prelm 3 (04/21/2009) 1 Queston 1. (16 ponts) Short answer. Math1110 (Sprng 2009) Prelm 3 - Solutons x a 1 (a) (4 ponts) Please evaluate lm, where a and b are postve numbers.

More information

Random Walks on Digraphs

Random Walks on Digraphs Random Walks on Dgraphs J. J. P. Veerman October 23, 27 Introducton Let V = {, n} be a vertex set and S a non-negatve row-stochastc matrx (.e. rows sum to ). V and S defne a dgraph G = G(V, S) and a drected

More information

U-Pb Geochronology Practical: Background

U-Pb Geochronology Practical: Background U-Pb Geochronology Practcal: Background Basc Concepts: accuracy: measure of the dfference between an expermental measurement and the true value precson: measure of the reproducblty of the expermental result

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

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

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

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:

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

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class

More information

Modelli Clamfim Equazione del Calore Lezione ottobre 2014

Modelli Clamfim Equazione del Calore Lezione ottobre 2014 CLAMFIM Bologna Modell 1 @ Clamfm Equazone del Calore Lezone 17 15 ottobre 2014 professor Danele Rtell danele.rtell@unbo.t 1/24? Convoluton The convoluton of two functons g(t) and f(t) s the functon (g

More information

Curvature and isoperimetric inequality

Curvature and isoperimetric inequality urvature and sopermetrc nequalty Julà ufí, Agustí Reventós, arlos J Rodríguez Abstract We prove an nequalty nvolvng the length of a plane curve and the ntegral of ts radus of curvature, that has as a consequence

More information

Kernel Methods and SVMs Extension

Kernel Methods and SVMs Extension Kernel Methods and SVMs Extenson The purpose of ths document s to revew materal covered n Machne Learnng 1 Supervsed Learnng regardng support vector machnes (SVMs). Ths document also provdes a general

More information

Section 8.3 Polar Form of Complex Numbers

Section 8.3 Polar Form of Complex Numbers 80 Chapter 8 Secton 8 Polar Form of Complex Numbers From prevous classes, you may have encountered magnary numbers the square roots of negatve numbers and, more generally, complex numbers whch are the

More information

Lecture 20: Hypothesis testing

Lecture 20: Hypothesis testing Lecture : Hpothess testng Much of statstcs nvolves hpothess testng compare a new nterestng hpothess, H (the Alternatve hpothess to the borng, old, well-known case, H (the Null Hpothess or, decde whether

More information

42. Mon, Dec. 8 Last time, we were discussing CW complexes, and we considered two di erent CW structures on S n. We continue with more examples.

42. Mon, Dec. 8 Last time, we were discussing CW complexes, and we considered two di erent CW structures on S n. We continue with more examples. 42. Mon, Dec. 8 Last tme, we were dscussng CW complexes, and we consdered two d erent CW structures on S n. We contnue wth more examples. (2) RP n. Let s start wth RP 2. Recall that one model for ths space

More information

Google PageRank with Stochastic Matrix

Google PageRank with Stochastic Matrix Google PageRank wth Stochastc Matrx Md. Sharq, Puranjt Sanyal, Samk Mtra (M.Sc. Applcatons of Mathematcs) Dscrete Tme Markov Chan Let S be a countable set (usually S s a subset of Z or Z d or R or R d

More information

Modelli Clamfim Equazioni differenziali 7 ottobre 2013

Modelli Clamfim Equazioni differenziali 7 ottobre 2013 CLAMFIM Bologna Modell 1 @ Clamfm Equazon dfferenzal 7 ottobre 2013 professor Danele Rtell danele.rtell@unbo.t 1/18? Ordnary Dfferental Equatons A dfferental equaton s an equaton that defnes a relatonshp

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

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

Linear Approximation with Regularization and Moving Least Squares

Linear Approximation with Regularization and Moving Least Squares Lnear Approxmaton wth Regularzaton and Movng Least Squares Igor Grešovn May 007 Revson 4.6 (Revson : March 004). 5 4 3 0.5 3 3.5 4 Contents: Lnear Fttng...4. Weghted Least Squares n Functon Approxmaton...

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

Math 702 Midterm Exam Solutions

Math 702 Midterm Exam Solutions Math 702 Mdterm xam Solutons The terms measurable, measure, ntegrable, and almost everywhere (a.e.) n a ucldean space always refer to Lebesgue measure m. Problem. [6 pts] In each case, prove the statement

More information