Special Random Variables: Part 1

Size: px
Start display at page:

Download "Special Random Variables: Part 1"

Transcription

1 Spcl Rndom Vrbls: Prt Dscrt Rndom Vrbls Brnoull Rndom Vrbl (wth prmtr p) Th rndom vrbl x dnots th succss from trl. Th probblty mss functon of th rndom vrbl X s gvn by p X () p X () p p ( E[X ]p Th momnt gnrtng functon s p)+ p p Vr(X) E[X ] (E[X]) p p p( p) (t) E[ tx ] t ( p)+ t p p + p t Chck: (t) p t, (t) p t. () p, E[X ] () p. Bnoml Rndom Vrbl (wth prmtrs n nd p) Th probblty mss functon of th rndom vrbl X s gvn by n p X () p ( p) n,,,...,n

2 p X () n p ( p) n n! (n )!! p ( p) n n! (n )!( )! p ( p) n (n )! np (n )!( )! p ( p) n n X (n )! np (n k)!k! pk ( p) n k k Xn n np p k ( p) n k k k np[p +( p)] n np Altrntly, Bnoml rndom vrbl s numbr of succsss n n trls. X P n X whr X r ndpndnt nd dntclly dstrbutd Brnoull rndom vrbl. " # E X E[X ]np Vr(X) Vr( Th momnt gnrtng functon X ) (t) E[ tx ]E Vr(X )np( p) " xp t!# X ny E [xp(tx )] ( p + p t ) n Chck: (t) n(p t + p) n p t, (t) n(n )(p t + p) n (p t ) +n(p t + p) n p t. Ths gvs () np nd E[X ] () n(n )p + np

3 Gomtrc Rndom Vrbl (wth prmtr p) Lt X dnot th numbr of trls untl succss occurs. Th probblty mss functon of X s gvn by p X () p( p) p p( p) q whr q p p d dq p d dq! q p ( q) /p q q

4 Now, consdr th rndom vrbl Y X,.., E[Y ]E[X] /p. E[XY ] p ( )p( p) ( )q whr q p p d dq! ( )q X q! p d (k )q k dq k!! p d q d q k dq dq k!! p d q d q k dq dq k p d q d dq dq q q p d dq ( q) q p [Bcksubsttut q ( (q ) 3 ( p) p (( p) ) 3 +p p p p p 3 p)] Th momnt gnrtng functon E[XY ]E[X(X )] E[X X]E[X ] E[X] Vr(X)+(E[X]) E[X] ) p Vr(X)+/p /p p Vr(X) p (t) p p t ( p) t

5 Posson Rndom Vrbl (wth prmtr ) Th probblty mss functon of X s gvn by p X ()! ( )! ( )! k [whr k ] (k)! k {z } E[X ]E[X(X ) + X] E[X(X )] + E[X(X )] +. E[X(X ( ) )]! ( )! ( )! k [whr k ] k! k {z } Vr(X) E[X ] (E[X]) E[X(X )] + +. Th momnt gnrtng functon (t) E[ tx ] t!! ( t ) t (t )! Chck: (t) t (t ), (t) ( t ) (t ) + t (t ).Thsgvs () nd E[X ] () +

6 Posson thorm: If n!nd p! suchthtnp! thn n p q n! n!! Ths shows tht for lrg n nd smll p w cn pproxmt th bnoml dstrbuton wth Posson dstrbuton. Contnuous Rndom Vrbl Unform Rndom Vrbl Lt X s unformly dstrbutd ovr (, b). Th probblty dnsty functon s gvn by f X (x), for <x<b b,othrws Z xf X (x)dx Z b b b + b x b dx Z b xdx ppl x b E[X ] Z x f X (x)dx Vr(X) E[X ] (E[X]) (b ). Th momnt gnrtng functon Z b b b (t) tb t(b ) x b dx Z b x dx ppl x 3 b 3 3 ( + b + b ) t

7 Exponntl Rndom Vrbl wth prmtr Th probblty dnsty functon s gvn by Z xf X (x)dx Z x f X (x) x, for x> x,forx< x dx Z x + x x dx [usng ntgrton by prts] E[X ] Z x f X (x)dx Z x x dx [us ntgrton by prts twc] Vr(X) E[X ] (E[X]) Th momnt gnrtng functon (t) E[ tx ] Z tx Z (t Chck: (t) /( t) nd (t) /( t) 3. () / nd E[X ] () /. t x dx )x dx Proprts of th Exponntl Dstrbuton Th xponntl rndom vrbl X s mmorylss,.., P (X >t+ X >t)p (X > ) 8t, Proof: P (X >t+,x > t) P (X >t+ X >t) P (X >t) P (X >t+ ) P (X >t) (t+ ) t P (X > )

8 X nd X r ndpndnt xponntl rndom vrbls wth prmtrs nd, rspctvly. Thn P (X <X ) Z Z Z Z Z Z P (X <X X x) P (X >x) x dx [ P (X ppl x)] x dx [ F X (x)] x dx x x dx + ( + )x dx X,X,...,X n r ndpndnt xponntl dstrbutd rndom vrbls wth prmtrs,,,...,n. x dx P [mn(x,x,...,x n ) >x]p (X >x,x >x,...,x n >x) ny P (X >x) ny [ P (X ppl x)] ny [ ( x )] ny xp Gussn Rndom Vrbl wth prmtrs (µ, ) Th probblty dnsty functon s gvn by " # f X (x) p xp x µ, for <x< " x! x #

