Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand Final Solutions
|
|
- Aubrey Richard
- 5 years ago
- Views:
Transcription
1 CS 70 Discrete Mathematics ad Probability Theory Fall 2016 Seshia ad Walrad Fial Solutios CS 70, Fall 2016, Fial Solutios 1
2 1 TRUE or FALSE?: 2x8=16 poits Clearly put your aswers i the aswer box o the bottom of this page! This is what is to be graded No eed to justify! Aswer: Note that the aswers provide explaatios for your uderstadig, eve though o such justificatio was required 1 A fiite irreducible Markov chai that ca go from state 1 to itself i oe step is such that P[X = 1] must coverge as Aswer: True, because it is aperiodic 2 We are give a probability space with sample space Ω ad probability P( ) Let {A 1,A 2,,A 5 } be pairwise disjoit evets whose uio is Ω ad let B be aother evet If P[B A 1 ] = 1, the P[A 1 B] P[A k B] for k = 1,,5 Aswer: False For istace, it could be that P(A 1 ) 1 3 You throw 15 balls idepedetly ad uiformly at radom ito 7 bis The, the umber of balls i bis 3 ad 5 are positively correlated Aswer: False They are egatively correlated 4 The umber of ways of distributig 10 idetical smartphoes to Steve, Bill, ad Larry is ( 10 3 ) Aswer: False Stars ad bars, it should be ( 12 2 ) 5 You draw five cards from a perfectly shuffled stadard 52-card deck The probability that the third card is a ace is strictly smaller tha the probability that the first card is a ace Aswer: False These probabilities are equal, by symmetry 6 If Q[Y X] = 3 + 2X, the L[Y X] = 3 + 2X Aswer: True The best liear estimate of Y caot be better tha the best quadratic estimate 7 Assume that E[(Y 3cos(5X) 13cos(7X))cos(X))] = 0 for = 0,1,,9 The the values of a 0,a 1,,a 9 that miimize E((Y a 0 a 1 cos(x) a 2 cos(2x) a 9 cos(9x)) 2 ) are such that a k = 0 for k / {5,7} ad a 5 = 3,a 7 = 13 Aswer: True This is the projectio property 8 Let p be a prime umber The set of all fuctios from {0,1,2,, p 1} to Q is ucoutably ifiite Aswer: False It is coutably ifiite You ca thik of this set as isomorphic to the p-wise cartesia product Q Q Q, ad oe ca eumerate this set i a maer aalogous to Q as covered i class Aswer Box (Aswer TRUE or FALSE i the correspodig box below) Short Aswers: 4x5=20 poits Provide a clear ad cocise justificatio of your aswer 2
3 1 You roll a six-sided balaced die util you get the first 6 How may dots do you accumulate, o average, icludig the 6 o the last roll? Aswer: The average umber of dots o a roll that does ot yield a 6 is ( )/5 = 3 O average, you have to roll the die 6 times to get the first 6, thus five times before the first 6 You the accumulate, o average, = 21 dots (You may have oticed the use of Wald s idetity) 2 Alice, Bob, ad Charles wat to flip a coi to decide who pays for luch, ad wat each to have the same probability of payig However, they oly have a biased coi ad they do t eve kow its bias Explai a mechaism that achieves the objective Aswer: You flip the coi three times If the outcome has a sigle heads, the Alice pays if it is HTT, Bob pays if it is THT, ad Charles pays if it is TTH Otherwise, you igore the outcome ad you repeat the experimet 3 You have to pass two courses i sequece, A the B, to be able to declare CS as your major Whe you take a course for the first time, you pass it with probability 1/2 If you take it for the secod time, you pass it with probability 2/3 If you fail a course twice, you caot declare CS as your major What is the probability that you ca declare CS as your major? Aswer: The probability that you fail course A twice i a row is (1/2)(1/3) = 1/6 Thus, the probability that you pass course A is 5/6 Similarly, the probability that you pass course B is 5/6 Thus, the probability that you ca declare CS as your major is (5/6) 2 = 25/36 70% 4 You pick poits idepedetly ad uiformly at radom iside a uit circle Let Z be the distace of the furthest poit to the ceter What is E(Z)? Aswer: We see that P(Z < z) = P(Z 1 < z) where Z 1 is the distace from the first poit to the ceter of the circle But P(Z 1 < z) = z 2 Thus, P(Z < z) = z 2, so that the pdf of Z is 2z 2 1 1{0 < z < 1} Hece, E(Z) = 1 0 z(2z2 1 )dz = Suppose we draw cards from a stadard 52-card deck without replacemet What is the expected umber of cards we must draw before we get all 13 spades (icludig the last spade)? Aswer: Defie X to be the umber of cards we draw before we get all 13 spades, icludig the last spade Note that X = 52 Y, where Y is the umber of cards that come after all the spades Arbitrarily label all the o-spade cards from 1 to 39 Defie Y i as the idicator variable that deotes whether the o-spade card with label i comes after all the spades The Y = 39 i=1 Y i Note that E(Y i ) = 1 14 This is because if we cosider oly the relative orders of the 13 spades ad the card labelled i, there is a 1 14 chace that the card labelled i comes last Applyig liearity of expectatio, we get E(X) = E(52 Y ) = 52 E(Y ) = = Rollig Dice I: =12 poits Provide a clear ad cocise justificatio of your aswer I this problem, you roll two balaced six-sided dice 1 What is the probability that the umber of dots o the first die is at least twice the umber o the secod die? Aswer: If the secod die yields 1, the there are 5 possibilities for the first die, if it yields 2, there are 3, ad if it yields 3, there is oe Thus, the probability is (1/36)[ ] = 1/4 2 What is the probability that the first die yields 4 if the total umber of dots o the two dice is 8? Aswer: It is P[(4,4) (2,6),(3,5),(4,4),(5,3),(6,2)] = 1/5 3
4 3 What is the probability that the sum is 8 give that the secod die yields 4? Aswer: It is the probability that the first die yields 4, ie, 1/6 4 What is the probability that the umber of dots o the first die is at least as large as o the secod? Aswer: Let X,Y be the umber of dots o the two dice It s easy to see that P(X = Y ) = 1/6 so by symmetry P(X > Y ) = (1 1/6)/2 = 5/12 Thus, P(X Y ) = P(X > Y )+P(X = Y ) = 5/12+1/6 = 7/12 4 Tossig Cois: 6+6= 12 poits Provide a clear ad cocise justificatio of your aswer 1 You are give two cois A ad B Oe is biased with P(H) = 06 ad the secod is fair You do t kow which is biased; it is equally likely to be A or B You flip the pair of cois repeatedly (both each time) util at least oe of the two cois yields H It turs out that you have to flip them 27 times ad that coi A the yields H while coi B yields T What is the probability that A is the biased coi? Aswer: Call F the evet that we described The, Thus, by Bayes Rule, P[F A is biased] = ad P[F A is fair] = P[A is biased F] = = (1/2)P[F A is biased] (1/2)P[F A is biased] + (1/2)P[F A is fair] = = 06 2 You flip a fair coi 10 times Let X be the total umber of heads i the first 5 flips ad Y the total umber of heads i the odd flips, ie, i flips 1,3,5,7, ad 9 (a) Fid E[X Y ] (b) Fid E[Y X] Aswer: Let Z = 1 if coi yields H The, X = Z 1 + Z 2 + Z 3 + Z 4 + Z 5 ad Y = Z 1 + Z 3 + Z 5 + Z 7 + Z 9 (a) Now, E[Z 1 Y ] = Y /5 by symmetry ad E[Z 2 Y ] = 1/2 by idepedece Thus, E[X Y ] = (3/5)Y + 2(1/2) = 1 + (3/5)Y (b) Similarly, E[Z 1 X] = (1/5)X ad E[Z 9 X] = 1/2 Thus, E[Y X] = (3/5)X + 2(1/2) = 1 + (3/5)X 5 Rollig Dice II: 8+6=14 poits Provide a clear ad cocise justificatio of your aswer 1 You roll a six-sided balaced die util either you get a 6 or the umber of dots o a roll exceeds the umber of dots o the previous roll How may rolls do you eed, o average? Write the equatios that you have to solve to fid the aswer Do ot solve the equatios Aswer: Let β() be the average umber of rolls you still eed, give that the last roll yielded dots ad let β be the total average umber of rolls Thus β(6) = 0 ad the first step equatios are β = 1 + (1/6) β() = 1 + (1/6) 5 =1 m=1 β() β(), = 1,,5 4
5 2 You have a die ad wat to check if it is balaced To do this, you decide to test the mea You roll the die 10 4 times ad fid a average umber of dots per roll equal to 32 (a) Usig Chebyshev s iequality ad a simple upper boud o the variace, fid a 95% cofidece iterval for the mea (Hit: It ca be show that variace is bouded by 36) (b) Are you 95% sure that the die is ot balaced? Aswer: (a) We kow that this iterval is 32 ± 45 σ = 32 ± σ It remais to fid a upper boud o σ Sice X E(X) 6, we coclude that var(x) 36, ie, σ 6 Hece, a 95% cofidece iterval is 32 ± , ie, 32 ± 027 (b) Yes, because 35 is ot i this iterval 6 Graphs ad Chais: 8+6=14 poits Provide a clear ad cocise justificatio of your aswer 1 Imagie you are traversig a 3-dimesioal hypercube Begiig at the vertex 000, you repeatedly radomly pick ay outgoig edge from your curret vertex ad follow it to aother vertex What is the expected umber of edges you must traverse before reachig the vertex 111 for the first time? Aswer: Our jourey ca be modeled as a Markov Chai with odes 0, 1, 2, ad 3, where ode i is the collectio of odes with i oes i it That is, ode 0 cosists of vertex 000; ode 1 cosists of vertices 001, 010, ad 100; ode 2 cosists of vertices 110, 101, ad 011; ad ode 3 cosists of vertex 111 We wat to fid E(X 0 ), where X i deotes the umber of edges we must traverse from ode i to ode 3 We ca costruct the followig equatios: E(X 0 ) = 1 + E(X 1 ) E(X 1 ) = E(X 2) E(X 0) E(X 2 ) = E(X 1) E(X 3) E(X 3 ) = 0 Solvig this liear system of equatios, we get E(X 0 ) = 10 2 Cosider a Markov chai o {0,1} with P(0,1) = α = P(1,0) for some α [0,1] Let X 0,X 1,X 2,,X be the successive values of the Markov chai (i) Propose a method to estimate α (ii) Usig Chebyshev s iequality, what is a 95% cofidece iterval for α Aswer: (i) We ote that the Markov chai flips with probability α at each step, idepedetly Thus, we let Y m = 1{X m 1 X m } = X m 1 X m ad we see that these are iid ad equal to oe with probability α ad to zero otherwise Hece, our estimate is A = Y 1 + +Y (ii) As we kow by lookig at coi flips, a 95% cofidece iterval for α is A ± 225, usig Chebyshev (We ca replace 225 by 1 for large by the CLT, but you are ot expected to remember this) 5
6 7 Erdos-Reyi Radom Graph: =12 poits Provide a clear ad cocise justificatio of your aswer Radom graph model is a key idea i etwork aalysis Erdos-Reyi Graph Model is the most popular ad simplest etwork model Suppose you have vertices ad you leave them ucoected at the begiig The for every two vertices, you draw a udirected edge with probability p (p is a fixed umber for all edges) Suppose we label all the vertices i a order 1, 2,, 1 Prove that i ay E-R graph, if u is a vertex of odd degree i, the there exists a path from u to aother vertex v of the graph where v also has odd degree A path is a sequece of edges (v 1,v 2 ),(v 2,v 3 ),, (v 2,v 1 ), (v 1,v ), where o vertex is repeated Aswer: We will build a path that does ot reuse ay edges As we build the path, imagie erasig the edge we used to leave so that we will ot use it agai Begi at vertex u ad select a arbitrary path away from it This will be the first compoet of the path If, at ay poit, the path reaches a vertex of odd degree, we will be doe, but each time we arrive at a vertex of eve degree, we are guarateed that there is aother vertex out, ad, havig left, we effectively erase two edges from that meet at the vertex Sice the vertex origially was of eve degree, comig i ad goig out reduces its degree by two, so it remais eve I this way, there is always a way to cotiue whe we arrive at a vertex of eve degree Sice there are oly a fiite umber of edges, the tour must ed evetually, ad the oly way it ca ed is if we arrive at a vertex of odd degree 2 What s the probability that there are 0 paths of legth 2 coectig vertices 1 ad 2? Aswer: Let I(v,w) be the idicator that there is a edge coectig the vertices v ad w Usig idepedece of the edges we compute: v=3 (1 P[(I(1,v) = 1)I(v,2) = 1)]) = (1 p 2 ) ( 2) 3 Let X l be the umber of paths of legth l coectig vertices 1 ad 2 What s the expectatio ad variace of X 2? Aswer: We say that there exists a path of legth l coectig two give vertices v w if there exist vertices v 1,,v l 1 such that v v 1 v 2 v l 1 w, where v w meas that there is a edge betwee v ad w By defiitios we have Takig expectatio yields Now we compute E(X 2 2 ): E(X 2 2 ) = = v,w=3 v=3 E(X 2 ) = X 2 = v=3 v=3 E[1(1 v 2)1(1 v 2)] P(1 v)p(v 2) + 1(1 v,v 2) P(1 v)p(v 2) = ( 2)p 2 v,w=3:v w = ( 2)p 2 + ( 2)( 3)p 4 P(1 v)p(v 2)P(1 w)p(w 2) 6
7 So the variace of X 2 becomes: Var(X 2 ) = E(X2 2 ) E(X 2 ) 2 = ( 2)p 2 + ( 2)( 3)p 4 [( 2)p 2 ] 2 = ( 2)(1 p 2 )p 2 4 What s the expectatio of X l? (You should give a expressio i terms of, p ad l ad you could leave a summatio, itegral or product if that s easier to write the fial aswer) Aswer: By defiitios we have X l = 1(1 v 1,v 1 v 2,,v l 1 2) where the sum is over ordered but distict vertices v i take from the set {3,,} Let s first thik about how may ways to choose l + 1 vertices (to form a path of legth l) from : ( l+1) = ( 1) ( l) The situatio i this problem is slightly differet where you eed to fix the first two vertices to be 1 ad 2 respectively So the total umber of ways to choose vertices from becomes ( 2)( 3) ( l) Takig expectatio yields E(X l ) = P(1 v 1,v 1 v 2,,v l 1 2) = P(1 v 1 )P(v 1 v 2 ) P(v l 1 2) = ( 2)( 3)( l)p l 8 Pollig for 2020: 10 poits Provide a clear ad cocise justificatio of your aswer We poll 100 me ad 200 wome Amog those, 30 me ad 160 wome declare they would vote for Michelle Obama for Presidet i 2020 Assume that, amog the voters i the geeral electio, there will be a equal umber of me ad wome ad that your poll is represetative of the votig i the geeral electio What is your 95% cofidece iterval for the fractio of people who will vote for Michelle? Would you advise her to ru? Justify your aswer To solve this problem, we suggest that you follow the followig steps: (1) What is your estimate of the fractio of the people who will vote for Michelle i the geeral electio? (2) What is its variace?; (3) What is a upper boud o that variace?; (4) Write dow Chebyshev ad use the upper boud; (5) Choose the distace from the mea so that the Chebyshev boud is 5%; (6) What is the resultig cofidece iterval? Aswer: Let X be the idicators that me vote for Michelle ad Y for wome Thus, we kow that V := 100 =1 X = 30 ad W := 200 =1 Y = 160 (1) The fractio of people votig for Michelle is p := E(X 1 +Y 1 )/2 Thus, a good estimate is Z := V /200 + W/400 sice E(Z) = p Now, (2) Oe has σ 2 := var(z) = 1 (200) 2 var(v ) + 1 (400) 2 var(w) = var(x 1) var(y 1) 7
8 (3) Sice var(x 1 ) 1/4 ad var(y 1 ) 1/4, oe has (4) Accordig to Chebyshev, (5) If we wat this probability to be 5%, we eed σ 2 ( )1 4 = P( Z E(Z) > ε) σ 2 ε ε ε 2 = 5% = 1 20, so that ε 2 = = = 2% (6) Thus, a 95% cofidece iterval is Z ± 2% = ( )/2 ± 2% = 055 ± 002 = [053,057] Yes, I would advise Michelle to ru The probability she would wi is larger tha 95% 9 Radom Variables: =30 poits Provide a clear ad cocise justificatio of your aswer 1 Defie radom variable i oe setece (No eed for a justificatio) Aswer: A radom variable is a real-valued fuctio of the outcome of a radom experimet 2 Let X, 1 be iid with mea µ ad variace σ 2 Let also A = (X X )/ (a) Usig Chebyshev, fid a 90% cofidece iterval for µ (b) Apply this result to the situatio where the X are 1 whe a coi yields H ad zero otherwise Aswer: (a) We have P( A µ > ε) σ 2 ε 2 We choose ε so that the right-had side is 01 This gives σ 2 ε 2 = 01, ie, ε2 = 10 σ 2 Thus, ε = 10σ/ The 90% cofidece iterval is the A ± 10 σ (b) For coi flips, µ = p ad σ 1/2 Hece, the 90% cofidece iterval for p is A ± 2 A ± 16 3 You choose a poit (X,Y ) uiformly at radom i the triagle with vertices ( 1,0),(0,1),(1,0) (a) Fid E[Y X] (b) Fid L[Y X] (c) Are X ad Y positively-, egatively-, or u-correlated? Aswer: (a) Give that X = x, we kow that Y = U[0,1 x ] Hece, E[Y X] = (1/2)(1 X ) (b) By symmetry, L[Y X] is costat Therefore, it must be equal to E[Y ] Now, P(Y > y) = (1 y) 2, sice this happes whe (X,Y ) falls i a triagle with base 2(1 y) ad height (1 y) Thus, f Y (y) = 2(1 y), so that E[Y ] = 1 0 2y(1 y)dy = 1/3, as we might have guessed Hece, L[Y X] = 1/3 (c) Sice LLSE is a costat, clearly X ad Y are ucorrelated Or we ca do a computatio We kow that E((Y L[Y X])X) = 0, so that E(XY ) = E(XL[Y X]) = (1/3)E[X] = 0 Thus, E(XY ) = 0 = E(X)E(Y ) ad X,Y are ucorrelated 8 10
9 4 Let Y ad Z be idepedet radom variables where Y is Poisso with mea 60 ad Z is Poisso with mea 10 (a) Fid L[Y X] where X = Y + Z (b) Fid E[Y X] (Hit: Recall that if V is Poisso with mea λ, the E(V ) = λ ad var(v ) = λ Also, recall that the sum of Poisso idepedet radom variables is Poisso) Aswer: (a) We kow that L[Y X] = E(Y ) + cov(x,y ) (X E(X)) var(x) Now, E(Y ) = 60 ad E(X) = E(Y ) + E(Z) = 70 Also, var(x) = var(y ) + var(z) = 70 Fially, Hece, cov(x,y ) = cov(y + Z,Y ) = var(y ) = 60 L[Y X] = (X 70) = 6 7 X (b) Let Z,Z 1,,Z 6 be idepedet ad Poisso with mea 10 We ca write Y = Z 1 + +Z 6 because this sum is Poisso with mea 60 ad idepedet of Z The, X = Z Z 6 + Z ad oe has by symmetry E[Y X] = E[Z Z 6 Z Z 6 + Z] = 6 7 (Z Z 6 + Z) = 6 7 X, 5 Let X be a discrete radom variable that takes values i [0,1] Show that its variace is at most 1/4 Hit: Show that the radom variable that takes at most differet values i (0,1) ad that has the largest variace is Beroulli 1/2 To do this, argue by cotradictio ad assume that X takes a value x i [05,1) with probability p Replace that value by 1 with probability 1/2 ad 2x 1 with probability 1/2 Show that the variace icreases Aswer: The mea does ot chage It suffices to show that the mea value of the square icreases This is the case because i the calculatio of E(X 2 ) the term x 2 p gets replaced by (p/2)(1) 2 + (p/2)(2x 1) 2 But x 2 < 1/2 + (1/2)(2x 1) 2 (Scratch space) 9
Problem Set 2 Solutions
CS271 Radomess & Computatio, Sprig 2018 Problem Set 2 Solutios Poit totals are i the margi; the maximum total umber of poits was 52. 1. Probabilistic method for domiatig sets 6pts Pick a radom subset S
More informationThis exam contains 19 pages (including this cover page) and 10 questions. A Formulae sheet is provided with the exam.
Probability ad Statistics FS 07 Secod Sessio Exam 09.0.08 Time Limit: 80 Miutes Name: Studet ID: This exam cotais 9 pages (icludig this cover page) ad 0 questios. A Formulae sheet is provided with the
More informationRandomized Algorithms I, Spring 2018, Department of Computer Science, University of Helsinki Homework 1: Solutions (Discussed January 25, 2018)
Radomized Algorithms I, Sprig 08, Departmet of Computer Sciece, Uiversity of Helsiki Homework : Solutios Discussed Jauary 5, 08). Exercise.: Cosider the followig balls-ad-bi game. We start with oe black
More informationDiscrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 19
CS 70 Discrete Mathematics ad Probability Theory Sprig 2016 Rao ad Walrad Note 19 Some Importat Distributios Recall our basic probabilistic experimet of tossig a biased coi times. This is a very simple
More informationf X (12) = Pr(X = 12) = Pr({(6, 6)}) = 1/36
Probability Distributios A Example With Dice If X is a radom variable o sample space S, the the probablity that X takes o the value c is Similarly, Pr(X = c) = Pr({s S X(s) = c} Pr(X c) = Pr({s S X(s)
More informationFinal Review for MATH 3510
Fial Review for MATH 50 Calculatio 5 Give a fairly simple probability mass fuctio or probability desity fuctio of a radom variable, you should be able to compute the expected value ad variace of the variable
More informationLecture Chapter 6: Convergence of Random Sequences
ECE5: Aalysis of Radom Sigals Fall 6 Lecture Chapter 6: Covergece of Radom Sequeces Dr Salim El Rouayheb Scribe: Abhay Ashutosh Doel, Qibo Zhag, Peiwe Tia, Pegzhe Wag, Lu Liu Radom sequece Defiitio A ifiite
More information7.1 Convergence of sequences of random variables
Chapter 7 Limit theorems Throughout this sectio we will assume a probability space (Ω, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite
More informationn outcome is (+1,+1, 1,..., 1). Let the r.v. X denote our position (relative to our starting point 0) after n moves. Thus X = X 1 + X 2 + +X n,
CS 70 Discrete Mathematics for CS Sprig 2008 David Wager Note 9 Variace Questio: At each time step, I flip a fair coi. If it comes up Heads, I walk oe step to the right; if it comes up Tails, I walk oe
More information7.1 Convergence of sequences of random variables
Chapter 7 Limit Theorems Throughout this sectio we will assume a probability space (, F, P), i which is defied a ifiite sequece of radom variables (X ) ad a radom variable X. The fact that for every ifiite
More informationDiscrete Mathematics and Probability Theory Fall 2016 Walrand Probability: An Overview
CS 70 Discrete Mathematics ad Probability Theory Fall 2016 Walrad Probability: A Overview Probability is a fasciatig theory. It provides a precise, clea, ad useful model of ucertaity. The successes of
More information( ) = p and P( i = b) = q.
MATH 540 Radom Walks Part 1 A radom walk X is special stochastic process that measures the height (or value) of a particle that radomly moves upward or dowward certai fixed amouts o each uit icremet of
More informationPRACTICE PROBLEMS FOR THE FINAL
PRACTICE PROBLEMS FOR THE FINAL Math 36Q Fall 25 Professor Hoh Below is a list of practice questios for the Fial Exam. I would suggest also goig over the practice problems ad exams for Exam ad Exam 2 to
More informationLecture 2 February 8, 2016
MIT 6.854/8.45: Advaced Algorithms Sprig 206 Prof. Akur Moitra Lecture 2 February 8, 206 Scribe: Calvi Huag, Lih V. Nguye I this lecture, we aalyze the problem of schedulig equal size tasks arrivig olie
More informationDiscrete Mathematics and Probability Theory Summer 2014 James Cook Note 15
CS 70 Discrete Mathematics ad Probability Theory Summer 2014 James Cook Note 15 Some Importat Distributios I this ote we will itroduce three importat probability distributios that are widely used to model
More informationLecture 2: Concentration Bounds
CSE 52: Desig ad Aalysis of Algorithms I Sprig 206 Lecture 2: Cocetratio Bouds Lecturer: Shaya Oveis Ghara March 30th Scribe: Syuzaa Sargsya Disclaimer: These otes have ot bee subjected to the usual scrutiy
More informationUNIT 2 DIFFERENT APPROACHES TO PROBABILITY THEORY
UNIT 2 DIFFERENT APPROACHES TO PROBABILITY THEORY Structure 2.1 Itroductio Objectives 2.2 Relative Frequecy Approach ad Statistical Probability 2. Problems Based o Relative Frequecy 2.4 Subjective Approach
More informationLecture 12: November 13, 2018
Mathematical Toolkit Autum 2018 Lecturer: Madhur Tulsiai Lecture 12: November 13, 2018 1 Radomized polyomial idetity testig We will use our kowledge of coditioal probability to prove the followig lemma,
More informationf X (12) = Pr(X = 12) = Pr({(6, 6)}) = 1/36
Probability Distributios A Example With Dice If X is a radom variable o sample space S, the the probability that X takes o the value c is Similarly, Pr(X = c) = Pr({s S X(s) = c}) Pr(X c) = Pr({s S X(s)
More informationProblems from 9th edition of Probability and Statistical Inference by Hogg, Tanis and Zimmerman:
Math 224 Fall 2017 Homework 4 Drew Armstrog Problems from 9th editio of Probability ad Statistical Iferece by Hogg, Tais ad Zimmerma: Sectio 2.3, Exercises 16(a,d),18. Sectio 2.4, Exercises 13, 14. Sectio
More informationMath 216A Notes, Week 5
Math 6A Notes, Week 5 Scribe: Ayastassia Sebolt Disclaimer: These otes are ot early as polished (ad quite possibly ot early as correct) as a published paper. Please use them at your ow risk.. Thresholds
More informationHOMEWORK 2 SOLUTIONS
HOMEWORK SOLUTIONS CSE 55 RANDOMIZED AND APPROXIMATION ALGORITHMS 1. Questio 1. a) The larger the value of k is, the smaller the expected umber of days util we get all the coupos we eed. I fact if = k
More informationAn Introduction to Randomized Algorithms
A Itroductio to Radomized Algorithms The focus of this lecture is to study a radomized algorithm for quick sort, aalyze it usig probabilistic recurrece relatios, ad also provide more geeral tools for aalysis
More informationMassachusetts Institute of Technology
Solutios to Quiz : Sprig 006 Problem : Each of the followig statemets is either True or False. There will be o partial credit give for the True False questios, thus ay explaatios will ot be graded. Please
More informationMA131 - Analysis 1. Workbook 3 Sequences II
MA3 - Aalysis Workbook 3 Sequeces II Autum 2004 Cotets 2.8 Coverget Sequeces........................ 2.9 Algebra of Limits......................... 2 2.0 Further Useful Results........................
More informationDistribution of Random Samples & Limit theorems
STAT/MATH 395 A - PROBABILITY II UW Witer Quarter 2017 Néhémy Lim Distributio of Radom Samples & Limit theorems 1 Distributio of i.i.d. Samples Motivatig example. Assume that the goal of a study is to
More informationDiscrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 22
CS 70 Discrete Mathematics for CS Sprig 2007 Luca Trevisa Lecture 22 Aother Importat Distributio The Geometric Distributio Questio: A biased coi with Heads probability p is tossed repeatedly util the first
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Lecture 16
EECS 70 Discrete Mathematics ad Probability Theory Sprig 2014 Aat Sahai Lecture 16 Variace Questio: Let us retur oce agai to the questio of how may heads i a typical sequece of coi flips. Recall that we
More information10-701/ Machine Learning Mid-term Exam Solution
0-70/5-78 Machie Learig Mid-term Exam Solutio Your Name: Your Adrew ID: True or False (Give oe setece explaatio) (20%). (F) For a cotiuous radom variable x ad its probability distributio fuctio p(x), it
More informationHOMEWORK I: PREREQUISITES FROM MATH 727
HOMEWORK I: PREREQUISITES FROM MATH 727 Questio. Let X, X 2,... be idepedet expoetial radom variables with mea µ. (a) Show that for Z +, we have EX µ!. (b) Show that almost surely, X + + X (c) Fid the
More informationDiscrete Mathematics and Probability Theory Spring 2012 Alistair Sinclair Note 15
CS 70 Discrete Mathematics ad Probability Theory Sprig 2012 Alistair Siclair Note 15 Some Importat Distributios The first importat distributio we leared about i the last Lecture Note is the biomial distributio
More informationRandom Variables, Sampling and Estimation
Chapter 1 Radom Variables, Samplig ad Estimatio 1.1 Itroductio This chapter will cover the most importat basic statistical theory you eed i order to uderstad the ecoometric material that will be comig
More informationAdvanced Stochastic Processes.
Advaced Stochastic Processes. David Gamarik LECTURE 2 Radom variables ad measurable fuctios. Strog Law of Large Numbers (SLLN). Scary stuff cotiued... Outlie of Lecture Radom variables ad measurable fuctios.
More informationMath 10A final exam, December 16, 2016
Please put away all books, calculators, cell phoes ad other devices. You may cosult a sigle two-sided sheet of otes. Please write carefully ad clearly, USING WORDS (ot just symbols). Remember that the
More informationProblem Cosider the curve give parametrically as x = si t ad y = + cos t for» t» ß: (a) Describe the path this traverses: Where does it start (whe t =
Mathematics Summer Wilso Fial Exam August 8, ANSWERS Problem 1 (a) Fid the solutio to y +x y = e x x that satisfies y() = 5 : This is already i the form we used for a first order liear differetial equatio,
More informationLecture 01: the Central Limit Theorem. 1 Central Limit Theorem for i.i.d. random variables
CSCI-B609: A Theorist s Toolkit, Fall 06 Aug 3 Lecture 0: the Cetral Limit Theorem Lecturer: Yua Zhou Scribe: Yua Xie & Yua Zhou Cetral Limit Theorem for iid radom variables Let us say that we wat to aalyze
More informationCS322: Network Analysis. Problem Set 2 - Fall 2009
Due October 9 009 i class CS3: Network Aalysis Problem Set - Fall 009 If you have ay questios regardig the problems set, sed a email to the course assistats: simlac@staford.edu ad peleato@staford.edu.
More information4. Partial Sums and the Central Limit Theorem
1 of 10 7/16/2009 6:05 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 4. Partial Sums ad the Cetral Limit Theorem The cetral limit theorem ad the law of large umbers are the two fudametal theorems
More informationDiscrete Mathematics for CS Spring 2005 Clancy/Wagner Notes 21. Some Important Distributions
CS 70 Discrete Mathematics for CS Sprig 2005 Clacy/Wager Notes 21 Some Importat Distributios Questio: A biased coi with Heads probability p is tossed repeatedly util the first Head appears. What is the
More informationTopic 8: Expected Values
Topic 8: Jue 6, 20 The simplest summary of quatitative data is the sample mea. Give a radom variable, the correspodig cocept is called the distributioal mea, the epectatio or the epected value. We begi
More informationDiscrete Mathematics for CS Spring 2008 David Wagner Note 22
CS 70 Discrete Mathematics for CS Sprig 2008 David Wager Note 22 I.I.D. Radom Variables Estimatig the bias of a coi Questio: We wat to estimate the proportio p of Democrats i the US populatio, by takig
More information(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m?
MATH 529 The Boudary Problem The drukard s walk (or boudary problem) is oe of the most famous problems i the theory of radom walks. Oe versio of the problem is described as follows: Suppose a particle
More informationMath 525: Lecture 5. January 18, 2018
Math 525: Lecture 5 Jauary 18, 2018 1 Series (review) Defiitio 1.1. A sequece (a ) R coverges to a poit L R (writte a L or lim a = L) if for each ǫ > 0, we ca fid N such that a L < ǫ for all N. If the
More information0, otherwise. EX = E(X 1 + X n ) = EX j = np and. Var(X j ) = np(1 p). Var(X) = Var(X X n ) =
PROBABILITY MODELS 35 10. Discrete probability distributios I this sectio, we discuss several well-ow discrete probability distributios ad study some of their properties. Some of these distributios, lie
More informationRandom Models. Tusheng Zhang. February 14, 2013
Radom Models Tusheg Zhag February 14, 013 1 Radom Walks Let me describe the model. Radom walks are used to describe the motio of a movig particle (object). Suppose that a particle (object) moves alog the
More informationThe picture in figure 1.1 helps us to see that the area represents the distance traveled. Figure 1: Area represents distance travelled
1 Lecture : Area Area ad distace traveled Approximatig area by rectagles Summatio The area uder a parabola 1.1 Area ad distace Suppose we have the followig iformatio about the velocity of a particle, how
More informationProbability for mathematicians INDEPENDENCE TAU
Probability for mathematicias INDEPENDENCE TAU 2013 28 Cotets 3 Ifiite idepedet sequeces 28 3a Idepedet evets........................ 28 3b Idepedet radom variables.................. 33 3 Ifiite idepedet
More informationACO Comprehensive Exam 9 October 2007 Student code A. 1. Graph Theory
1. Graph Theory Prove that there exist o simple plaar triagulatio T ad two distict adjacet vertices x, y V (T ) such that x ad y are the oly vertices of T of odd degree. Do ot use the Four-Color Theorem.
More informationPH 425 Quantum Measurement and Spin Winter SPINS Lab 1
PH 425 Quatum Measuremet ad Spi Witer 23 SPIS Lab Measure the spi projectio S z alog the z-axis This is the experimet that is ready to go whe you start the program, as show below Each atom is measured
More informationLecture 19: Convergence
Lecture 19: Covergece Asymptotic approach I statistical aalysis or iferece, a key to the success of fidig a good procedure is beig able to fid some momets ad/or distributios of various statistics. I may
More informationLecture 4: April 10, 2013
TTIC/CMSC 1150 Mathematical Toolkit Sprig 01 Madhur Tulsiai Lecture 4: April 10, 01 Scribe: Haris Agelidakis 1 Chebyshev s Iequality recap I the previous lecture, we used Chebyshev s iequality to get a
More informationCS 330 Discussion - Probability
CS 330 Discussio - Probability March 24 2017 1 Fudametals of Probability 11 Radom Variables ad Evets A radom variable X is oe whose value is o-determiistic For example, suppose we flip a coi ad set X =
More informationExpectation and Variance of a random variable
Chapter 11 Expectatio ad Variace of a radom variable The aim of this lecture is to defie ad itroduce mathematical Expectatio ad variace of a fuctio of discrete & cotiuous radom variables ad the distributio
More informationAxioms of Measure Theory
MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that
More informationACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER / Statistics
ACCESS TO SCIENCE, ENGINEERING AND AGRICULTURE: MATHEMATICS 1 MATH00030 SEMESTER 1 018/019 DR. ANTHONY BROWN 8. Statistics 8.1. Measures of Cetre: Mea, Media ad Mode. If we have a series of umbers the
More informationEE 4TM4: Digital Communications II Probability Theory
1 EE 4TM4: Digital Commuicatios II Probability Theory I. RANDOM VARIABLES A radom variable is a real-valued fuctio defied o the sample space. Example: Suppose that our experimet cosists of tossig two fair
More informationProblem Set 4 Due Oct, 12
EE226: Radom Processes i Systems Lecturer: Jea C. Walrad Problem Set 4 Due Oct, 12 Fall 06 GSI: Assae Gueye This problem set essetially reviews detectio theory ad hypothesis testig ad some basic otios
More informationLecture 2: Monte Carlo Simulation
STAT/Q SCI 43: Itroductio to Resamplig ethods Sprig 27 Istructor: Ye-Chi Che Lecture 2: ote Carlo Simulatio 2 ote Carlo Itegratio Assume we wat to evaluate the followig itegratio: e x3 dx What ca we do?
More informationMA131 - Analysis 1. Workbook 2 Sequences I
MA3 - Aalysis Workbook 2 Sequeces I Autum 203 Cotets 2 Sequeces I 2. Itroductio.............................. 2.2 Icreasig ad Decreasig Sequeces................ 2 2.3 Bouded Sequeces..........................
More informationSTAT Homework 2 - Solutions
STAT-36700 Homework - Solutios Fall 08 September 4, 08 This cotais solutios for Homework. Please ote that we have icluded several additioal commets ad approaches to the problems to give you better isight.
More informationSTAT Homework 1 - Solutions
STAT-36700 Homework 1 - Solutios Fall 018 September 11, 018 This cotais solutios for Homework 1. Please ote that we have icluded several additioal commets ad approaches to the problems to give you better
More informationEcon 325/327 Notes on Sample Mean, Sample Proportion, Central Limit Theorem, Chi-square Distribution, Student s t distribution 1.
Eco 325/327 Notes o Sample Mea, Sample Proportio, Cetral Limit Theorem, Chi-square Distributio, Studet s t distributio 1 Sample Mea By Hiro Kasahara We cosider a radom sample from a populatio. Defiitio
More informationOptimally Sparse SVMs
A. Proof of Lemma 3. We here prove a lower boud o the umber of support vectors to achieve geeralizatio bouds of the form which we cosider. Importatly, this result holds ot oly for liear classifiers, but
More informationNotes for Lecture 11
U.C. Berkeley CS78: Computatioal Complexity Hadout N Professor Luca Trevisa 3/4/008 Notes for Lecture Eigevalues, Expasio, ad Radom Walks As usual by ow, let G = (V, E) be a udirected d-regular graph with
More informationApproximations and more PMFs and PDFs
Approximatios ad more PMFs ad PDFs Saad Meimeh 1 Approximatio of biomial with Poisso Cosider the biomial distributio ( b(k,,p = p k (1 p k, k λ: k Assume that is large, ad p is small, but p λ at the limit.
More informationMathematical Statistics - MS
Paper Specific Istructios. The examiatio is of hours duratio. There are a total of 60 questios carryig 00 marks. The etire paper is divided ito three sectios, A, B ad C. All sectios are compulsory. Questios
More informationJanuary 25, 2017 INTRODUCTION TO MATHEMATICAL STATISTICS
Jauary 25, 207 INTRODUCTION TO MATHEMATICAL STATISTICS Abstract. A basic itroductio to statistics assumig kowledge of probability theory.. Probability I a typical udergraduate problem i probability, we
More informationMATH 320: Probability and Statistics 9. Estimation and Testing of Parameters. Readings: Pruim, Chapter 4
MATH 30: Probability ad Statistics 9. Estimatio ad Testig of Parameters Estimatio ad Testig of Parameters We have bee dealig situatios i which we have full kowledge of the distributio of a radom variable.
More informationMa 530 Introduction to Power Series
Ma 530 Itroductio to Power Series Please ote that there is material o power series at Visual Calculus. Some of this material was used as part of the presetatio of the topics that follow. What is a Power
More informationQuick Review of Probability
Quick Review of Probability Berli Che Departmet of Computer Sciece & Iformatio Egieerig Natioal Taiwa Normal Uiversity Refereces: 1. W. Navidi. Statistics for Egieerig ad Scietists. Chapter 2 & Teachig
More informationPRACTICE PROBLEMS FOR THE FINAL
PRACTICE PROBLEMS FOR THE FINAL Math 36Q Sprig 25 Professor Hoh Below is a list of practice questios for the Fial Exam. I would suggest also goig over the practice problems ad exams for Exam ad Exam 2
More informationLecture 2. The Lovász Local Lemma
Staford Uiversity Sprig 208 Math 233A: No-costructive methods i combiatorics Istructor: Ja Vodrák Lecture date: Jauary 0, 208 Origial scribe: Apoorva Khare Lecture 2. The Lovász Local Lemma 2. Itroductio
More informationConvergence of random variables. (telegram style notes) P.J.C. Spreij
Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space
More information1 of 7 7/16/2009 6:06 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 6. Order Statistics Defiitios Suppose agai that we have a basic radom experimet, ad that X is a real-valued radom variable
More informationLearning Theory: Lecture Notes
Learig Theory: Lecture Notes Kamalika Chaudhuri October 4, 0 Cocetratio of Averages Cocetratio of measure is very useful i showig bouds o the errors of machie-learig algorithms. We will begi with a basic
More information6.3 Testing Series With Positive Terms
6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial
More informationMath 116 Second Midterm November 13, 2017
Math 6 Secod Midterm November 3, 7 EXAM SOLUTIONS. Do ot ope this exam util you are told to do so.. Do ot write your ame aywhere o this exam. 3. This exam has pages icludig this cover. There are problems.
More informationEcon 325 Notes on Point Estimator and Confidence Interval 1 By Hiro Kasahara
Poit Estimator Eco 325 Notes o Poit Estimator ad Cofidece Iterval 1 By Hiro Kasahara Parameter, Estimator, ad Estimate The ormal probability desity fuctio is fully characterized by two costats: populatio
More informationMathematics 170B Selected HW Solutions.
Mathematics 17B Selected HW Solutios. F 4. Suppose X is B(,p). (a)fidthemometgeeratigfuctiom (s)of(x p)/ p(1 p). Write q = 1 p. The MGF of X is (pe s + q), sice X ca be writte as the sum of idepedet Beroulli
More informationSample Midterm This midterm consists of 10 questions. The rst seven questions are multiple choice; the remaining three
CS{74 Combiatorics & Discrete Probability, Fall 97 Sample Midterm :30{:00pm, 7 October Read these istructios carefully. This is a closed book exam. Calculators are permitted.. This midterm cosists of 0
More informationMATH 304: MIDTERM EXAM SOLUTIONS
MATH 304: MIDTERM EXAM SOLUTIONS [The problems are each worth five poits, except for problem 8, which is worth 8 poits. Thus there are 43 possible poits.] 1. Use the Euclidea algorithm to fid the greatest
More informationSeunghee Ye Ma 8: Week 5 Oct 28
Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value
More informationMath 61CM - Solutions to homework 3
Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig
More informationQuick Review of Probability
Quick Review of Probability Berli Che Departmet of Computer Sciece & Iformatio Egieerig Natioal Taiwa Normal Uiversity Refereces: 1. W. Navidi. Statistics for Egieerig ad Scietists. Chapter & Teachig Material.
More informationLecture 2: April 3, 2013
TTIC/CMSC 350 Mathematical Toolkit Sprig 203 Madhur Tulsiai Lecture 2: April 3, 203 Scribe: Shubhedu Trivedi Coi tosses cotiued We retur to the coi tossig example from the last lecture agai: Example. Give,
More informationAMS570 Lecture Notes #2
AMS570 Lecture Notes # Review of Probability (cotiued) Probability distributios. () Biomial distributio Biomial Experimet: ) It cosists of trials ) Each trial results i of possible outcomes, S or F 3)
More informationCS / MCS 401 Homework 3 grader solutions
CS / MCS 401 Homework 3 grader solutios assigmet due July 6, 016 writte by Jāis Lazovskis maximum poits: 33 Some questios from CLRS. Questios marked with a asterisk were ot graded. 1 Use the defiitio of
More informationSequences I. Chapter Introduction
Chapter 2 Sequeces I 2. Itroductio A sequece is a list of umbers i a defiite order so that we kow which umber is i the first place, which umber is i the secod place ad, for ay atural umber, we kow which
More informationFrequentist Inference
Frequetist Iferece The topics of the ext three sectios are useful applicatios of the Cetral Limit Theorem. Without kowig aythig about the uderlyig distributio of a sequece of radom variables {X i }, for
More informationApplication to Random Graphs
A Applicatio to Radom Graphs Brachig processes have a umber of iterestig ad importat applicatios. We shall cosider oe of the most famous of them, the Erdős-Réyi radom graph theory. 1 Defiitio A.1. Let
More informationIntroduction to Probability. Ariel Yadin
Itroductio to robability Ariel Yadi Lecture 2 *** Ja. 7 ***. Covergece of Radom Variables As i the case of sequeces of umbers, we would like to talk about covergece of radom variables. There are may ways
More informationLecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting
Lecture 6 Chi Square Distributio (χ ) ad Least Squares Fittig Chi Square Distributio (χ ) Suppose: We have a set of measuremets {x 1, x, x }. We kow the true value of each x i (x t1, x t, x t ). We would
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 19 11/17/2008 LAWS OF LARGE NUMBERS II THE STRONG LAW OF LARGE NUMBERS
MASSACHUSTTS INSTITUT OF TCHNOLOGY 6.436J/5.085J Fall 2008 Lecture 9 /7/2008 LAWS OF LARG NUMBRS II Cotets. The strog law of large umbers 2. The Cheroff boud TH STRONG LAW OF LARG NUMBRS While the weak
More informationStochastic Simulation
Stochastic Simulatio 1 Itroductio Readig Assigmet: Read Chapter 1 of text. We shall itroduce may of the key issues to be discussed i this course via a couple of model problems. Model Problem 1 (Jackso
More informationNotes 5 : More on the a.s. convergence of sums
Notes 5 : More o the a.s. covergece of sums Math 733-734: Theory of Probability Lecturer: Sebastie Roch Refereces: Dur0, Sectios.5; Wil9, Sectio 4.7, Shi96, Sectio IV.4, Dur0, Sectio.. Radom series. Three-series
More information(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3
MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special
More informationA sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as
More informationComplex Numbers Solutions
Complex Numbers Solutios Joseph Zoller February 7, 06 Solutios. (009 AIME I Problem ) There is a complex umber with imagiary part 64 ad a positive iteger such that Fid. [Solutio: 697] 4i + + 4i. 4i 4i
More informationIntroduction to probability Stochastic Process Queuing systems. TELE4642: Week2
Itroductio to probability Stochastic Process Queuig systems TELE4642: Week2 Overview Refresher: Probability theory Termiology, defiitio Coditioal probability, idepedece Radom variables ad distributios
More informationOn Random Line Segments in the Unit Square
O Radom Lie Segmets i the Uit Square Thomas A. Courtade Departmet of Electrical Egieerig Uiversity of Califoria Los Ageles, Califoria 90095 Email: tacourta@ee.ucla.edu I. INTRODUCTION Let Q = [0, 1] [0,
More information