Expected Value and Variance
|
|
- Felicia Washington
- 5 years ago
- Views:
Transcription
1 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 mean µ ) of a dscrete random varable X s a weghted average gven by µ E[ X] P(X ). Note: If X has a fnte range { 1,,..., n }, then ts average value s E[ X ] 1 P( X 1 ) + P( X ) n P( X n ), whch s always a fnte sum. But f Range X s denumerable { 1,,..., n,... }, then E[ X ] s an nfnte sum and may or may not converge. Example 1. (a) Roll a far sx-sded de; record the value. What s the average value? (b) Roll a far sx-sded over and over untl you roll a 3. You wn $ n f you roll a 3 for the frst tme on the n th roll. What are your average earnngs? (c) Roll a sngle sx-sded de. If you roll a 1, then you get $5. If you roll a or 3, then you get $10. But f you roll a 4, 5, or, then you lose $0. Let X denote your change n fortune. Compute E[ X ]. Soluton. (a) Let X be the value of the de. Then Range X {1,, 3, 4, 5, }, and each value n the range occurs wth probablty 1/. Thus, E[ X ] P( X ) (b) Let X be your earnngs. Then Range X {,, 3,... }, and for n 1 we have P(X n ) 5 n 1 1 (from n 1 losses followed by the wn on the n th roll). Thus, E[ X ] P( X ) n P( X n ) n 1 n 5 n n 1. n 1 n 1 Although you would expect the game to end at some pont at whch you receve your payoff, the average payoff s nfnte.
2 (c) We have Range X { 0, 5, 10} wth the pdf of X gven by f ( 0) P( X 0) 3 f (5) P( X 5) 1 f (10) P(X 10). Thus, E[ X ] P( X ) $5.83. Condtonal Average Defnton. Let A be an event wth P(A) > 0. The condtonal average of a dscrete random varable X gven A s defned by E[ X A] P( X A) Range X 1 P( A) P ({X } A). P ( {X } A ) P(A) Theorem 1. (Law of Total Average) Suppose non-null events A 1, A,... form a partton of Ω. That s, the events are dsjont and ther unon s all of Ω. Then for any dscrete random varable X, we have E[ X ] E[ X A 1 ] P( A 1 ) + E[ X A ] P(A ) +... E[ X A ] P(A ). Proof. Usng propertes of seres and the probablty measure P, we have E[ X A ] P( A ) P( X A ) P( A ) P ( (X ) A ) P(A ) P(A ) P ((X ) A ) P ((X ) A ) rearrange the sum P (( X ) A ) P ( X ) A by dsjontness of partton P( X ) E[ X ].
3 Example. Roll one de. Let A 1 Roll a 1, A Roll a, 3 or 5, A 3 Roll a 4 or. Let X the value of the roll. What are E[ X A ]? Use these values to compute E[ X ]. Soluton. Frst, we have E[ X A 1 ] P( X A 1 ) 1 P( X 1 A 1 ) P( X 1 A 1 ) P( A 1 ) 1 P(A 1 ) P(A 1 ) 1. In other words, the average of the rolls that are 1 s 1. Next, E[ X A ] P( X A ) + 3P( X 3 A ) + 5P( X 5 A ) P(X A ) P( A ) P(X ) P( A ) P(X 3 A ) P( A ) P(X 3) P( A ) ( ) P( X 5) P(A ) + 5 P( X 5 A ) P(A ) 1 / 1 / / 1 / / 1 / That s, gven that you've rolled a, 3, or 5, the average roll s 10/3. Lastly, E[ X A 3 ] 4P( X 4 A 3 ) + P( X A 3 ) 4 P( X 4 A 3 ) P(A 3 ) 4 P( X 4) P( A 3 ) + (4 + ) P( X A 3 ) P(A 3 ) P(X ) P(A 3 ) 4 1 / 1 / / 1 / 3 Then, 3 E[ X ] E[ X A ] P(A ) 1P( A 1 ) P( A ) + 5P( A 3 ) Propertes of Expected Value We now prove some mportant and often used propertes the expected value for dscrete random varables. The proof of property () uses the precedng concept of condtonal expectaton.
4 Theorem. () The expected value of a constant s that constant: E[c ] c. () Expected value s a lnear operator on dscrete random varables; that s, constants factor out of an expected value and the expected value of a sum s the sum of the expected values: E[c X ] c E[ X ] and E[ X + Y ] E[ X] + E[Y]. () If X 0, then E[ X ] 0. In partcular, E[ Z ] 0 for any random varable Z. Proof. () Let X c wth probablty 1. Then E[c ] c P( X c) c 1 c. () If c 0, then E[c X ] E[0] 0 0 E[ X]. Otherwse, f X has range wth dstnct values { 1,,... }, then c X has range wth dstnct values {c 1, c,... } and P(X c ) P(X ). Hence, E[c X ] c P( X c ) c P( X ) c E[ X ]. Next, let X have range wth dstnct values { 1,,... } and let Y have range wth dstnct values {l 1, l,... }. Then the range of X +Y s the collecton of possble sums { 1 + l 1, 1 + l,..., + l 1, + l,..., j + l 1, j + l,... } (wth some of these values possbly repeatng). Then E[ X +Y ] P( X + Y ) ( + l j ) P( X,Y l j ) P( X, Y l j ) + l j P( X,Y l j ) ( ) P( X,Y l j ) + l j P( X, Y l j ) P( X, Y l j ) + l j P( X ) P(Y l j X ) j P {X Y l j } + P( X ) l j P(Y l j X ) P( X ) + P( X )E[Y X ] E[ X] + E[Y].
5 () Assume that every value n the range of X s non-negatve. Because P(X ) also s non-negatve for every, we have E[ X ] P( X ) 0. Example 3. Fnd the average sum when rollng two dce. Soluton. (Hard way) Let X 1 be the value of one de and let X be the value of the other de. The sum X 1 + X has range {, 3, 4,..., 1}. Then, 1 E[ X 1 + X ] P( X 1 + X ) (Easer) By lnearty we have E[ X 1 + X ] E[X 1 ] + E[ X ] Varance and Standard Devaton Defnton. Let X be a random varable wth µ E[ X] beng fnte. The varance of X s then defned by σ Var( X ) E [(X E[ X]) ] E [( X µ ) ] ( µ ) P( X ). Because the random varable ( X E[ X ]) s non-negatve, ts expected value s nonnegatve. That s, Var( X ) 0. Thus, we can defne the standard devaton of X by σ Var(X). The formal defnton of varance s rarely used n practce. When computng the varance of a dscrete random varable, t s more common to use the followng result: ( ). Theorem 3. Let X be a dscrete random varable. Then Var( X) E[X ] E[ X]
6 Proof. Usng µ E[X] and the propertes of expected value we have Var( X) E [( X µ ) ] E[ X µ X + µ ] E[X ] µ E[ X ] + E[µ ] E[X ] µ + µ E[X ] µ E[X ] (E[ X]). In order to apply ths result, we frst compute E[ X ] P(X ), then compute E[ X ] by E[ X ] P(X ). Then Var( X) E[X ] ( E[ X] ) and σ Var( X). Example 4. Roll a sngle sx-sded de. If you roll a 1, then you get $5. If you roll a or 3, then you get $10. But f you roll a 4, 5, or, then you lose $0. Let X denote your change n fortune. Compute the standard devaton of X. Soluton. As n Ex. 1(c), we have P(X 0) 3, P(X 5) 1, P(X 10) and E[ X ] Then E[ X ] ( 0) Thus, Var( X ) E[X ] ( E[ X ]) , and σ Here we have 0 occurrng half the tme, 5 occurrng one-sxth of the tme, and 10 occurrng one-thrd of the tme. The average value s then about The standard devaton of 14.4 gves a way of measurng the average spread from the mean. The actual values n the range, 0, 5, 10, all dffer from the sngle average value of And n ths case, the average spread from 5.83 s about Example 5. Let m and n be non-negatve ntegers wth m n. Let X be a randomly chosen nteger from m to n. Fnd the mean and varance of X. Soluton. The range of X s the set of ntegers {m,..., n } that has n m +1 elements. Snce X s chosen randomly, each value n the range occurs wth the equal probablty of 1 / (n m +1). Thus, the expected value of X s
7 n E[X] m 1 n m n m n m n m + 1 m + n The varance of X s gven by Var( X) E[X ] ( E[ X] ) n P( X ) m 1 n m n m +1 n(n + 1) 1 n m 1 n m (m 1)m n m + n + m (n + m)(n m) + n + m (n + m)(n m +1) m + n n(n +1)(n + 1) (n m)(n m + ). 1 1 n m +1 n m (m 1) m(m 1) m + n m + n Independent Random Varables Intutvely, we thn of random varables X and Y as beng ndependent when ther values are not affected by each other. That s, the fact that X a has no bearng on whether Y b, and vce versa. We formally defne ndependence as follows: Defnton. Random varables X 1, X,..., X n are ndependent f and only f ( ) P X j a j P {X 1 a 1 } {X a }... {X a } for all possble subsequences X 1,..., X. j1 ( ),
8 Example. Flp a con 3 tmes. Let X count the number of Heads on the th flp. Then X s ether 1 or 0 and the X are ndependent, and the probablty of gettng 3 Heads n a row s P(X 1 1 X 1 X 3 1) P( X 1 1) P(X 1) P(X 3 1) Note: For convenence, we often wrte P(X a X j b) as P(X a, X j b), and we denote that X and Y are ndependent by X Y. Theorem 4. Let X and Y be ndependent. Then E[ X Y] E[ X] E[Y]. Proof. Let X have range wth dstnct values { 1,,... } and let Y have range wth dstnct values {l 1, l,... }. Then the range of X Y s the collecton of possble products { 1 l 1, 1 l,..., l 1, l,..., j l 1, j l,... } Then, E[ X Y] P(X Y ) l j P(X, Y l j ) l j P( X ) P(Y l j ) P( X ) l j P(Y l j ) by ndep. P( X ) l j P(Y l j ) j ( P( X ) E[Y] ) E[Y] P( X ) E[Y] E[ X] E[ X ] E[Y ]. Note: By nducton, the prevous result easly extends to a fnte sequence. That s, f random varables X 1, X,..., X n are ndependent, then E[ X 1 X... X n ] E[ X 1 ] E[ X ]... E[X n ]. Example 7. (a) Roll two dce. What s the average product of the two values? (b) Roll one de. Square the result. What s the average square? How does t compare wth the square of the average roll?
9 Soluton. (a) (Hard Way) Let X 1 be the value of one de and let X be the value of the other de. Then both have range {1,,..., }. So E[ X 1 X ] P(X Y ) l P( X,Y l ) 1 j (Easer) By ndependence we have E[ X 1 X ] E[X 1 ] E[ X ] (b) Now let X be the value on the rolled de. Then X has range 1, 4, 9, 1, 5, 3. So the average square s E[ X ] But E[ X ] (3. 5) Thus, E[ X ] E[ X ]. Notes: () Because X s not ndependent of tself, we cannot say that E[ X ] E[ X X] E[ X ] E[X ]. () Because E[ X ] E[ X ] Var(X ) E[( X µ) ] 0, we always have E[ X ] E[ X]. () If X s the value on a rolled de, then Var( X) E[ X ] E[ X] 91 and σ 35 / Other Facts About Varance Let X and Y be a random varables and let a and b be constants. Then () Var(a) 0 () Var(a X) a Var( X) () Var( X + b) Var(X ) (v) Var(a X + b) a Var(X ) (v) If X and Y are ndependent, then Var( X + Y) Var(X ) + Var(Y).
10 Proofs. () Var(a) E[a ] ( E[a]) a (a) 0. () Var(a X ) E[(aX ) ] (E[aX ]) E[a X ] (a E[X ]) a E[ X ] a ( E[ X ]) ( ) a E[ X ] ( E[X ]) a Var( X ). (v) Smply combne Propertes () and (). (v) E[( X + Y) ] E[ X + XY + Y ] E[ X ] + E[ XY] + E[Y ] E[ X ] + E[ X ]E[Y] + E[Y ] by ndependence Hence, Var( X + Y) E[(X + Y) ] E[ X + Y] [ ] [ ] [ ] ( ) Var( X + b) E (( X + b) E[ X + b] ) E ( X + b E[ X] b) E (( X E[X ]) Var( X). E[ X ] + E[X ]E[Y] + E[Y ] ( E[ X ] + E[Y] ) ( ) E[ X ] + E[X ]E[Y] + E[Y ] E[ X ] + E[ X ]E[Y] + E[Y] E[ X ] E[ X] + E[Y ] E[Y] Var(X ) + Var(Y). Note: If X and Y are ndependent, then Var( X Y) Var( X ) + Var(Y) by Propertes (v) and (). By nducton, Property (v) extends to a fnte sequence. That s, f random varables X 1, X,..., X n are ndependent, then Var( X 1 + X X n ) Var( X 1 ) + Var(X ) Var(X n ).
11 Exercses 1. Draw one card from a standard dec. If you draw a number card ( through 10), then X wll be 10. If you draw a face card, then X wll be 0. If you draw an Ace, then X wll be 30. (a) Compute the mean and standard devaton of X. (b) Compute the condtonal average of X gven that you draw a number card or a face card.. You mae a bet for whch you wn wth probablty p and lose wth probablty q 1 p, where 0 < p < 1. If you wn, you gan $a and f you lose then you drop $b. Let X be your change n fortune so that X s ether +a or b. (a) Derve E[ X ]. (b) The casno wants E[ X ] 0. Use your formula for E[ X ] from (a) to solve for what the payoff a should be to mantan the nequalty E[ X ] Roll two far sx-sded dce and let (ω 1, ω ) denote the resultng par. Defne a random varable X by X ((ω 1, ω )) ω 1 ω. Compute the mean and standard devaton of X. 4. The Fbonacc sequence {F n } s defned by F 1 1, F 1, and F n F n 1 + F n for n 3. Let S be sum of the frst sx Fbonacc numbers. A based sx-sded de s such that the probablty of rollng the value s F / S for 1,,...,. Roll ths de and let X be the value. Compute the mean and standard devaton of X.
Math 426: Probability MWF 1pm, Gasson 310 Homework 4 Selected Solutions
Exercses from Ross, 3, : Math 26: Probablty MWF pm, Gasson 30 Homework Selected Solutons 3, p. 05 Problems 76, 86 3, p. 06 Theoretcal exercses 3, 6, p. 63 Problems 5, 0, 20, p. 69 Theoretcal exercses 2,
More informationLecture 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 informationj) = 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 informationPhysicsAndMathsTutor.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 information3.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 informationExercises of Chapter 2
Exercses of Chapter Chuang-Cheh Ln Department of Computer Scence and Informaton Engneerng, Natonal Chung Cheng Unversty, Mng-Hsung, Chay 61, Tawan. Exercse.6. Suppose that we ndependently roll two standard
More informationRules of Probability
( ) ( ) = for all Corollary: Rules of robablty The probablty of the unon of any two events and B s roof: ( Φ) = 0. F. ( B) = ( ) + ( B) ( B) If B then, ( ) ( B). roof: week 2 week 2 2 Incluson / Excluson
More informationEngineering 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= 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 informationHMMT 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 informationProbability 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 informationxp(x µ) = 0 p(x = 0 µ) + 1 p(x = 1 µ) = µ
CSE 455/555 Sprng 2013 Homework 7: Parametrc Technques Jason J. Corso Computer Scence and Engneerng SUY at Buffalo jcorso@buffalo.edu Solutons by Yngbo Zhou Ths assgnment does not need to be submtted and
More informationPROBABILITY PRIMER. Exercise Solutions
PROBABILITY PRIMER Exercse Solutons 1 Probablty Prmer, Exercse Solutons, Prncples of Econometrcs, e EXERCISE P.1 (b) X s a random varable because attendance s not known pror to the outdoor concert. Before
More informationSELECTED 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 informationBezier curves. Michael S. Floater. August 25, These notes provide an introduction to Bezier curves. i=0
Bezer curves Mchael S. Floater August 25, 211 These notes provde an ntroducton to Bezer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of the
More informationAPPENDIX 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 informationfind (x): given element x, return the canonical element of the set containing x;
COS 43 Sprng, 009 Dsjont Set Unon Problem: Mantan a collecton of dsjont sets. Two operatons: fnd the set contanng a gven element; unte two sets nto one (destructvely). Approach: Canoncal element method:
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016
U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and
More information18.1 Introduction and Recap
CS787: Advanced Algorthms Scrbe: Pryananda Shenoy and Shjn Kong Lecturer: Shuch Chawla Topc: Streamng Algorthmscontnued) Date: 0/26/2007 We contnue talng about streamng algorthms n ths lecture, ncludng
More informationStatistics and Quantitative Analysis U4320. Segment 3: Probability Prof. Sharyn O Halloran
Statstcs and Quanttatve Analyss U430 Segment 3: Probablty Prof. Sharyn O Halloran Revew: Descrptve Statstcs Code book for Measures Sample Data Relgon Employed 1. Catholc 0. Unemployed. Protestant 1. Employed
More informationFoundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationFirst 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 informationLectures - 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 informationprinceton univ. F 13 cos 521: Advanced Algorithm Design Lecture 3: Large deviations bounds and applications Lecturer: Sanjeev Arora
prnceton unv. F 13 cos 521: Advanced Algorthm Desgn Lecture 3: Large devatons bounds and applcatons Lecturer: Sanjeev Arora Scrbe: Today s topc s devaton bounds: what s the probablty that a random varable
More informationMin Cut, Fast Cut, Polynomial Identities
Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.
More informationIntroduction 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 informationA 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 informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More informationIntroduction to Algorithms
Introducton to Algorthms 6.046J/8.40J Lecture 7 Prof. Potr Indyk Data Structures Role of data structures: Encapsulate data Support certan operatons (e.g., INSERT, DELETE, SEARCH) Our focus: effcency of
More informationTHE SUMMATION NOTATION Ʃ
Sngle Subscrpt otaton THE SUMMATIO OTATIO Ʃ Most of the calculatons we perform n statstcs are repettve operatons on lsts of numbers. For example, we compute the sum of a set of numbers, or the sum of the
More informationEconomics 130. Lecture 4 Simple Linear Regression Continued
Economcs 130 Lecture 4 Contnued Readngs for Week 4 Text, Chapter and 3. We contnue wth addressng our second ssue + add n how we evaluate these relatonshps: Where do we get data to do ths analyss? How do
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationBézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0
Bézer curves Mchael S. Floater September 1, 215 These notes provde an ntroducton to Bézer curves. 1 Bernsten polynomals Recall that a real polynomal of a real varable x R, wth degree n, s a functon of
More informationChapter 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 informationCS 798: Homework Assignment 2 (Probability)
0 Sample space Assgned: September 30, 2009 In the IEEE 802 protocol, the congeston wndow (CW) parameter s used as follows: ntally, a termnal wats for a random tme perod (called backoff) chosen n the range
More informationLecture 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 informationn α 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 information8.6 The Complex Number System
8.6 The Complex Number System Earler n the chapter, we mentoned that we cannot have a negatve under a square root, snce the square of any postve or negatve number s always postve. In ths secton we want
More informationAPPROXIMATE PRICES OF BASKET AND ASIAN OPTIONS DUPONT OLIVIER. Premia 14
APPROXIMAE PRICES OF BASKE AND ASIAN OPIONS DUPON OLIVIER Prema 14 Contents Introducton 1 1. Framewor 1 1.1. Baset optons 1.. Asan optons. Computng the prce 3. Lower bound 3.1. Closed formula for the prce
More informationREAL 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 informationFinding Dense Subgraphs in G(n, 1/2)
Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng
More informationa 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 information6.4. RANDOM VARIABLES 233
6.4. RANDOM VARIABLES 2 6.4 Random Varables What are Random Varables? A random varable for an experment wth a sample space S s a functon that assgns a number to each element of S. Typcally nstead of usng
More informationBernoulli Numbers and Polynomials
Bernoull Numbers and Polynomals T. Muthukumar tmk@tk.ac.n 17 Jun 2014 The sum of frst n natural numbers 1, 2, 3,..., n s n n(n + 1 S 1 (n := m = = n2 2 2 + n 2. Ths formula can be derved by notng that
More information20. 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 informationLinear 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 information1.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), it produces a response (output function g (x)
Lnear Systems Revew Notes adapted from notes by Mchael Braun Typcally n electrcal engneerng, one s concerned wth functons of tme, such as a voltage waveform System descrpton s therefore defned n the domans
More informationMore 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 informationModule 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 informationCS-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 informationFirst day August 1, Problems and Solutions
FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve
More informationExercise 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 informationThe 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 informationC/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1
C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned
More informationMATH 5707 HOMEWORK 4 SOLUTIONS 2. 2 i 2p i E(X i ) + E(Xi 2 ) ä i=1. i=1
MATH 5707 HOMEWORK 4 SOLUTIONS CİHAN BAHRAN 1. Let v 1,..., v n R m, all lengths v are not larger than 1. Let p 1,..., p n [0, 1] be arbtrary and set w = p 1 v 1 + + p n v n. Then there exst ε 1,..., ε
More informationNotes 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 information7. 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 informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationHere 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 informationLecture 4: November 17, Part 1 Single Buffer Management
Lecturer: Ad Rosén Algorthms for the anagement of Networs Fall 2003-2004 Lecture 4: November 7, 2003 Scrbe: Guy Grebla Part Sngle Buffer anagement In the prevous lecture we taled about the Combned Input
More informationStanford University CS254: Computational Complexity Notes 7 Luca Trevisan January 29, Notes for Lecture 7
Stanford Unversty CS54: Computatonal Complexty Notes 7 Luca Trevsan January 9, 014 Notes for Lecture 7 1 Approxmate Countng wt an N oracle We complete te proof of te followng result: Teorem 1 For every
More informationInner 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 informationIntroduction to Vapor/Liquid Equilibrium, part 2. Raoult s Law:
CE304, Sprng 2004 Lecture 4 Introducton to Vapor/Lqud Equlbrum, part 2 Raoult s Law: The smplest model that allows us do VLE calculatons s obtaned when we assume that the vapor phase s an deal gas, and
More informationUsing 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 informationMatrix Approximation via Sampling, Subspace Embedding. 1 Solving Linear Systems Using SVD
Matrx Approxmaton va Samplng, Subspace Embeddng Lecturer: Anup Rao Scrbe: Rashth Sharma, Peng Zhang 0/01/016 1 Solvng Lnear Systems Usng SVD Two applcatons of SVD have been covered so far. Today we loo
More informationApplied Stochastic Processes
STAT455/855 Fall 23 Appled Stochastc Processes Fnal Exam, Bref Solutons 1. (15 marks) (a) (7 marks) The dstrbuton of Y s gven by ( ) ( ) y 2 1 5 P (Y y) for y 2, 3,... The above follows because each of
More informationMath 261 Exercise sheet 2
Math 261 Exercse sheet 2 http://staff.aub.edu.lb/~nm116/teachng/2017/math261/ndex.html Verson: September 25, 2017 Answers are due for Monday 25 September, 11AM. The use of calculators s allowed. Exercse
More informationConvergence 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 informationStatistical 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 informationComplex 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 informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 12 10/21/2013. Martingale Concentration Inequalities and Applications
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.65/15.070J Fall 013 Lecture 1 10/1/013 Martngale Concentraton Inequaltes and Applcatons Content. 1. Exponental concentraton for martngales wth bounded ncrements.
More informationAffine 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 informationThe Geometry of Logit and Probit
The Geometry of Logt and Probt Ths short note s meant as a supplement to Chapters and 3 of Spatal Models of Parlamentary Votng and the notaton and reference to fgures n the text below s to those two chapters.
More informationx = , 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 informationand problem sheet 2
-8 and 5-5 problem sheet Solutons to the followng seven exercses and optonal bonus problem are to be submtted through gradescope by :0PM on Wednesday th September 08. There are also some practce problems,
More information4 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 informationSolutions Homework 4 March 5, 2018
1 Solutons Homework 4 March 5, 018 Soluton to Exercse 5.1.8: Let a IR be a translaton and c > 0 be a re-scalng. ˆb1 (cx + a) cx n + a (cx 1 + a) c x n x 1 cˆb 1 (x), whch shows ˆb 1 s locaton nvarant and
More informationMultiple Choice. Choose the one that best completes the statement or answers the question.
ECON 56 Homework Multple Choce Choose the one that best completes the statement or answers the queston ) The probablty of an event A or B (Pr(A or B)) to occur equals a Pr(A) Pr(B) b Pr(A) + Pr(B) f A
More informationSee Book Chapter 11 2 nd Edition (Chapter 10 1 st Edition)
Count Data Models See Book Chapter 11 2 nd Edton (Chapter 10 1 st Edton) Count data consst of non-negatve nteger values Examples: number of drver route changes per week, the number of trp departure changes
More informationLimited 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 information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationE Tail Inequalities. E.1 Markov s Inequality. Non-Lecture E: Tail Inequalities
Algorthms Non-Lecture E: Tal Inequaltes If you hold a cat by the tal you learn thngs you cannot learn any other way. Mar Twan E Tal Inequaltes The smple recursve structure of sp lsts made t relatvely easy
More informationDifference Equations
Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1
More informationThe Expectation-Maximization Algorithm
The Expectaton-Maxmaton Algorthm Charles Elan elan@cs.ucsd.edu November 16, 2007 Ths chapter explans the EM algorthm at multple levels of generalty. Secton 1 gves the standard hgh-level verson of the algorthm.
More informationProbability Theory (revisited)
Probablty Theory (revsted) Summary Probablty v.s. plausblty Random varables Smulaton of Random Experments Challenge The alarm of a shop rang. Soon afterwards, a man was seen runnng n the street, persecuted
More informationStrong 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 informationA be a probability space. A random vector
Statstcs 1: Probablty Theory II 8 1 JOINT AND MARGINAL DISTRIBUTIONS In Probablty Theory I we formulate the concept of a (real) random varable and descrbe the probablstc behavor of ths random varable by
More informationHomework Notes Week 7
Homework Notes Week 7 Math 4 Sprng 4 #4 (a Complete the proof n example 5 that s an nner product (the Frobenus nner product on M n n (F In the example propertes (a and (d have already been verfed so we
More informationLecture 21: Numerical methods for pricing American type derivatives
Lecture 21: Numercal methods for prcng Amercan type dervatves Xaoguang Wang STAT 598W Aprl 10th, 2014 (STAT 598W) Lecture 21 1 / 26 Outlne 1 Fnte Dfference Method Explct Method Penalty Method (STAT 598W)
More informationSUMS PROBLEM COMPETITION, 2001
SUMS PROBLEM COMPETITION, 200 SOLUTIONS Suppose that after n vsts to Aunt Joylene (and therefore also n vsts to Uncle Bruce Lnda has t n ten cent peces and d n dollar cons After a vst to Uncle Bruce she
More informationMATH 829: Introduction to Data Mining and Analysis The EM algorithm (part 2)
1/16 MATH 829: Introducton to Data Mnng and Analyss The EM algorthm (part 2) Domnque Gullot Departments of Mathematcal Scences Unversty of Delaware Aprl 20, 2016 Recall 2/16 We are gven ndependent observatons
More informationMATH 281A: Homework #6
MATH 28A: Homework #6 Jongha Ryu Due date: November 8, 206 Problem. (Problem 2..2. Soluton. If X,..., X n Bern(p, then T = X s a complete suffcent statstc. Our target s g(p = p, and the nave guess suggested
More informationExercises. 18 Algorithms
18 Algorthms Exercses 0.1. In each of the followng stuatons, ndcate whether f = O(g), or f = Ω(g), or both (n whch case f = Θ(g)). f(n) g(n) (a) n 100 n 200 (b) n 1/2 n 2/3 (c) 100n + log n n + (log n)
More informationComplete 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 informationProblem 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 informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationWeek 5: Neural Networks
Week 5: Neural Networks Instructor: Sergey Levne Neural Networks Summary In the prevous lecture, we saw how we can construct neural networks by extendng logstc regresson. Neural networks consst of multple
More informationThe 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 informationHidden Markov Models
Hdden Markov Models Namrata Vaswan, Iowa State Unversty Aprl 24, 204 Hdden Markov Model Defntons and Examples Defntons:. A hdden Markov model (HMM) refers to a set of hdden states X 0, X,..., X t,...,
More information