9 Assum z x µ. Z xf X (x)dx p Z z + µ) ( z / dz Z ppl Z p z z / dz +µ p z / dz {z } {z } µ Vr(X). Th momnt gnrtng functon of Z (X µ)/ Ths gvs Z(t) E[ tz ] p Z tz z / dz p Z (z tz)/ dz t / p Z (z t) dz {z } t / X(t) E[ tx ]E t( Z+µ) ppl tµ E[ t Z t ]xp + µt ppl (t) (µ + t t )xp + µt ppl ppl (t) (µ + t ) t xp + µt + t xp + µt So, () µ, E[X ] () µ +,Vr(X) E[X ] (E[X]).

10 Dscrt RV Contnuous RV Tbl 4.: Common probblty dstrbutons. Probblty Momnt gnrtng pmf/pdf dstrbuton functon, (t) ) Mn Vrnc Brnoull px() p wth prmtr p px() p p + p t p p( p) Bnoml px() n p ( p) n, wth prmtrs (n, p),,...,n ( p + p t ) n np np( p) Gomtrc px() p( p) pt ( p) wth prmtr p t /p ( p)/p Posson px() wth prmtr (t! Unform fx(x), b tb t ( + b)/ (b ) / t(b ) n th ntrvl [, b] for <x<b Exponntl fx(x) x, t / / wth prmtr for x> h Gussn fx(x) p xp wth prmtrs (µ, ) for <x< x µ, xp h t + µt µ

HW3 : Moment functions Solutions

HW3 : Moment functions Solutions STAT/MATH 395 A - PROBABILITY II UW Spring Qurter 6 Néhémy Lim HW3 : Moment functions Solutions Problem. Let X be rel-vlued rndom vrible on probbility spce (Ω, A, P) with moment generting function M X.

More information

Bivariate scatter plots and densities

Bivariate scatter plots and densities Multivariate descriptive statistics Bivariate scatter plots and densities Plotting two (related) variables is often called a scatter plot. It is a bivariate version of the rug plot. It can show something

More information

16.584: Random Vectors

16.584: Random Vectors 1 16.584: Random Vectors Define X : (X 1, X 2,..X n ) T : n-dimensional Random Vector X 1 : X(t 1 ): May correspond to samples/measurements Generalize definition of PDF: F X (x) = P[X 1 x 1, X 2 x 2,...X

More information

Lecture 19: Properties of Expectation

Lecture 19: Properties of Expectation Lecture 19: Properties of Expectation Dan Sloughter Furman University Mathematics 37 February 11, 4 19.1 The unconscious statistician, revisited The following is a generalization of the law of the unconscious

More information

Grand Canonical Ensemble

Grand Canonical Ensemble Th nsmbl of systms mmrsd n a partcl-hat rsrvor at constant tmpratur T, prssur P, and chmcal potntal. Consdr an nsmbl of M dntcal systms (M =,, 3,...M).. Thy ar mutually sharng th total numbr of partcls

More information

Generating and characteristic functions. Generating and Characteristic Functions. Probability generating function. Probability generating function

Generating and characteristic functions. Generating and Characteristic Functions. Probability generating function. Probability generating function Generating and characteristic functions Generating and Characteristic Functions September 3, 03 Probability generating function Moment generating function Power series expansion Characteristic function

More information

STAT/MATH 395 A - PROBABILITY II UW Winter Quarter Moment functions. x r p X (x) (1) E[X r ] = x r f X (x) dx (2) (x E[X]) r p X (x) (3)

STAT/MATH 395 A - PROBABILITY II UW Winter Quarter Moment functions. x r p X (x) (1) E[X r ] = x r f X (x) dx (2) (x E[X]) r p X (x) (3) STAT/MATH 395 A - PROBABILITY II UW Winter Quarter 07 Néhémy Lim Moment functions Moments of a random variable Definition.. Let X be a rrv on probability space (Ω, A, P). For a given r N, E[X r ], if it

More information

BMIR Lecture Series on Probability and Statistics Fall 2015 Discrete RVs

BMIR Lecture Series on Probability and Statistics Fall 2015 Discrete RVs Lecture #7 BMIR Lecture Series on Probability and Statistics Fall 2015 Department of Biomedical Engineering and Environmental Sciences National Tsing Hua University 7.1 Function of Single Variable Theorem

More information

n! (k 1)!(n k)! = F (X) U(0, 1). (x, y) = n(n 1) ( F (y) F (x) ) n 2

n! (k 1)!(n k)! = F (X) U(0, 1). (x, y) = n(n 1) ( F (y) F (x) ) n 2 Order statistics Ex. 4. (*. Let independent variables X,..., X n have U(0, distribution. Show that for every x (0,, we have P ( X ( < x and P ( X (n > x as n. Ex. 4.2 (**. By using induction or otherwise,

More information

P (x). all other X j =x j. If X is a continuous random vector (see p.172), then the marginal distributions of X i are: f(x)dx 1 dx n

P (x). all other X j =x j. If X is a continuous random vector (see p.172), then the marginal distributions of X i are: f(x)dx 1 dx n JOINT DENSITIES - RANDOM VECTORS - REVIEW Joint densities describe probability distributions of a random vector X: an n-dimensional vector of random variables, ie, X = (X 1,, X n ), where all X is are

More information

3. Probability and Statistics

3. Probability and Statistics FE661 - Statistical Methods for Financial Engineering 3. Probability and Statistics Jitkomut Songsiri definitions, probability measures conditional expectations correlation and covariance some important

More information

8. Linear Contracts under Risk Neutrality

8. Linear Contracts under Risk Neutrality 8. Lnr Contrcts undr Rsk Nutrlty Lnr contrcts r th smplst form of contrcts nd thy r vry populr n pplctons. Thy offr smpl ncntv mchnsm. Exmpls of lnr contrcts r mny: contrctul jont vnturs, quty jont vnturs,

More information

4 Pairs of Random Variables

4 Pairs of Random Variables B.Sc./Cert./M.Sc. Qualif. - Statistical Theory 4 Pairs of Random Variables 4.1 Introduction In this section, we consider a pair of r.v. s X, Y on (Ω, F, P), i.e. X, Y : Ω R. More precisely, we define a

More information

ECONOMICS 207 SPRING 2006 LABORATORY EXERCISE 5 KEY. 8 = 10(5x 2) = 9(3x + 8), x 50x 20 = 27x x = 92 x = 4. 8x 2 22x + 15 = 0 (2x 3)(4x 5) = 0

ECONOMICS 207 SPRING 2006 LABORATORY EXERCISE 5 KEY. 8 = 10(5x 2) = 9(3x + 8), x 50x 20 = 27x x = 92 x = 4. 8x 2 22x + 15 = 0 (2x 3)(4x 5) = 0 ECONOMICS 07 SPRING 006 LABORATORY EXERCISE 5 KEY Problem. Solve the following equations for x. a 5x 3x + 8 = 9 0 5x 3x + 8 9 8 = 0(5x ) = 9(3x + 8), x 0 3 50x 0 = 7x + 7 3x = 9 x = 4 b 8x x + 5 = 0 8x

More information

Random Variables. Random variables. A numerically valued map X of an outcome ω from a sample space Ω to the real line R

Random Variables. Random variables. A numerically valued map X of an outcome ω from a sample space Ω to the real line R In probabilistic models, a random variable is a variable whose possible values are numerical outcomes of a random phenomenon. As a function or a map, it maps from an element (or an outcome) of a sample

More information

Chapter 6 Student Lecture Notes 6-1

Chapter 6 Student Lecture Notes 6-1 Chaptr 6 Studnt Lctur Nots 6-1 Chaptr Goals QM353: Busnss Statstcs Chaptr 6 Goodnss-of-Ft Tsts and Contngncy Analyss Aftr compltng ths chaptr, you should b abl to: Us th ch-squar goodnss-of-ft tst to dtrmn

More information

E[X n ]= dn dt n M X(t). ). What is the mgf? Solution. Found this the other day in the Kernel matching exercise: 1 M X (t) =

E[X n ]= dn dt n M X(t). ). What is the mgf? Solution. Found this the other day in the Kernel matching exercise: 1 M X (t) = Chapter 7 Generating functions Definition 7.. Let X be a random variable. The moment generating function is given by M X (t) =E[e tx ], provided that the expectation exists for t in some neighborhood of

More information

BASICS OF PROBABILITY

BASICS OF PROBABILITY October 10, 2018 BASICS OF PROBABILITY Randomness, sample space and probability Probability is concerned with random experiments. That is, an experiment, the outcome of which cannot be predicted with certainty,

More information

MAS113 Introduction to Probability and Statistics. Proofs of theorems

MAS113 Introduction to Probability and Statistics. Proofs of theorems MAS113 Introduction to Probability and Statistics Proofs of theorems Theorem 1 De Morgan s Laws) See MAS110 Theorem 2 M1 By definition, B and A \ B are disjoint, and their union is A So, because m is a

More information

MAS113 Introduction to Probability and Statistics. Proofs of theorems

MAS113 Introduction to Probability and Statistics. Proofs of theorems MAS113 Introduction to Probability and Statistics Proofs of theorems Theorem 1 De Morgan s Laws) See MAS110 Theorem 2 M1 By definition, B and A \ B are disjoint, and their union is A So, because m is a

More information

Outlier-tolerant parameter estimation

Outlier-tolerant parameter estimation Outlr-tolrant paramtr stmaton Baysan thods n physcs statstcs machn larnng and sgnal procssng (SS 003 Frdrch Fraundorfr fraunfr@cg.tu-graz.ac.at Computr Graphcs and Vson Graz Unvrsty of Tchnology Outln

More information

4 Moment generating functions

4 Moment generating functions 4 Moment generating functions Moment generating functions (mgf) are a very powerful computational tool. They make certain computations much shorter. However, they are only a computational tool. The mgf

More information

3 Operations on One R.V. - Expectation

3 Operations on One R.V. - Expectation 0402344 Engineering Dept.-JUST. EE360 Signal Analysis-Electrical - Electrical Engineering Department. EE360-Random Signal Analysis-Electrical Engineering Dept.-JUST. EE360-Random Signal Analysis-Electrical

More information

10/7/14. Mixture Models. Comp 135 Introduction to Machine Learning and Data Mining. Maximum likelihood estimation. Mixture of Normals in 1D

10/7/14. Mixture Models. Comp 135 Introduction to Machine Learning and Data Mining. Maximum likelihood estimation. Mixture of Normals in 1D Comp 35 Introducton to Machn Larnng and Data Mnng Fall 204 rofssor: Ron Khardon Mxtur Modls Motvatd by soft k-mans w dvlopd a gnratv modl for clustrng. Assum thr ar k clustrs Clustrs ar not rqurd to hav

More information

1 Solution to Problem 2.1

1 Solution to Problem 2.1 Solution to Problem 2. I incorrectly worked this exercise instead of 2.2, so I decided to include the solution anyway. a) We have X Y /3, which is a - function. It maps the interval, ) where X lives) onto

More information

EEL 5544 Noise in Linear Systems Lecture 30. X (s) = E [ e sx] f X (x)e sx dx. Moments can be found from the Laplace transform as

EEL 5544 Noise in Linear Systems Lecture 30. X (s) = E [ e sx] f X (x)e sx dx. Moments can be found from the Laplace transform as L30-1 EEL 5544 Noise in Linear Systems Lecture 30 OTHER TRANSFORMS For a continuous, nonnegative RV X, the Laplace transform of X is X (s) = E [ e sx] = 0 f X (x)e sx dx. For a nonnegative RV, the Laplace

More information

HEAGAN & CO., OPP. f>, L. & W. DEPOT, DOYER, N. J, OUR MOTTO! ould Iwv ia immediate vltlui. VEEY BEST NEW Creamery Butter 22c ib,

HEAGAN & CO., OPP. f>, L. & W. DEPOT, DOYER, N. J, OUR MOTTO! ould Iwv ia immediate vltlui. VEEY BEST NEW Creamery Butter 22c ib, #4 NN N G N N % XX NY N Y FY N 2 88 N 28 k N k F P X Y N Y /» 2«X ««!!! 8 P 3 N 0»9! N k 25 F $ 60 $3 00 $3000 k k N 30 Y F00 6 )P 0» «{ N % X zz» «3 0««5 «N «XN» N N 00/ N 4 GN N Y 07 50 220 35 2 25 0

More information

ACM 116: Lectures 3 4

ACM 116: Lectures 3 4 1 ACM 116: Lectures 3 4 Joint distributions The multivariate normal distribution Conditional distributions Independent random variables Conditional distributions and Monte Carlo: Rejection sampling Variance

More information

Vr Vr

Vr Vr F rt l Pr nt t r : xt rn l ppl t n : Pr nt rv nd PD RDT V t : t t : p bl ( ll R lt: 00.00 L n : n L t pd t : 0 6 20 8 :06: 6 pt (p bl Vr.2 8.0 20 8.0. 6 TH N PD PPL T N N RL http : h b. x v t h. p V l

More information

Review - Probabilistic Classification

Review - Probabilistic Classification Mmoral Unvrsty of wfoundland Pattrn Rcognton Lctur 8 May 5, 6 http://www.ngr.mun.ca/~charlsr Offc Hours: Tusdays Thursdays 8:3-9:3 PM E- (untl furthr notc) Gvn lablld sampls { ɛc,,,..., } {. Estmat Rvw

More information

The Fourier Transform

The Fourier Transform /9/ Th ourr Transform Jan Baptst Josph ourr 768-83 Effcnt Data Rprsntaton Data can b rprsntd n many ways. Advantag usng an approprat rprsntaton. Eampls: osy ponts along a ln Color spac rd/grn/blu v.s.

More information

Economics 600: August, 2007 Dynamic Part: Problem Set 5. Problems on Differential Equations and Continuous Time Optimization

Economics 600: August, 2007 Dynamic Part: Problem Set 5. Problems on Differential Equations and Continuous Time Optimization THE UNIVERSITY OF MARYLAND COLLEGE PARK, MARYLAND Economcs 600: August, 007 Dynamc Part: Problm St 5 Problms on Dffrntal Equatons and Contnuous Tm Optmzaton Quston Solv th followng two dffrntal quatons.

More information

we need to describe how many cookies the first person gets. There are 6 choices (0, 1,... 5). So the answer is 6.

we need to describe how many cookies the first person gets. There are 6 choices (0, 1,... 5). So the answer is 6. () (a) How many ways are there to divide 5 different cakes and 5 identical cookies between people so that the first person gets exactly cakes. (b) How many ways are there to divide 5 different cakes and

More information

Mathematical Induction Assignments

Mathematical Induction Assignments 1 Mathematical Induction Assignments Prove the Following using Principle of Mathematical induction 1) Prove that for any positive integer number n, n 3 + 2 n is divisible by 3 2) Prove that 1 3 + 2 3 +

More information

ECE353: Probability and Random Processes. Lecture 7 -Continuous Random Variable

ECE353: Probability and Random Processes. Lecture 7 -Continuous Random Variable ECE353: Probability and Random Processes Lecture 7 -Continuous Random Variable Xiao Fu School of Electrical Engineering and Computer Science Oregon State University E-mail: xiao.fu@oregonstate.edu Continuous

More information

n! (k 1)!(n k)! = F (X) U(0, 1). (x, y) = n(n 1) ( F (y) F (x) ) n 2

n! (k 1)!(n k)! = F (X) U(0, 1). (x, y) = n(n 1) ( F (y) F (x) ) n 2 Order statistics Ex. 4.1 (*. Let independent variables X 1,..., X n have U(0, 1 distribution. Show that for every x (0, 1, we have P ( X (1 < x 1 and P ( X (n > x 1 as n. Ex. 4.2 (**. By using induction

More information

n r t d n :4 T P bl D n, l d t z d th tr t. r pd l

n r t d n :4 T P bl D n, l d t z d   th tr t. r pd l n r t d n 20 20 :4 T P bl D n, l d t z d http:.h th tr t. r pd l 2 0 x pt n f t v t, f f d, b th n nd th P r n h h, th r h v n t b n p d f r nt r. Th t v v d pr n, h v r, p n th pl v t r, d b p t r b R

More information

Math 426: Probability Final Exam Practice

Math 426: Probability Final Exam Practice Mth 46: Probbility Finl Exm Prctice. Computtionl problems 4. Let T k (n) denote the number of prtitions of the set {,..., n} into k nonempty subsets, where k n. Argue tht T k (n) kt k (n ) + T k (n ) by

More information

Th n nt T p n n th V ll f x Th r h l l r r h nd xpl r t n rr d nt ff t b Pr f r ll N v n d r n th r 8 l t p t, n z n l n n th n rth t rn p rt n f th v

Th n nt T p n n th V ll f x Th r h l l r r h nd xpl r t n rr d nt ff t b Pr f r ll N v n d r n th r 8 l t p t, n z n l n n th n rth t rn p rt n f th v Th n nt T p n n th V ll f x Th r h l l r r h nd xpl r t n rr d nt ff t b Pr f r ll N v n d r n th r 8 l t p t, n z n l n n th n rth t rn p rt n f th v ll f x, h v nd d pr v n t fr tf l t th f nt r n r

More information

A Family of Multivariate Abel Series Distributions. of Order k

A Family of Multivariate Abel Series Distributions. of Order k Appled Mthemtcl Scences, Vol. 2, 2008, no. 45, 2239-2246 A Fmly of Multvrte Abel Seres Dstrbutons of Order k Rupk Gupt & Kshore K. Ds 2 Fculty of Scence & Technology, The Icf Unversty, Agrtl, Trpur, Ind

More information

Sampling Distributions

Sampling Distributions In statistics, a random sample is a collection of independent and identically distributed (iid) random variables, and a sampling distribution is the distribution of a function of random sample. For example,

More information

Chp 4. Expectation and Variance

Chp 4. Expectation and Variance Chp 4. Expectation and Variance 1 Expectation In this chapter, we will introduce two objectives to directly reflect the properties of a random variable or vector, which are the Expectation and Variance.

More information

Lecture 5: Moment generating functions

Lecture 5: Moment generating functions Lecture 5: Moment generating functions Definition 2.3.6. The moment generating function (mgf) of a random variable X is { x e tx f M X (t) = E(e tx X (x) if X has a pmf ) = etx f X (x)dx if X has a pdf

More information

Power Series Solutions to the Legendre Equation

Power Series Solutions to the Legendre Equation Department of Mathematics IIT Guwahati The Legendre equation The equation (1 x 2 )y 2xy + α(α + 1)y = 0, (1) where α is any real constant, is called Legendre s equation. When α Z +, the equation has polynomial

More information

MATH2715: Statistical Methods

MATH2715: Statistical Methods MATH2715: Statistical Methods Exercises IV (based on lectures 7-8, work week 5, hand in lecture Mon 30 Oct) ALL questions count towards the continuous assessment for this module. Q1. If a random variable

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

Chapter 4. Chapter 4 sections

Chapter 4. Chapter 4 sections Chapter 4 sections 4.1 Expectation 4.2 Properties of Expectations 4.3 Variance 4.4 Moments 4.5 The Mean and the Median 4.6 Covariance and Correlation 4.7 Conditional Expectation SKIP: 4.8 Utility Expectation

More information

Soft k-means Clustering. Comp 135 Machine Learning Computer Science Tufts University. Mixture Models. Mixture of Normals in 1D

Soft k-means Clustering. Comp 135 Machine Learning Computer Science Tufts University. Mixture Models. Mixture of Normals in 1D Comp 35 Machn Larnng Computr Scnc Tufts Unvrsty Fall 207 Ron Khardon Th EM Algorthm Mxtur Modls Sm-Suprvsd Larnng Soft k-mans Clustrng ck k clustr cntrs : Assocat xampls wth cntrs p,j ~~ smlarty b/w cntr

More information

Th pr nt n f r n th f ft nth nt r b R b rt Pr t r. Pr t r, R b rt, b. 868. xf rd : Pr nt d f r th B bl r ph l t t th xf rd n v r t Pr, 00. http://hdl.handle.net/2027/nyp.33433006349173 P bl D n n th n

More information

1.12 Multivariate Random Variables

1.12 Multivariate Random Variables 112 MULTIVARIATE RANDOM VARIABLES 59 112 Multivariate Random Variables We will be using matrix notation to denote multivariate rvs and their distributions Denote by X (X 1,,X n ) T an n-dimensional random

More information

18.440: Lecture 19 Normal random variables

18.440: Lecture 19 Normal random variables 18.440 Lecture 19 18.440: Lecture 19 Normal random variables Scott Sheffield MIT Outline Tossing coins Normal random variables Special case of central limit theorem Outline Tossing coins Normal random

More information

A general N-dimensional vector consists of N values. They can be arranged as a column or a row and can be real or complex.

A general N-dimensional vector consists of N values. They can be arranged as a column or a row and can be real or complex. Lnr lgr Vctors gnrl -dmnsonl ctor conssts of lus h cn rrngd s column or row nd cn rl or compl Rcll -dmnsonl ctor cn rprsnt poston, loct, or cclrton Lt & k,, unt ctors long,, & rspctl nd lt k h th componnts

More information

Formulas for probability theory and linear models SF2941

Formulas for probability theory and linear models SF2941 Formulas for probability theory and linear models SF2941 These pages + Appendix 2 of Gut) are permitted as assistance at the exam. 11 maj 2008 Selected formulae of probability Bivariate probability Transforms

More information

46 D b r 4, 20 : p t n f r n b P l h tr p, pl t z r f r n. nd n th t n t d f t n th tr ht r t b f l n t, nd th ff r n b ttl t th r p rf l pp n nt n th

46 D b r 4, 20 : p t n f r n b P l h tr p, pl t z r f r n. nd n th t n t d f t n th tr ht r t b f l n t, nd th ff r n b ttl t th r p rf l pp n nt n th n r t d n 20 0 : T P bl D n, l d t z d http:.h th tr t. r pd l 46 D b r 4, 20 : p t n f r n b P l h tr p, pl t z r f r n. nd n th t n t d f t n th tr ht r t b f l n t, nd th ff r n b ttl t th r p rf l

More information

EE4601 Communication Systems

EE4601 Communication Systems EE4601 Communication Systems Week 2 Review of Probability, Important Distributions 0 c 2011, Georgia Institute of Technology (lect2 1) Conditional Probability Consider a sample space that consists of two

More information

Analyzing Frequencies

Analyzing Frequencies Frquncy (# ndvduals) Frquncy (# ndvduals) /3/16 H o : No dffrnc n obsrvd sz frquncs and that prdctd by growth modl How would you analyz ths data? 15 Obsrvd Numbr 15 Expctd Numbr from growth modl 1 1 5

More information

ECE353: Probability and Random Processes. Lecture 5 - Cumulative Distribution Function and Expectation

ECE353: Probability and Random Processes. Lecture 5 - Cumulative Distribution Function and Expectation ECE353: Probability and Random Processes Lecture 5 - Cumulative Distribution Function and Expectation Xiao Fu School of Electrical Engineering and Computer Science Oregon State University E-mail: xiao.fu@oregonstate.edu

More information

UCSD ECE153 Handout #34 Prof. Young-Han Kim Tuesday, May 27, Solutions to Homework Set #6 (Prepared by TA Fatemeh Arbabjolfaei)

UCSD ECE153 Handout #34 Prof. Young-Han Kim Tuesday, May 27, Solutions to Homework Set #6 (Prepared by TA Fatemeh Arbabjolfaei) UCSD ECE53 Handout #34 Prof Young-Han Kim Tuesday, May 7, 04 Solutions to Homework Set #6 (Prepared by TA Fatemeh Arbabjolfaei) Linear estimator Consider a channel with the observation Y XZ, where the

More information

14 EE 2402 Engineering Mathematics III Solutions to Tutorial 3 1. For n =0; 1; 2; 3; 4; 5 verify that P n (x) is a solution of Legendre's equation wit

14 EE 2402 Engineering Mathematics III Solutions to Tutorial 3 1. For n =0; 1; 2; 3; 4; 5 verify that P n (x) is a solution of Legendre's equation wit EE 0 Engineering Mathematics III Solutions to Tutorial. For n =0; ; ; ; ; verify that P n (x) is a solution of Legendre's equation with ff = n. Solution: Recall the Legendre's equation from your text or

More information

ECE 650 Lecture 4. Intro to Estimation Theory Random Vectors. ECE 650 D. Van Alphen 1

ECE 650 Lecture 4. Intro to Estimation Theory Random Vectors. ECE 650 D. Van Alphen 1 EE 650 Lecture 4 Intro to Estimation Theory Random Vectors EE 650 D. Van Alphen 1 Lecture Overview: Random Variables & Estimation Theory Functions of RV s (5.9) Introduction to Estimation Theory MMSE Estimation

More information

1 Solution to Homework 4

1 Solution to Homework 4 Solution to Homework Section. 5. The characteristic equation is r r + = (r )(r ) = 0 r = or r =. y(t) = c e t + c e t y = c e t + c e t. y(0) =, y (0) = c + c =, c + c = c =, c =. To find the maximum value

More information

Random Process Part 1

Random Process Part 1 Random Procss Part A random procss t (, ζ is a signal or wavform in tim. t : tim ζ : outcom in th sampl spac Each tim w rapat th xprimnt, a nw wavform is gnratd. ( W will adopt t for short. Tim sampls

More information

CONTINUITY AND DIFFERENTIABILITY

CONTINUITY AND DIFFERENTIABILITY MCD CONTINUITY AND DIFFERENTIABILITY NCERT Solvd mpls upto th sction 5 (Introduction) nd 5 (Continuity) : Empl : Chck th continuity of th function f givn by f() = + t = Empl : Emin whthr th function f

More information

I ' l A MEMPHIS, TENN., SATURDAY, AUGUST 23,1873.

I ' l A MEMPHIS, TENN., SATURDAY, AUGUST 23,1873. - P G& P P G» -» - P D - RP P R G GFFX G - 3 D G» R» G - G > D X >»» P -3 8 7 3-379 ( -» - F X P X X z» FR 0- P x X >»» P»( > ( 3 - - --5 - X- - x 25Z3 - - z - 37 - x -» x V5?» - > 3 x & 2» x z > - -»»

More information

Lecture 3. David Aldous. 31 August David Aldous Lecture 3

Lecture 3. David Aldous. 31 August David Aldous Lecture 3 Lecture 3 David Aldous 31 August 2015 This size-bias effect occurs in other contexts, such as class size. If a small Department offers two courses, with enrollments 90 and 10, then average class (faculty

More information

Math512 PDE Homework 2

Math512 PDE Homework 2 Math51 PDE Homework October 11, 009 Exercise 1.3. Solve u = xu x +yu y +(u x+y y/ = 0 with initial conditon u(x, 0 = 1 x. Proof. In this case, we have F = xp + yq + (p + q / z = 0 and Γ parameterized as

More information

arxiv: v1 [math.pr] 28 Jan 2019

arxiv: v1 [math.pr] 28 Jan 2019 CRAMÉR-TYPE MODERATE DEVIATION OF NORMAL APPROXIMATION FOR EXCHANGEABLE PAIRS arxv:190109526v1 [mathpr] 28 Jan 2019 ZHUO-SONG ZHANG Abstract In Stn s mthod, an xchangabl par approach s commonly usd to

More information

Random Variables. Cumulative Distribution Function (CDF) Amappingthattransformstheeventstotherealline.

Random Variables. Cumulative Distribution Function (CDF) Amappingthattransformstheeventstotherealline. Random Variables Amappingthattransformstheeventstotherealline. Example 1. Toss a fair coin. Define a random variable X where X is 1 if head appears and X is if tail appears. P (X =)=1/2 P (X =1)=1/2 Example

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

Discovery Guide. Beautiful, mysterious woman pursued by gunmen. Sounds like a spy story...

Discovery Guide. Beautiful, mysterious woman pursued by gunmen. Sounds like a spy story... Dv G W C T Gp, A T Af Hk T 39 Sp. M Mx Hk p j p v, f M P v...(!) Af Hk T 39 Sp, B,,, UNMISSABLE! T - f 4 p v 150 f-p f x v. Bf, k 4 p v 150. H k f f x? D,,,, v? W k, pf p f p? W f f f? W k k p? T p xp

More information

5 Probability densities

5 Probability densities 5 Probbility densities 5. Continuous rndom vribles 5. The norml distribution 5.3 The norml pproimtion to the binomil distribution 5.5 The uniorm distribution 5. Joint distribution discrete nd continuous

More information

Chapter 2 - Survival Models

Chapter 2 - Survival Models 2-1 Chapter 2 - Survival Models Section 2.2 - Future Lifetime Random Variable and the Survival Function Let T x = ( Future lifelength beyond age x of an individual who has survived to age x [measured in

More information

STAT 430/510: Lecture 16

STAT 430/510: Lecture 16 STAT 430/510: Lecture 16 James Piette June 24, 2010 Updates HW4 is up on my website. It is due next Mon. (June 28th). Starting today back at section 6.7 and will begin Ch. 7. Joint Distribution of Functions

More information

Moment Generating Function. STAT/MTHE 353: 5 Moment Generating Functions and Multivariate Normal Distribution

Moment Generating Function. STAT/MTHE 353: 5 Moment Generating Functions and Multivariate Normal Distribution Moment Generating Function STAT/MTHE 353: 5 Moment Generating Functions and Multivariate Normal Distribution T. Linder Queen s University Winter 07 Definition Let X (X,...,X n ) T be a random vector and

More information

Econ 508B: Lecture 5

Econ 508B: Lecture 5 Econ 508B: Lecture 5 Expectation, MGF and CGF Hongyi Liu Washington University in St. Louis July 31, 2017 Hongyi Liu (Washington University in St. Louis) Math Camp 2017 Stats July 31, 2017 1 / 23 Outline

More information

D t r l f r th n t d t t pr p r d b th t ff f th l t tt n N tr t n nd H n N d, n t d t t n t. n t d t t. h n t n :.. vt. Pr nt. ff.,. http://hdl.handle.net/2027/uiug.30112023368936 P bl D n, l d t z d

More information

l f t n nd bj t nd x f r t l n nd rr n n th b nd p phl t f l br r. D, lv l, 8. h r t,., 8 6. http://hdl.handle.net/2027/miun.aey7382.0001.001 P bl D n http://www.hathitrust.org/access_use#pd Th r n th

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 3. Probability - Part 2. Luigi Freda. ALCOR Lab DIAG University of Rome La Sapienza. October 19, 2016

Lecture 3. Probability - Part 2. Luigi Freda. ALCOR Lab DIAG University of Rome La Sapienza. October 19, 2016 Lecture 3 Probability - Part 2 Luigi Freda ALCOR Lab DIAG University of Rome La Sapienza October 19, 2016 Luigi Freda ( La Sapienza University) Lecture 3 October 19, 2016 1 / 46 Outline 1 Common Continuous

More information

4181H Problem Set 11 Selected Solutions. Chapter 19. n(log x) n 1 1 x x dx,

4181H Problem Set 11 Selected Solutions. Chapter 19. n(log x) n 1 1 x x dx, 48H Problem Set Selected Solutions Chpter 9 # () Tke f(x) = x n, g (x) = e x, nd use integrtion by prts; this gives reduction formul: x n e x dx = x n e x n x n e x dx. (b) Tke f(x) = (log x) n, g (x)

More information

UNIT-2: MULTIPLE RANDOM VARIABLES & OPERATIONS

UNIT-2: MULTIPLE RANDOM VARIABLES & OPERATIONS UNIT-2: MULTIPLE RANDOM VARIABLES & OPERATIONS In many practical situations, multiple random variables are required for analysis than a single random variable. The analysis of two random variables especially

More information

4 4 N v b r t, 20 xpr n f th ll f th p p l t n p pr d. H ndr d nd th nd f t v L th n n f th pr v n f V ln, r dn nd l r thr n nt pr n, h r th ff r d nd

4 4 N v b r t, 20 xpr n f th ll f th p p l t n p pr d. H ndr d nd th nd f t v L th n n f th pr v n f V ln, r dn nd l r thr n nt pr n, h r th ff r d nd n r t d n 20 20 0 : 0 T P bl D n, l d t z d http:.h th tr t. r pd l 4 4 N v b r t, 20 xpr n f th ll f th p p l t n p pr d. H ndr d nd th nd f t v L th n n f th pr v n f V ln, r dn nd l r thr n nt pr n,

More information

Properties of Random Variables

Properties of Random Variables Properties of Random Variables 1 Definitions A discrete random variable is defined by a probability distribution that lists each possible outcome and the probability of obtaining that outcome If the random

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

Lecture 2: Repetition of probability theory and statistics

Lecture 2: Repetition of probability theory and statistics Algorithms for Uncertainty Quantification SS8, IN2345 Tobias Neckel Scientific Computing in Computer Science TUM Lecture 2: Repetition of probability theory and statistics Concept of Building Block: Prerequisites:

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

Analysis of Engineering and Scientific Data. Semester

Analysis of Engineering and Scientific Data. Semester Analysis of Engineering and Scientific Data Semester 1 2019 Sabrina Streipert s.streipert@uq.edu.au Example: Draw a random number from the interval of real numbers [1, 3]. Let X represent the number. Each

More information

STAT 430/510: Lecture 15

STAT 430/510: Lecture 15 STAT 430/510: Lecture 15 James Piette June 23, 2010 Updates HW4 is up on my website. It is due next Mon. (June 28th). Starting today back at section 6.4... Conditional Distribution: Discrete Def: The conditional

More information

Lecture 6: Gaussian Channels. Copyright G. Caire (Sample Lectures) 157

Lecture 6: Gaussian Channels. Copyright G. Caire (Sample Lectures) 157 Lecture 6: Gaussian Channels Copyright G. Caire (Sample Lectures) 157 Differential entropy (1) Definition 18. The (joint) differential entropy of a continuous random vector X n p X n(x) over R is: Z h(x

More information

Solutions to Homework Set #5 (Prepared by Lele Wang) MSE = E [ (sgn(x) g(y)) 2],, where f X (x) = 1 2 2π e. e (x y)2 2 dx 2π

Solutions to Homework Set #5 (Prepared by Lele Wang) MSE = E [ (sgn(x) g(y)) 2],, where f X (x) = 1 2 2π e. e (x y)2 2 dx 2π Solutions to Homework Set #5 (Prepared by Lele Wang). Neural net. Let Y X + Z, where the signal X U[,] and noise Z N(,) are independent. (a) Find the function g(y) that minimizes MSE E [ (sgn(x) g(y))

More information

Continuous r.v practice problems

Continuous r.v practice problems Continuous r.v practice problems SDS 321 Intro to Probability and Statistics 1. (2+2+1+1 6 pts) The annual rainfall (in inches) in a certain region is normally distributed with mean 4 and standard deviation

More information

Formalism of Quantum Mechanics

Formalism of Quantum Mechanics The theory of quantum mechanics is formulated by defining a set of rules or postulates. These postulates cannot be derived from the laws of classical physics. The rules define the following: 1. How to

More information

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

Tutorial 4. b a. h(f) = a b a ln 1. b a dx = ln(b a) nats = log(b a) bits. = ln λ + 1 nats. = log e λ bits. = ln 1 2 ln λ + 1. nats. = ln 2e. bits. Tutoril 4 Exercises on Differentil Entropy. Evlute the differentil entropy h(x) f ln f for the following: () The uniform distribution, f(x) b. (b) The exponentil density, f(x) λe λx, x 0. (c) The Lplce

More information

Sampling Distributions

Sampling Distributions Sampling Distributions In statistics, a random sample is a collection of independent and identically distributed (iid) random variables, and a sampling distribution is the distribution of a function of

More information

2 (Statistics) Random variables

2 (Statistics) Random variables 2 (Statistics) Random variables References: DeGroot and Schervish, chapters 3, 4 and 5; Stirzaker, chapters 4, 5 and 6 We will now study the main tools use for modeling experiments with unknown outcomes

More information

Stat 475 Life Contingencies I. Chapter 2: Survival models

Stat 475 Life Contingencies I. Chapter 2: Survival models Stat 475 Life Contingencies I Chapter 2: Survival models The future lifetime random variable Notation We are interested in analyzing and describing the future lifetime of an individual. We use (x) to denote

More information

Problem #1 #2 #3 #4 Total Points /5 /7 /8 /4 /24

Problem #1 #2 #3 #4 Total Points /5 /7 /8 /4 /24 STAT/MATH 395 A - Winter Quarter 17 - Midterm - February 17, 17 Name: Student ID Number: Problem #1 # #3 #4 Total Points /5 /7 /8 /4 /4 Directions. Read directions carefully and show all your work. Define

More information

PanHomc'r I'rui;* :".>r '.a'' W"»' I'fltolt. 'j'l :. r... Jnfii<on. Kslaiaaac. <.T i.. %.. 1 >

PanHomc'r I'rui;* :.>r '.a'' W»' I'fltolt. 'j'l :. r... Jnfii<on. Kslaiaaac. <.T i.. %.. 1 > 5 28 (x / &» )»(»»» Q ( 3 Q» (» ( (3 5» ( q 2 5 q 2 5 5 8) 5 2 2 ) ~ ( / x {» /»»»»» (»»» ( 3 ) / & Q ) X ] Q & X X X x» 8 ( &» 2 & % X ) 8 x & X ( #»»q 3 ( ) & X 3 / Q X»»» %» ( z 22 (»» 2» }» / & 2 X

More information

Fitting Compartmental Models to Multiple Dose Pharmacokinetic Data using SAS PROC NLMIXED

Fitting Compartmental Models to Multiple Dose Pharmacokinetic Data using SAS PROC NLMIXED Ppr SP-2009 Fttng Comprtmntl Modls to Multpl Dos Phrmcokntc Dt usng SAS PROC NLMIXED Jng Su, Png Sun, Xodong L nd Aln H. Hrtford Mrck & Co., Inc, North Wls, PA ABSTRACT Phrmcokntc (PK) modlng uss systms

More information

Review of Probability Theory

Review of Probability Theory Review of Probability Theory Arian Maleki and Tom Do Stanford University Probability theory is the study of uncertainty Through this class, we will be relying on concepts from probability theory for deriving

More information