Final Solutions Fri, June 8
|
|
- Leo Malcolm Foster
- 5 years ago
- Views:
Transcription
1 EE178: Probabilistic Systems Analysis, Spring 2018 Final Solutions Fri, June 8 1. Small problems (62 points) (a) (8 points) Let X 1, X 2,..., X n be independent random variables uniformly distributed on [0, 1]. Let Z = max(x 1, X 2,..., X n ). Find the pdf of Z. Consider the cdf of Z : F Z (z) = Pr(Z z) = Pr(X 1 z, X 2 z... X n z) = n n Pr(X i z) = F Xi (z) The pdf is a derivative of the cdf Z : z n if z [0, 1] = (F X1 (z)) n = 0 if z < 0 1 if z > 1 f Z (z) = d dz F Z(z) = nz n 1 if z [0, 1] 0 otherwise (b) (8 points) I have 10 hats in a box. Each time I go out with my friends, I pick up one of the hats at random and wear it. When I come back home, I put the hat back in the box. If I went out 20 times during this quarter, what is the expected number of hats that I never used? Introduce random variables X i, i = 1, : 1, if hat i was never used X i = A hat is never used if it is not picked up in any of the 20 independent times. The probability of picking a specific hat on a specific day is p = 1/10, thus The expected number of unused hats is Pr(X i = 1) = (1 p) 20 = (0.9) [ 10 ] E X i = 10 E [X i ] = 10 Pr(X i = 1) = 10 (0.9) (c) Let X and Y denote the x and y coordinate of a point that is uniformly chosen over the circumference of a unit circle. (i) (2 points) Are X and Y independent? No. X 2 + Y 2 = 1, thus, by symmetry Pr(X = 1 Y = 0) = Pr(X = 1 Y = 0) = 0.5, while Pr(X = 1) = 0 as X is continuous on [ 1; 1]. Thus Pr(X = 1 Y = 0) Pr(X = 1), which implies dependence.
2 (ii) (2 points) Are X and Y identically distributed? Yes. By symmetry, any rotation doesn t change the distribution and X turns into Y under a rotation by π/2, thus they are identically distributed. (iii) (6 points) What is the variance of X? Hint: no need for lengthy calculations, try to build on your answer for part (ii). X is symmetric around the origin, thus E[X] = 0 According to part (ii), X and Y have the same distribution, thus, E[X 2 ] = E[Y 2 ]. As the points belong to the unit circumference: The variance: E[X 2 + Y 2 ] = 1 = E[X 2 ] + E[Y 2 ] = 1 = E[X 2 ] = 0.5 Var(X) = E[X 2 ] E[X 2 ] = 0.5 (d) You are trying to call your best friend. She answers the phone with probability p and does not answer with probability (1 p). If she answers the phone you engage in a conversation whose duration is an exponential random variable with rate λ. If she does not answer you wait for 5 min and call again. The probability that she answers is again p. If she does not answer you give up, otherwise you engage in a conversation whose duration is again an exponential random variable with rate λ. Let X (in minutes) be the total duration of the experiment, i.e., the total time you spent until you either give up calling your friend or hang up the phone. Recall that the pdf of an exponential random variable with rate λ is given by f Y (y) = λe λy, y 0. (i) (8 points) What are the probabilities of the events X < 5} and X 5}, X = 5} and X = 6}? Let the random variables for i = 1, 2 be 1 if friend answers call i X i =, X i Bern(p) and T Exp(λ) be the length of the conversation (if it was initiated). Note that F T (t) = t 0 f T (x)dx = 1 e λt, Pr(T = t) = 0 for any t as T is a continuous random variable. Pr(X < 5) = Pr(X 1 = 1, T < 5) = pf T (5) = p(1 e 5λ ) Pr(X 5) = Pr(X 1 = 1, T 5) + Pr(X 1 = 0, X 2 = 0) + Pr(X 1 = 0, X 2 = 1, T = 0) = pf T (5) + (1 p) = p(1 e 5λ ) + (1 p) 2 Pr(X = 5) = Pr(X 5) Pr(X < 5) = (1 p) 2 Pr(X = 6) = Pr(X 1 = 1, T = 6) + Pr(X 1 = 0, X 2 = 1, T = 1) = 0 (ii) (10 points) Find and plot the cdf of X. for x < 5 : for x > 5 : F X (x) = Pr(X < x) = Pr(X 1 = 1, T < x) = pf T (x) = p(1 e xλ ) F X (x) = Pr(X < x) = Pr(X 1 = 1, T < x) + Pr(X 1 = 0, X 2 = 1, T < x 5) + Pr(X 1 = X 2 = 0) = pf T (x) + p(1 p)f T (x 5) + (1 p) 2 = p(1 e xλ ) + p(1 p)(1 e (x 5)λ ) + (1 p) 2 = 1 pe xλ p(1 p)e 5λ e xλ
3 for x = 5 : Thus, F X (5) = Pr(X 5) = p(1 e 5λ ) + (1 p) 2 ( F X (x) = p(1 e xλ ) + (1 p) 1 pe (x 5)λ) 1 x 5, where 1 A is the indicator function of A. f X (x) p(1 e 5λ ) +(1 p) 2 p(1 e 5λ ) 5 x (e) (8 points) You choose a point at random on a stick of length L and break the stick into two pieces at this point. What is the probability that the ratio of the shorter to the longer piece is less than 1 3? Let X be the length of the left piece, then L X is the length of the right piece and the ratio of the shorter piece to the longer piece is Y = min X L X, L X X on the stick, thus F X (x) = x/l for x [0, L]. Pr(Y < 1/3) = 1 Pr(Y 1/3), ( X Pr(Y 1/3) = Pr L X 1/3, L X ) X 1/3 = Pr(4X L, 3L 4X) = Pr (X [L/4, 3L/4]) }. Also note that X is uniformly distributed = Pr(X 3L/4) Pr(X < L/4) = F X (3L/4) F X (L/4) = 0.5, Pr(Y < 1/3) = 1 Pr(Y 1/3) = 0.5 (f) (10 points) Assume now that after you break the stick into two at a random point you throw away the piece in your left-hand. Then you take the right-hand piece and break it once again into two at random. What is the pdf of the length of the middle piece you end up with (that does not have any of the original end points)? Let Z be the length of the middle piece and X be the length of the piece in your right hand. Then X is uniformly distributed on [0, L] and Z is uniformly distributed on [0, x] given X = x, thus: for z [0, L] : Finally, f Z (z) = L 0 f Z X (z x)f X (x)dx = f X (x) = 1 x [0,L] L ] f Z X (z x) = 1 z [0,x] x f Z (z) = L 0 1 L z [0,x] xl dx = 1 ln(l/z) dx = z xl L ln(l/z) L, if z [0, L]
4 2. Communication over an Optical Channel (38 points) Consider the problem of communicating one bit of information across an optical fiber, which is equally likely to be 0 or 1. If the bit B = 1, we switch on an LED and its light is carried across the optical fiber to a photodetector at the receiver side. The photodetector outputs the number of photons Y N it detects. If the bit B = 0, we keep the LED off. What makes the problem interesting is that even if the LED is off, the detector is likely to detect some photons (e.g. due to ambient light). A good model is that Y is Poisson distributed with intensity that depends on whether the LED is on or off. Assume that when B = 1 (the LED is on), the number of photons counted by the photodetector is a Poisson random variable with parameter 200 and when B = 0 (the LED is off), the number of photons counted by the photodetector is a Poisson random variable with parameter 50. Remember that a Poisson random variable Y with parameter λ has mean and variance λ, and the following probability distribution: Pr(Y = k) = λk e λ, k = 0, 1, 2,... (a) (10 points) Apply the ML rule to decide on the transmitted bit when the photodetector detects Y = y photons. Reduce the decision rule to a simple threshold form and specify the value of the threshold. Let λ 1 = 200, λ 0 = 50. The decision rule: ˆB = 0 Pr(Y = y B = 1) < P r(y = y B = 0) λy 1 e λ 1 < λy 0 e λ 0 y! y! y ln(λ 1 ) λ 1 < y ln(λ 0 ) λ 0 λ 1 λ 0 y < ln(λ 1 ) ln(λ 0 ) = 150 ˆB = 0 if y if y 109 (b) (4 points) Given that the transmitted bit B = 0. What is the probability that we erroneously declare the bit to be 1, i.e. ˆB = 1? Hint: you can express the result as a summation. Pr( ˆB = 1 B = 0) = Pr(Y 109 B = 0) = k=109 λ k 0 e λ = 1 e 50 (c) (7 points) Use Chebyshev s inequality to provide a bound on the probability in part (b). Let Z be a Poisson random variable with parameter λ 0. Then E[Z] = λ 0 and Var(Z) = λ 0. Y B = 0 has the same distribution as Z, thus Pr( ˆB = 1 B = 0) = Pr(Z 109) = Pr(Z E[Z] 109 E[Z]) Pr( Z E[Z] 109 E[Z]) Var(Z) (109 E[Z]) 2 λ 0 (109 λ 0 ) 2 = (d) (7 points) Use the central limit theorem to provide an approximate estimate for the probability in part (b). Hint: recall that the sum of two independent Poisson random variables with parameters λ and µ is Poisson with parameter λ + µ. If X 1, X 2... X 50 are i. i.d. Poisson with parameter 1, then Z = 50 X i has Poisson distribution with parameter 50. Thus, Pr( ˆB = 1 B = 0) = Pr(Z 109) = Pr k=0 50 k ( Z ) ( ) 59 = Q
5 (e) (10 points) Assume that now the transmission is repeated N times. That is, if B = 1 the receiver observes Y 1,..., Y N, where the Y i s are i.i.d. Poisson(200) random variables, if B = 0 the receiver observes Y 1,..., Y N, where the Y i s are i.i.d. Poisson(50). Use the ML rule to decide on the value of the transmitted bit given a certain observation Y 1 = y 1,..., Y N = y N at the receiver. ˆB = 0 Pr ( N Y i = y i } B = 1 ) < P r ( N Y i = y i } B = 0 ) N λ y i 1 e λ 1 y i! < N λ y i 0 e λ 0 y i! ln(λ 1 ) y i Nλ 1 < ln(λ 0 ) y i Nλ 0 1 N y i < λ 1 λ 0 ln(λ 1 ) ln(λ 0 ) = 150 The decision rule: ˆB = 0 if 1 N N y i < otherwise.
1 Basic continuous random variable problems
Name M362K Final Here are problems concerning material from Chapters 5 and 6. To review the other chapters, look over previous practice sheets for the two exams, previous quizzes, previous homeworks and
More informationMidterm Exam 2 (Solutions)
EECS 6 Probability and Random Processes University of California, Berkeley: Spring 07 Kannan Ramchandran March, 07 Midterm Exam (Solutions) Last name First name SID Name of student on your left: Name of
More informationUC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 9 Spring 2006
UC Berkeley Department of Electrical Engineering and Computer Science EE 6: Probablity and Random Processes Solutions 9 Spring 006 Exam format The second midterm will be held in class on Thursday, April
More informationECE Homework Set 2
1 Solve these problems after Lecture #4: Homework Set 2 1. Two dice are tossed; let X be the sum of the numbers appearing. a. Graph the CDF, FX(x), and the pdf, fx(x). b. Use the CDF to find: Pr(7 X 9).
More informationEECS 70 Discrete Mathematics and Probability Theory Fall 2015 Walrand/Rao Final
EECS 70 Discrete Mathematics and Probability Theory Fall 2015 Walrand/Rao Final PRINT Your Name:, (last) SIGN Your Name: (first) PRINT Your Student ID: CIRCLE your exam room: 220 Hearst 230 Hearst 237
More informationIntroduction to Probability
Introduction to Probability Math 353, Section 1 Fall 212 Homework 9 Solutions 1. During a season, a basketball team plays 7 home games and 6 away games. The coach estimates at the beginning of the season
More informationChapter 3, 4 Random Variables ENCS Probability and Stochastic Processes. Concordia University
Chapter 3, 4 Random Variables ENCS6161 - Probability and Stochastic Processes Concordia University ENCS6161 p.1/47 The Notion of a Random Variable A random variable X is a function that assigns a real
More informationECE 302 Division 2 Exam 2 Solutions, 11/4/2009.
NAME: ECE 32 Division 2 Exam 2 Solutions, /4/29. You will be required to show your student ID during the exam. This is a closed-book exam. A formula sheet is provided. No calculators are allowed. Total
More informationMath 151. Rumbos Spring Solutions to Review Problems for Exam 3
Math 151. Rumbos Spring 2014 1 Solutions to Review Problems for Exam 3 1. Suppose that a book with n pages contains on average λ misprints per page. What is the probability that there will be at least
More informationMidterm Exam 1 Solution
EECS 126 Probability and Random Processes University of California, Berkeley: Fall 2015 Kannan Ramchandran September 22, 2015 Midterm Exam 1 Solution Last name First name SID Name of student on your left:
More informationMATH 407 FINAL EXAM May 6, 2011 Prof. Alexander
MATH 407 FINAL EXAM May 6, 2011 Prof. Alexander Problem Points Score 1 22 2 18 Last Name: First Name: USC ID: Signature: 3 20 4 21 5 27 6 18 7 25 8 28 Total 175 Points total 179 but 175 is maximum. This
More informationTwelfth Problem Assignment
EECS 401 Not Graded PROBLEM 1 Let X 1, X 2,... be a sequence of independent random variables that are uniformly distributed between 0 and 1. Consider a sequence defined by (a) Y n = max(x 1, X 2,..., X
More information1 Basic continuous random variable problems
Name M362K Final Here are problems concerning material from Chapters 5 and 6. To review the other chapters, look over previous practice sheets for the two exams, previous quizzes, previous homeworks and
More informationLecture 11: Probability, Order Statistics and Sampling
5-75: Graduate Algorithms February, 7 Lecture : Probability, Order tatistics and ampling Lecturer: David Whitmer cribes: Ilai Deutel, C.J. Argue Exponential Distributions Definition.. Given sample space
More informationPart I: Discrete Math.
Part I: Discrete Math. 1. Propositions. 10 points. 3/3/4 (a) The following statement expresses the fact that there is a smallest number in the natural numbers, ( y N) ( x N) (y x). Write a statement that
More informationDiscrete Mathematics and Probability Theory Fall 2015 Note 20. A Brief Introduction to Continuous Probability
CS 7 Discrete Mathematics and Probability Theory Fall 215 Note 2 A Brief Introduction to Continuous Probability Up to now we have focused exclusively on discrete probability spaces Ω, where the number
More informationWe introduce methods that are useful in:
Instructor: Shengyu Zhang Content Derived Distributions Covariance and Correlation Conditional Expectation and Variance Revisited Transforms Sum of a Random Number of Independent Random Variables more
More informationCSE 312 Final Review: Section AA
CSE 312 TAs December 8, 2011 General Information General Information Comprehensive Midterm General Information Comprehensive Midterm Heavily weighted toward material after the midterm Pre-Midterm Material
More informationSolutions to Homework Set #3 (Prepared by Yu Xiang) Let the random variable Y be the time to get the n-th packet. Find the pdf of Y.
Solutions to Homework Set #3 (Prepared by Yu Xiang). Time until the n-th arrival. Let the random variable N(t) be the number of packets arriving during time (0,t]. Suppose N(t) is Poisson with pmf p N
More information18.440: Lecture 28 Lectures Review
18.440: Lecture 28 Lectures 18-27 Review Scott Sheffield MIT Outline Outline It s the coins, stupid Much of what we have done in this course can be motivated by the i.i.d. sequence X i where each X i is
More informationHW7 Solutions. f(x) = 0 otherwise. 0 otherwise. The density function looks like this: = 20 if x [10, 90) if x [90, 100]
HW7 Solutions. 5 pts.) James Bond James Bond, my favorite hero, has again jumped off a plane. The plane is traveling from from base A to base B, distance km apart. Now suppose the plane takes off from
More informationMath 151. Rumbos Spring Solutions to Review Problems for Exam 2
Math 5. Rumbos Spring 22 Solutions to Review Problems for Exam 2. Let X and Y be independent Normal(, ) random variables. Put Z = Y X. Compute the distribution functions (z) and (z). Solution: Since X,
More informationUC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Problem Set 8 Fall 2007
UC Berkeley Department of Electrical Engineering and Computer Science EE 6: Probablity and Random Processes Problem Set 8 Fall 007 Issued: Thursday, October 5, 007 Due: Friday, November, 007 Reading: Bertsekas
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 18
EECS 7 Discrete Mathematics and Probability Theory Spring 214 Anant Sahai Note 18 A Brief Introduction to Continuous Probability Up to now we have focused exclusively on discrete probability spaces Ω,
More informationExpectation, Variance and Standard Deviation for Continuous Random Variables Class 6, Jeremy Orloff and Jonathan Bloom
Expectation, Variance and Standard Deviation for Continuous Random Variables Class 6, 8.5 Jeremy Orloff and Jonathan Bloom Learning Goals. Be able to compute and interpret expectation, variance, and standard
More informationMATH2715: Statistical Methods
MATH2715: Statistical Methods Exercises V (based on lectures 9-10, work week 6, hand in lecture Mon 7 Nov) ALL questions count towards the continuous assessment for this module. Q1. If X gamma(α,λ), write
More informationMoments. Raw moment: February 25, 2014 Normalized / Standardized moment:
Moments Lecture 10: Central Limit Theorem and CDFs Sta230 / Mth 230 Colin Rundel Raw moment: Central moment: µ n = EX n ) µ n = E[X µ) 2 ] February 25, 2014 Normalized / Standardized moment: µ n σ n Sta230
More informationRandomized algorithm
Tutorial 4 Joyce 2009-11-24 Outline Solution to Midterm Question 1 Question 2 Question 1 Question 2 Question 3 Question 4 Question 5 Solution to Midterm Solution to Midterm Solution to Midterm Question
More informationExponential Distribution and Poisson Process
Exponential Distribution and Poisson Process Stochastic Processes - Lecture Notes Fatih Cavdur to accompany Introduction to Probability Models by Sheldon M. Ross Fall 215 Outline Introduction Exponential
More informationCME 106: Review Probability theory
: Probability theory Sven Schmit April 3, 2015 1 Overview In the first half of the course, we covered topics from probability theory. The difference between statistics and probability theory is the following:
More informationECE 302 Solution to Homework Assignment 5
ECE 2 Solution to Assignment 5 March 7, 27 1 ECE 2 Solution to Homework Assignment 5 Note: To obtain credit for an answer, you must provide adequate justification. Also, if it is possible to obtain a numeric
More information7 Continuous Variables
7 Continuous Variables 7.1 Distribution function With continuous variables we can again define a probability distribution but instead of specifying Pr(X j) we specify Pr(X < u) since Pr(u < X < u + δ)
More informationTwo hours. Statistical Tables to be provided THE UNIVERSITY OF MANCHESTER. 14 January :45 11:45
Two hours Statistical Tables to be provided THE UNIVERSITY OF MANCHESTER PROBABILITY 2 14 January 2015 09:45 11:45 Answer ALL four questions in Section A (40 marks in total) and TWO of the THREE questions
More informationTutorial 1 : Probabilities
Lund University ETSN01 Advanced Telecommunication Tutorial 1 : Probabilities Author: Antonio Franco Emma Fitzgerald Tutor: Farnaz Moradi January 11, 2016 Contents I Before you start 3 II Exercises 3 1
More informationMassachusetts Institute of Technology
6.4/6.43: Probabilistic Systems Analysis (Fall ) Recitation Solutions October 9,. cov(ax + b,y ) ρ(ax + b,y ) var(ax + b)(var(y )) E[(aX + b E[aX + b])(y E[Y ])] a var(x)var(y ) E[(aX + b ae[x] b)(y E[Y
More informationStat410 Probability and Statistics II (F16)
Stat4 Probability and Statistics II (F6 Exponential, Poisson and Gamma Suppose on average every /λ hours, a Stochastic train arrives at the Random station. Further we assume the waiting time between two
More informationContinuous distributions
CHAPTER 7 Continuous distributions 7.. Introduction A r.v. X is said to have a continuous distribution if there exists a nonnegative function f such that P(a X b) = ˆ b a f(x)dx for every a and b. distribution.)
More informationSTAT509: Continuous Random Variable
University of South Carolina September 23, 2014 Continuous Random Variable A continuous random variable is a random variable with an interval (either finite or infinite) of real numbers for its range.
More informationDiscrete Mathematics and Probability Theory Fall 2013 Vazirani Note 16. A Brief Introduction to Continuous Probability
CS 7 Discrete Mathematics and Probability Theory Fall 213 Vazirani Note 16 A Brief Introduction to Continuous Probability Up to now we have focused exclusively on discrete probability spaces Ω, where the
More informationTopic 4: Continuous random variables
Topic 4: Continuous random variables Course 003, 2018 Page 0 Continuous random variables Definition (Continuous random variable): An r.v. X has a continuous distribution if there exists a non-negative
More informationSDS 321: Practice questions
SDS 2: Practice questions Discrete. My partner and I are one of married couples at a dinner party. The 2 people are given random seats around a round table. (a) What is the probability that I am seated
More informationUCSD ECE250 Handout #27 Prof. Young-Han Kim Friday, June 8, Practice Final Examination (Winter 2017)
UCSD ECE250 Handout #27 Prof. Young-Han Kim Friday, June 8, 208 Practice Final Examination (Winter 207) There are 6 problems, each problem with multiple parts. Your answer should be as clear and readable
More informationECE353: Probability and Random Processes. Lecture 18 - Stochastic Processes
ECE353: Probability and Random Processes Lecture 18 - Stochastic Processes Xiao Fu School of Electrical Engineering and Computer Science Oregon State University E-mail: xiao.fu@oregonstate.edu From RV
More informationUC Berkeley Department of Electrical Engineering and Computer Sciences. EECS 126: Probability and Random Processes
UC Berkeley Department of Electrical Engineering and Computer Sciences EECS 6: Probability and Random Processes Problem Set 3 Spring 9 Self-Graded Scores Due: February 8, 9 Submit your self-graded scores
More informationMath 30530: Introduction to Probability, Fall 2013
Math 353: Introduction to Probability, Fall 3 Midterm Exam II Practice exam solutions. I m taking part in the All-Ireland hay-tossing championship next week (hay-tossing is a real sport in Ireland & Scotland
More informationISyE 6644 Fall 2015 Test #1 Solutions (revised 10/5/16)
1 NAME ISyE 6644 Fall 2015 Test #1 Solutions (revised 10/5/16) You have 85 minutes. You get one cheat sheet. Put your succinct answers below. All questions are 3 points, unless indicated. You get 1 point
More informationEECS 126 Probability and Random Processes University of California, Berkeley: Spring 2017 Kannan Ramchandran March 21, 2017.
EECS 126 Probability and Random Processes University of California, Berkeley: Spring 2017 Kannan Ramchandran March 21, 2017 Midterm Exam 2 Last name First name SID Name of student on your left: Name of
More informationECE302 Exam 2 Version A April 21, You must show ALL of your work for full credit. Please leave fractions as fractions, but simplify them, etc.
ECE32 Exam 2 Version A April 21, 214 1 Name: Solution Score: /1 This exam is closed-book. You must show ALL of your work for full credit. Please read the questions carefully. Please check your answers
More informationChapter 2: Random Variables
ECE54: Stochastic Signals and Systems Fall 28 Lecture 2 - September 3, 28 Dr. Salim El Rouayheb Scribe: Peiwen Tian, Lu Liu, Ghadir Ayache Chapter 2: Random Variables Example. Tossing a fair coin twice:
More informationStatistics 100A Homework 5 Solutions
Chapter 5 Statistics 1A Homework 5 Solutions Ryan Rosario 1. Let X be a random variable with probability density function a What is the value of c? fx { c1 x 1 < x < 1 otherwise We know that for fx to
More information1. Let X be a random variable with probability density function. 1 x < f(x) = 0 otherwise
Name M36K Final. Let X be a random variable with probability density function { /x x < f(x = 0 otherwise Compute the following. You can leave your answers in integral form. (a ( points Find F X (t = P
More informationSTAT/MA 416 Midterm Exam 2 Thursday, October 18, Circle the section you are enrolled in:
STAT/MA 46 Midterm Exam 2 Thursday, October 8, 27 Name Purdue student ID ( digits) Circle the section you are enrolled in: STAT/MA 46-- STAT/MA 46-2- 9: AM :5 AM 3: PM 4:5 PM REC 4 UNIV 23. The testing
More informationSTAT Chapter 5 Continuous Distributions
STAT 270 - Chapter 5 Continuous Distributions June 27, 2012 Shirin Golchi () STAT270 June 27, 2012 1 / 59 Continuous rv s Definition: X is a continuous rv if it takes values in an interval, i.e., range
More informationMATH/STAT 3360, Probability Sample Final Examination Model Solutions
MATH/STAT 3360, Probability Sample Final Examination Model Solutions This Sample examination has more questions than the actual final, in order to cover a wider range of questions. Estimated times are
More informationPerhaps the simplest way of modeling two (discrete) random variables is by means of a joint PMF, defined as follows.
Chapter 5 Two Random Variables In a practical engineering problem, there is almost always causal relationship between different events. Some relationships are determined by physical laws, e.g., voltage
More informationCDA6530: Performance Models of Computers and Networks. Chapter 2: Review of Practical Random
CDA6530: Performance Models of Computers and Networks Chapter 2: Review of Practical Random Variables Definition Random variable (RV)X (R.V.) X: A function on sample space X: S R Cumulative distribution
More information18.440: Lecture 28 Lectures Review
18.440: Lecture 28 Lectures 17-27 Review Scott Sheffield MIT 1 Outline Continuous random variables Problems motivated by coin tossing Random variable properties 2 Outline Continuous random variables Problems
More information8 Laws of large numbers
8 Laws of large numbers 8.1 Introduction We first start with the idea of standardizing a random variable. Let X be a random variable with mean µ and variance σ 2. Then Z = (X µ)/σ will be a random variable
More informationProbability Models. 4. What is the definition of the expectation of a discrete random variable?
1 Probability Models The list of questions below is provided in order to help you to prepare for the test and exam. It reflects only the theoretical part of the course. You should expect the questions
More information1 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 informationMassachusetts Institute of Technology Department of Electrical Engineering & Computer Science 6.041/6.431: Probabilistic Systems Analysis
6.04/6.43: Probabilistic Systems Analysis Question : Multiple choice questions. CLEARLY circle the best answer for each question below. Each question is worth 4 points each, with no partial credit given.
More informationThis does not cover everything on the final. Look at the posted practice problems for other topics.
Class 7: Review Problems for Final Exam 8.5 Spring 7 This does not cover everything on the final. Look at the posted practice problems for other topics. To save time in class: set up, but do not carry
More informationChapter 4: Continuous Random Variable
Chapter 4: Continuous Random Variable Shiwen Shen University of South Carolina 2017 Summer 1 / 57 Continuous Random Variable A continuous random variable is a random variable with an interval (either finite
More information2 Continuous Random Variables and their Distributions
Name: Discussion-5 1 Introduction - Continuous random variables have a range in the form of Interval on the real number line. Union of non-overlapping intervals on real line. - We also know that for any
More informationGeneral Random Variables
1/65 Chia-Ping Chen Professor Department of Computer Science and Engineering National Sun Yat-sen University Probability A general random variable is discrete, continuous, or mixed. A discrete random variable
More informationMAT 271E Probability and Statistics
MAT 7E Probability and Statistics Spring 6 Instructor : Class Meets : Office Hours : Textbook : İlker Bayram EEB 3 ibayram@itu.edu.tr 3.3 6.3, Wednesday EEB 6.., Monday D. B. Bertsekas, J. N. Tsitsiklis,
More informationMath Spring Practice for the final Exam.
Math 4 - Spring 8 - Practice for the final Exam.. Let X, Y, Z be three independnet random variables uniformly distributed on [, ]. Let W := X + Y. Compute P(W t) for t. Honors: Compute the CDF function
More informationTopic 4: Continuous random variables
Topic 4: Continuous random variables Course 3, 216 Page Continuous random variables Definition (Continuous random variable): An r.v. X has a continuous distribution if there exists a non-negative function
More information2. Suppose (X, Y ) is a pair of random variables uniformly distributed over the triangle with vertices (0, 0), (2, 0), (2, 1).
Name M362K Final Exam Instructions: Show all of your work. You do not have to simplify your answers. No calculators allowed. There is a table of formulae on the last page. 1. Suppose X 1,..., X 1 are independent
More informationMAT 271E Probability and Statistics
MAT 271E Probability and Statistics Spring 2011 Instructor : Class Meets : Office Hours : Textbook : Supp. Text : İlker Bayram EEB 1103 ibayram@itu.edu.tr 13.30 16.30, Wednesday EEB? 10.00 12.00, Wednesday
More informationISyE 3044 Fall 2015 Test #1 Solutions
1 NAME ISyE 3044 Fall 2015 Test #1 Solutions You have 85 minutes. You get one cheat sheet. Put your succinct answers below. All questions are 3 points, unless indicated. You get 1 point for writing your
More information1. Consider a random independent sample of size 712 from a distribution with the following pdf. c 1+x. f(x) =
1. Consider a random independent sample of size 712 from a distribution with the following pdf f(x) = c 1+x 0
More informationCS145: Probability & Computing
CS45: Probability & Computing Lecture 5: Concentration Inequalities, Law of Large Numbers, Central Limit Theorem Instructor: Eli Upfal Brown University Computer Science Figure credits: Bertsekas & Tsitsiklis,
More informationRenewal theory and its applications
Renewal theory and its applications Stella Kapodistria and Jacques Resing September 11th, 212 ISP Definition of a Renewal process Renewal theory and its applications If we substitute the Exponentially
More informationChapter 4: Continuous Probability Distributions
Chapter 4: Continuous Probability Distributions Seungchul Baek Department of Statistics, University of South Carolina STAT 509: Statistics for Engineers 1 / 57 Continuous Random Variable A continuous random
More informationCDA6530: Performance Models of Computers and Networks. Chapter 2: Review of Practical Random Variables
CDA6530: Performance Models of Computers and Networks Chapter 2: Review of Practical Random Variables Two Classes of R.V. Discrete R.V. Bernoulli Binomial Geometric Poisson Continuous R.V. Uniform Exponential,
More informationA Probability Primer. A random walk down a probabilistic path leading to some stochastic thoughts on chance events and uncertain outcomes.
A Probability Primer A random walk down a probabilistic path leading to some stochastic thoughts on chance events and uncertain outcomes. Are you holding all the cards?? Random Events A random event, E,
More informationContinuous Distributions
A normal distribution and other density functions involving exponential forms play the most important role in probability and statistics. They are related in a certain way, as summarized in a diagram later
More informationStatistical distributions: Synopsis
Statistical distributions: Synopsis Basics of Distributions Special Distributions: Binomial, Exponential, Poisson, Gamma, Chi-Square, F, Extreme-value etc Uniform Distribution Empirical Distributions Quantile
More informationBasics of Stochastic Modeling: Part II
Basics of Stochastic Modeling: Part II Continuous Random Variables 1 Sandip Chakraborty Department of Computer Science and Engineering, INDIAN INSTITUTE OF TECHNOLOGY KHARAGPUR August 10, 2016 1 Reference
More informationLecture 18. Uniform random variables
18.440: Lecture 18 Uniform random variables Scott Sheffield MIT 1 Outline Uniform random variable on [0, 1] Uniform random variable on [α, β] Motivation and examples 2 Outline Uniform random variable on
More informationProblem Set 7 Due March, 22
EE16: Probability and Random Processes SP 07 Problem Set 7 Due March, Lecturer: Jean C. Walrand GSI: Daniel Preda, Assane Gueye Problem 7.1. Let u and v be independent, standard normal random variables
More informationCDA5530: Performance Models of Computers and Networks. Chapter 2: Review of Practical Random Variables
CDA5530: Performance Models of Computers and Networks Chapter 2: Review of Practical Random Variables Definition Random variable (R.V.) X: A function on sample space X: S R Cumulative distribution function
More informationS n = x + X 1 + X X n.
0 Lecture 0 0. Gambler Ruin Problem Let X be a payoff if a coin toss game such that P(X = ) = P(X = ) = /2. Suppose you start with x dollars and play the game n times. Let X,X 2,...,X n be payoffs in each
More informationExpectation of geometric distribution
Expectation of geometric distribution What is the probability that X is finite? Can now compute E(X): Σ k=1f X (k) = Σ k=1(1 p) k 1 p = pσ j=0(1 p) j = p 1 1 (1 p) = 1 E(X) = Σ k=1k (1 p) k 1 p = p [ Σ
More informationFinal Examination Solutions (Total: 100 points)
Final Examination Solutions (Total: points) There are 4 problems, each problem with multiple parts, each worth 5 points. Make sure you answer all questions. Your answer should be as clear and readable
More informationVariance reduction techniques
Variance reduction techniques Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/ moltchan/modsim/ http://www.cs.tut.fi/kurssit/tlt-2706/ OUTLINE: Simulation with a given confidence;
More informationMATH Solutions to Probability Exercises
MATH 5 9 MATH 5 9 Problem. Suppose we flip a fair coin once and observe either T for tails or H for heads. Let X denote the random variable that equals when we observe tails and equals when we observe
More informationVariance reduction. Michel Bierlaire. Transport and Mobility Laboratory. Variance reduction p. 1/18
Variance reduction p. 1/18 Variance reduction Michel Bierlaire michel.bierlaire@epfl.ch Transport and Mobility Laboratory Variance reduction p. 2/18 Example Use simulation to compute I = 1 0 e x dx We
More informationLecture Notes 5 Convergence and Limit Theorems. Convergence with Probability 1. Convergence in Mean Square. Convergence in Probability, WLLN
Lecture Notes 5 Convergence and Limit Theorems Motivation Convergence with Probability Convergence in Mean Square Convergence in Probability, WLLN Convergence in Distribution, CLT EE 278: Convergence and
More informationCOMPSCI 240: Reasoning Under Uncertainty
COMPSCI 240: Reasoning Under Uncertainty Andrew Lan and Nic Herndon University of Massachusetts at Amherst Spring 2019 Lecture 20: Central limit theorem & The strong law of large numbers Markov and Chebyshev
More informationExpected Values, Exponential and Gamma Distributions
Expected Values, Exponential and Gamma Distributions Sections 5.2 & 5.4 Cathy Poliak, Ph.D. cathy@math.uh.edu Office in Fleming 11c Department of Mathematics University of Houston Lecture 13-3339 Cathy
More informationEssentials on the Analysis of Randomized Algorithms
Essentials on the Analysis of Randomized Algorithms Dimitris Diochnos Feb 0, 2009 Abstract These notes were written with Monte Carlo algorithms primarily in mind. Topics covered are basic (discrete) random
More informationSDS 321: Introduction to Probability and Statistics
SDS 321: Introduction to Probability and Statistics Lecture 17: Continuous random variables: conditional PDF Purnamrita Sarkar Department of Statistics and Data Science The University of Texas at Austin
More informationLecture 3 Continuous Random Variable
Lecture 3 Continuous Random Variable 1 Cumulative Distribution Function Definition Theorem 3.1 For any random variable X, 2 Continuous Random Variable Definition 3 Example Suppose we have a wheel of circumference
More informationMath 50: Final. 1. [13 points] It was found that 35 out of 300 famous people have the star sign Sagittarius.
Math 50: Final 180 minutes, 140 points. No algebra-capable calculators. Try to use your calculator only at the end of your calculation, and show working/reasoning. Please do look up z, t, χ 2 values for
More information2. Variance and Covariance: We will now derive some classic properties of variance and covariance. Assume real-valued random variables X and Y.
CS450 Final Review Problems Fall 08 Solutions or worked answers provided Problems -6 are based on the midterm review Identical problems are marked recap] Please consult previous recitations and textbook
More informationEECS 126 Probability and Random Processes University of California, Berkeley: Spring 2015 Abhay Parekh February 17, 2015.
EECS 126 Probability and Random Processes University of California, Berkeley: Spring 2015 Abhay Parekh February 17, 2015 Midterm Exam Last name First name SID Rules. You have 80 mins (5:10pm - 6:30pm)
More informationChapter 4 Continuous Random Variables and Probability Distributions
Chapter 4 Continuous Random Variables and Probability Distributions Part 3: The Exponential Distribution and the Poisson process Section 4.8 The Exponential Distribution 1 / 21 Exponential Distribution
More informationUCSD ECE 153 Handout #20 Prof. Young-Han Kim Thursday, April 24, Solutions to Homework Set #3 (Prepared by TA Fatemeh Arbabjolfaei)
UCSD ECE 53 Handout #0 Prof. Young-Han Kim Thursday, April 4, 04 Solutions to Homework Set #3 (Prepared by TA Fatemeh Arbabjolfaei). Time until the n-th arrival. Let the random variable N(t) be the number
More information