Transformations and Expectations
|
|
- Virgil Greene
- 6 years ago
- Views:
Transcription
1 Transformations and Expectations 1 Distributions of Functions of a Random Variable If is a random variable with cdf F (x), then any function of, say g(), is also a random variable. Sine Y = g() is a function of, we can describe the probabilistic behavior of Y in terms of that of. That is, for any set A, P (Y A) = P (g() A), Showing that the distribution of Y depends on the function F and g. Formally, if we write y = g(x), the function g(x) defines a mapping from the original sample space of,, to a new sample space, Y, the sample space of the random variable Y. That is, g(x) : Y. Conveniently, we can write = {x : f (x) > 0} and Y = {y : y = g(x) for some x C}. (1) The pdf of is positive only on the set and is 0 elsewhere. Such a set is called the support set or support of a distribution. We associate with g an inverse mapping, denoted by g 1, which is a mapping from subsets of Y to subsets of, and is defined by g 1 (A) = {x : g(x) A}. It is possible for A to be a point set, say A = {y}. Then g 1 ({y}) = {x : g(x) = y}. In this case, we often write g 1 (y) instead of g 1 ({y}). The probability distribution of Y can be defined as follows. For any set A Y, P (Y A) = P (g() A) = P ({x : g(x) A}) = P ( g 1 (A)). 1
2 It is straightforward to show that this probability function satisfies the Kolmogorov Axioms. If is a discrete random variable, then is countable. The sample space for Y = g() is Y = {y : y = g(x), x }, which is also a countable set. variable. The pmf for Y is f Y (y) = P (Y = y) = = x g 1 (y) f (x), x g 1 (y) Thus, Y is also a discrete random P ( = x) for y Y and f Y (y) = 0 for y / Y. In this case, finding the pmf of Y involves simply identifying g 1 (y), for each y Y, and summing the appropriate probabilities. Example 1.1 (Binomial transformation) A discrete random variable has a binomial distribution if its pmf is of the form f (x) = P ( = x) = where n is a positive integer and 0 p 1. ( ) n p x (1 p) n x, x = 0, 1,..., n, x g(x) = n x. Thus, g 1 (y) is the single point x = n y, and f Y (y) = f (x) = f (n y) x g 1 (y) Consider the random variable Y = g(), where ( ) n = p n y (1 p) n (n y) n y ( ) n = (1 p) y p n y. y Thus, we see that Y also has a binomial distribution, but with parameters n and 1 p. If and Y are continuous random variables, the cdf of Y = g() is F Y (y) = P (Y y) = P (g() y) = P ({x : g(x) y}) = {x :g(x) y} f (x)dx. Sometimes there may be difficulty in identifying {x : g(x) y} and carrying out the integration of F (x) over this region. Example 1.2 (Uniform transformation) Suppose has a uniform distribution on the interval (0, 2π), that is, 1/(2π) 0 < x < 2π f (x) = 0 otherwise. 2
3 Consider Y = sin 2 (). Then P (Y y) = P ( x 1 ) + P (x 2 x 3 ) + P ( x 4 ) = 2P ( x 1 ) + 2P (x 2 π), where x 1 and x 2 are the two solutions to sin 2 (x) = y, 0 < x < π. Thus, even though this example dealt with a seemingly simple situation, the cdf of Y was not simple. It is easiest to deal with functions g(x) that are monotone, that is, those that satisfy either u > v g(u) > g(v) (increasing) or u < v g(u) > g(v) (decreasing). If g is monotone, then g 1 is single-valued; that is, g 1 (y) = x if and only if y = g(x). If g is increasing, this implies that {x : g(x) y} = {x : x g 1 (y)}. If g is decreasing, this implies that {x : g(x) y} = {x : x g 1 (y)}. If g(x) is increasing, we can write F Y (y) = {x :x g 1 (y)} If g(x) is decreasing, we have F Y (y) = f (x)dx = g 1 (y) g 1 (y) f (x)dx = 1 F (g 1 (y)). f (x)dx = F (g 1 (y)). The continuity of is used to obtain the second equality. following theorem. We summarize these results in the Theorem 1.1 Let have cdf F (x), let Y = g(), and let and Y be defined as in (1). a. If g is an increasing function on, F Y (y) = F (g 1 (y)) for y Y. b. If g is a decreasing function on and is a continuous random variable, F Y (y) = 1 F (g 1 (y)) for y Y. 3
4 Example 1.3 (Uniform-exponential relationship-i) Suppose f (x) = 1 if 0 < x < 1 and 0 otherwise, the uniform(0,1) distribution. It is straightforward to check that F (x) = x, 0 < x < 1. We now make the transformation Y = g() = log(). Since d dx g(x) = 1 < 0, for 0 < x < 1, x g(x) is a decreasing function. Therefore, for y > 0, F Y (y) = 1 F (g 1 (y)) = 1 F (e y ) = 1 e y. Of course, F Y (y) = 0 for y 0. If the pdf of Y is continuous, it can be obtained by differentiating the cdf. Theorem 1.2 Let have pdf f (x) and Y = g(), where g is a monotone function. Let and Y be define by (1). Suppose that f (x) is continuous on and that g 1 (y) has a continuous derivative on Y. Then the pdf of Y is given by f (g 1 (y)) d dy f Y (y) = g 1 (y) y Y 0 otherwise. Proof: From Theorem 1.1 we have, by the chain rule, f Y (y) = d dy F f (g 1 (y)) d Y (y) = f (g 1 (y)) d dy g 1 (y) dy g 1 (y) if g is increasing if g is decreasing. Example 1.4 (Inverted gamma pdf) Let f (x) be the gamma pdf f(x) = 1 (n 1)!β n xn 1 e x/β, 0 < x <, where β is a positive constant and n is a positive integer. If we let y = g(x) = 1/x, then g 1 (y) = 1/y and d dy g 1 (y) = 1/y 2. Applying the above theorem, for 0 < y <, we get f Y (y) = f (g 1 (y)) d dy g 1 (y) 1 (1 ) n 1e 1/(βy) = 1 (n 1)!β n y y 2 1 (1 ) n+1e = 1/(βy) (n 1)!β n, y a special case of a pdf known as the inverted gamma pdf. 4
5 Theorem 1.3 Let have pdf F (x), let Y = g(), and define the sample space as in (1). Suppose there exists a partition, A 0, A 1,..., A k, of such that P ( A 0 ) = 0 and f (x) is continuous on each A i. Further, suppose there exist functions g 1 (x),..., g k (x), defined on A 1,..., A k, respectively, satisfying i. g(x) = g i (x), for x A i, ii. g i (x) is monotone on A i, iii. the set Y = {y : y = g i (x) for some x A i } is the same for each i = 1,..., k, and iv. g 1 i (y) has a continuous derivative on Y, for each i = 1,..., k. Then k i=1 f Y (y) = f (gi 1 (y)) d dy g 1 i (y) y Y 0 otherwise. Example 1.5 (Normal-Chi squared relationship) Let have the standard normal distribution f (x) = 1 2π e x2 /2, < x <. Consider Y = 2. The function g(x) = x 2 is monotone on (, 0) and (0, ). The set Y = (0, ). Applying Theorem 1.3, we take The pdf of Y is A 1 = (, 0), g 1 (x) = x 2, g 1 1 (y) = y; A 2 = (0, ), g 2 (x) = x 2, g 1 2 (y) = y. A 0 = {0}; f Y (y) = 1 e ( y) 2 /2 1 2π 2 y + 1 e ( y) 2 /2 1 2π 2 y = 1 2π 1 y e y/2, 0 < y <. So Y is a chi-squared random variable with 1 degree of freedom. by Let F 1 denote the inverse of the cdf F. If F is strictly increasing, then F 1 is well defined F 1 (y) = x F (x) = y. (2) 5
6 However, if F is constant on some interval, then F 1 is not well defined by (2). The problem is avoided by defining F 1 (y) for 0 < y < 1 by F 1 (y) = inf{x : F (x) y}. (3) At the end point of the range of y, F 1 (1) = if F (x) < 1 for all x and, for any F, F 1 (0) =. Theorem 1.4 (Probability integral transformation) Let have continuous cdf F (x) and define the random variable Y as Y = F (). Then Y is uniformly distributed on (0, 1), that is, P (Y y) = y, 0 < y < 1. Proof: For Y = F () we have, for 0 < y < 1, P (Y y) = P (F () y) = P (F 1 [F ()] F 1 (y)) = P ( F 1 (y)) = F (F 1 (y)) = y. At the endpoints we have P (Y y) = 1 for y 1 and P (Y y) = 0 for y 0, showing that Y has a uniform distribution. The reasoning behind the equality P (F 1 [F ()] F 1 1 (y)) = P ( F (y)) is somewhat subtle and deserves additional attention. If F is strictly increasing, then it is true that F 1 (F (x)) = x. However, if F is flat, it may be that F 1 (F (x)) x. Then F 1 (F (x)) = x 1, since P ( x) = P ( x 1 ) for any x [x 1, x 2 ]. The flat cdf denotes a region of 0 probability P (x 1 < x) = F (x) F (x 1 ) = 0. 2 Expected values Definition 2.1 The expected value or mean of a random variable g(), denoted by Eg(), is Eg() = g(x)f (x)dx if is continuous x g(x)f (x) = x g(x)p ( = x) if is discrete, provided that the integral or sum exists. If E g() =, we say that Eg() does not exist. 6
Mathematical Statistics 1 Math A 6330
Mathematical Statistics 1 Math A 6330 Chapter 2 Transformations and Expectations Mohamed I. Riffi Department of Mathematics Islamic University of Gaza September 14, 2015 Outline 1 Distributions of Functions
More informationLecture 3: Random variables, distributions, and transformations
Lecture 3: Random variables, distributions, and transformations Definition 1.4.1. A random variable X is a function from S into a subset of R such that for any Borel set B R {X B} = {ω S : X(ω) B} is an
More informationNorthwestern University Department of Electrical Engineering and Computer Science
Northwestern University Department of Electrical Engineering and Computer Science EECS 454: Modeling and Analysis of Communication Networks Spring 2008 Probability Review As discussed in Lecture 1, probability
More information3 Continuous Random Variables
Jinguo Lian Math437 Notes January 15, 016 3 Continuous Random Variables Remember that discrete random variables can take only a countable number of possible values. On the other hand, a continuous random
More informationp. 6-1 Continuous Random Variables p. 6-2
Continuous Random Variables Recall: For discrete random variables, only a finite or countably infinite number of possible values with positive probability (>). Often, there is interest in random variables
More information2 Functions of random variables
2 Functions of random variables A basic statistical model for sample data is a collection of random variables X 1,..., X n. The data are summarised in terms of certain sample statistics, calculated as
More informationContinuous Random Variables and Continuous Distributions
Continuous Random Variables and Continuous Distributions Continuous Random Variables and Continuous Distributions Expectation & Variance of Continuous Random Variables ( 5.2) The Uniform Random Variable
More information1 Joint and marginal distributions
DECEMBER 7, 204 LECTURE 2 JOINT (BIVARIATE) DISTRIBUTIONS, MARGINAL DISTRIBUTIONS, INDEPENDENCE So far we have considered one random variable at a time. However, in economics we are typically interested
More informationLecture 4. Continuous Random Variables and Transformations of Random Variables
Math 408 - Mathematical Statistics Lecture 4. Continuous Random Variables and Transformations of Random Variables January 25, 2013 Konstantin Zuev (USC) Math 408, Lecture 4 January 25, 2013 1 / 13 Agenda
More informationSample Spaces, Random Variables
Sample Spaces, Random Variables Moulinath Banerjee University of Michigan August 3, 22 Probabilities In talking about probabilities, the fundamental object is Ω, the sample space. (elements) in Ω are denoted
More informationChapter 3 sections. SKIP: 3.10 Markov Chains. SKIP: pages Chapter 3 - continued
Chapter 3 sections 3.1 Random Variables and Discrete Distributions 3.2 Continuous Distributions 3.3 The Cumulative Distribution Function 3.4 Bivariate Distributions 3.5 Marginal Distributions 3.6 Conditional
More informationRandom Variables and Their Distributions
Chapter 3 Random Variables and Their Distributions A random variable (r.v.) is a function that assigns one and only one numerical value to each simple event in an experiment. We will denote r.vs by capital
More informationContinuous Random Variables
Continuous Random Variables Recall: For discrete random variables, only a finite or countably infinite number of possible values with positive probability. Often, there is interest in random variables
More informationCh3. Generating Random Variates with Non-Uniform Distributions
ST4231, Semester I, 2003-2004 Ch3. Generating Random Variates with Non-Uniform Distributions This chapter mainly focuses on methods for generating non-uniform random numbers based on the built-in standard
More informationChapter 3 sections. SKIP: 3.10 Markov Chains. SKIP: pages Chapter 3 - continued
Chapter 3 sections Chapter 3 - continued 3.1 Random Variables and Discrete Distributions 3.2 Continuous Distributions 3.3 The Cumulative Distribution Function 3.4 Bivariate Distributions 3.5 Marginal Distributions
More informationProbability and Distributions
Probability and Distributions What is a statistical model? A statistical model is a set of assumptions by which the hypothetical population distribution of data is inferred. It is typically postulated
More informationMath 3215 Intro. Probability & Statistics Summer 14. Homework 5: Due 7/3/14
Math 325 Intro. Probability & Statistics Summer Homework 5: Due 7/3/. Let X and Y be continuous random variables with joint/marginal p.d.f. s f(x, y) 2, x y, f (x) 2( x), x, f 2 (y) 2y, y. Find the conditional
More informationLECTURE 3 RANDOM VARIABLES, CUMULATIVE DISTRIBUTION FUNCTIONS (CDFs)
OCTOBER 6, 2014 LECTURE 3 RANDOM VARIABLES, CUMULATIVE DISTRIBUTION FUNCTIONS (CDFs) 1 Random Variables Random experiments typically require verbal descriptions, and arguments involving events are often
More information14.30 Introduction to Statistical Methods in Economics Spring 2009
MIT OpenCourseWare http://ocw.mit.edu 4.30 Introduction to Statistical Methods in Economics Spring 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
More informationLecture Notes 1 Probability and Random Variables. Conditional Probability and Independence. Functions of a Random Variable
Lecture Notes 1 Probability and Random Variables Probability Spaces Conditional Probability and Independence Random Variables Functions of a Random Variable Generation of a Random Variable Jointly Distributed
More informationLecture Notes 1 Probability and Random Variables. Conditional Probability and Independence. Functions of a Random Variable
Lecture Notes 1 Probability and Random Variables Probability Spaces Conditional Probability and Independence Random Variables Functions of a Random Variable Generation of a Random Variable Jointly Distributed
More informationRandom variables. DS GA 1002 Probability and Statistics for Data Science.
Random variables DS GA 1002 Probability and Statistics for Data Science http://www.cims.nyu.edu/~cfgranda/pages/dsga1002_fall17 Carlos Fernandez-Granda Motivation Random variables model numerical quantities
More information1.1 Review of Probability Theory
1.1 Review of Probability Theory Angela Peace Biomathemtics II MATH 5355 Spring 2017 Lecture notes follow: Allen, Linda JS. An introduction to stochastic processes with applications to biology. CRC Press,
More informationLecture 5: Moment generating functions
Lecture 5: Moment generating functions Definition 2.3.6. The moment generating function (mgf) of a random variable X is { x e tx f M X (t) = E(e tx X (x) if X has a pmf ) = etx f X (x)dx if X has a pdf
More informationChapter 1. Sets and probability. 1.3 Probability space
Random processes - Chapter 1. Sets and probability 1 Random processes Chapter 1. Sets and probability 1.3 Probability space 1.3 Probability space Random processes - Chapter 1. Sets and probability 2 Probability
More informationLecture 1: August 28
36-705: Intermediate Statistics Fall 2017 Lecturer: Siva Balakrishnan Lecture 1: August 28 Our broad goal for the first few lectures is to try to understand the behaviour of sums of independent random
More informationLogarithmic, Exponential, and Other Transcendental Functions
5 Logarithmic, Exponential, and Other Transcendental Functions Copyright Cengage Learning. All rights reserved. 1 5.3 Inverse Functions Copyright Cengage Learning. All rights reserved. 2 Objectives Verify
More informationDS-GA 1002 Lecture notes 2 Fall Random variables
DS-GA 12 Lecture notes 2 Fall 216 1 Introduction Random variables Random variables are a fundamental tool in probabilistic modeling. They allow us to model numerical quantities that are uncertain: the
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 informationReview 1: STAT Mark Carpenter, Ph.D. Professor of Statistics Department of Mathematics and Statistics. August 25, 2015
Review : STAT 36 Mark Carpenter, Ph.D. Professor of Statistics Department of Mathematics and Statistics August 25, 25 Support of a Random Variable The support of a random variable, which is usually denoted
More informationLectures on Elementary Probability. William G. Faris
Lectures on Elementary Probability William G. Faris February 22, 2002 2 Contents 1 Combinatorics 5 1.1 Factorials and binomial coefficients................. 5 1.2 Sampling with replacement.....................
More informationSTAT 830 Hypothesis Testing
STAT 830 Hypothesis Testing Richard Lockhart Simon Fraser University STAT 830 Fall 2018 Richard Lockhart (Simon Fraser University) STAT 830 Hypothesis Testing STAT 830 Fall 2018 1 / 30 Purposes of These
More informationReview: mostly probability and some statistics
Review: mostly probability and some statistics C2 1 Content robability (should know already) Axioms and properties Conditional probability and independence Law of Total probability and Bayes theorem Random
More informationHW Solution 12 Due: Dec 2, 9:19 AM
ECS 315: Probability and Random Processes 2015/1 HW Solution 12 Due: Dec 2, 9:19 AM Lecturer: Prapun Suksompong, Ph.D. Problem 1. Let X E(3). (a) For each of the following function g(x). Indicate whether
More informationMA/ST 810 Mathematical-Statistical Modeling and Analysis of Complex Systems
MA/ST 810 Mathematical-Statistical Modeling and Analysis of Complex Systems Review of Basic Probability The fundamentals, random variables, probability distributions Probability mass/density functions
More informationSTAT 830 Hypothesis Testing
STAT 830 Hypothesis Testing Hypothesis testing is a statistical problem where you must choose, on the basis of data X, between two alternatives. We formalize this as the problem of choosing between two
More informationSTAT 3610: Review of Probability Distributions
STAT 3610: Review of Probability Distributions Mark Carpenter Professor of Statistics Department of Mathematics and Statistics August 25, 2015 Support of a Random Variable Definition The support of a random
More information1 Random Variable: Topics
Note: Handouts DO NOT replace the book. In most cases, they only provide a guideline on topics and an intuitive feel. 1 Random Variable: Topics Chap 2, 2.1-2.4 and Chap 3, 3.1-3.3 What is a random variable?
More informationOrder Statistics and Distributions
Order Statistics and Distributions 1 Some Preliminary Comments and Ideas In this section we consider a random sample X 1, X 2,..., X n common continuous distribution function F and probability density
More informationContinuous random variables
Continuous random variables Can take on an uncountably infinite number of values Any value within an interval over which the variable is definied has some probability of occuring This is different from
More informationGeneration from simple discrete distributions
S-38.3148 Simulation of data networks / Generation of random variables 1(18) Generation from simple discrete distributions Note! This is just a more clear and readable version of the same slide that was
More informationSTAT2201. Analysis of Engineering & Scientific Data. Unit 3
STAT2201 Analysis of Engineering & Scientific Data Unit 3 Slava Vaisman The University of Queensland School of Mathematics and Physics What we learned in Unit 2 (1) We defined a sample space of a random
More informationReview of Probability Theory
Review of Probability Theory Arian Maleki and Tom Do Stanford University Probability theory is the study of uncertainty Through this class, we will be relying on concepts from probability theory for deriving
More informationRecitation 2: Probability
Recitation 2: Probability Colin White, Kenny Marino January 23, 2018 Outline Facts about sets Definitions and facts about probability Random Variables and Joint Distributions Characteristics of distributions
More information1 Review of di erential calculus
Review of di erential calculus This chapter presents the main elements of di erential calculus needed in probability theory. Often, students taking a course on probability theory have problems with concepts
More informationContinuous random variables
Continuous random variables CE 311S What was the difference between discrete and continuous random variables? The possible outcomes of a discrete random variable (finite or infinite) can be listed out;
More informationMath 151. Rumbos Fall Solutions to Review Problems for Exam 2. Pr(X = 1) = ) = Pr(X = 2) = Pr(X = 3) = p X. (k) =
Math 5. Rumbos Fall 07 Solutions to Review Problems for Exam. A bowl contains 5 chips of the same size and shape. Two chips are red and the other three are blue. Draw three chips from the bowl at random,
More informationQuick Tour of Basic Probability Theory and Linear Algebra
Quick Tour of and Linear Algebra Quick Tour of and Linear Algebra CS224w: Social and Information Network Analysis Fall 2011 Quick Tour of and Linear Algebra Quick Tour of and Linear Algebra Outline Definitions
More informationChapter 6 Expectation and Conditional Expectation. Lectures Definition 6.1. Two random variables defined on a probability space are said to be
Chapter 6 Expectation and Conditional Expectation Lectures 24-30 In this chapter, we introduce expected value or the mean of a random variable. First we define expectation for discrete random variables
More informationTAYLOR AND MACLAURIN SERIES
TAYLOR AND MACLAURIN SERIES. Introduction Last time, we were able to represent a certain restricted class of functions as power series. This leads us to the question: can we represent more general functions
More informationRandom Variables. Definition: A random variable (r.v.) X on the probability space (Ω, F, P) is a mapping
Random Variables Example: We roll a fair die 6 times. Suppose we are interested in the number of 5 s in the 6 rolls. Let X = number of 5 s. Then X could be 0, 1, 2, 3, 4, 5, 6. X = 0 corresponds to the
More informationF X (x) = P [X x] = x f X (t)dt. 42 Lebesgue-a.e, to be exact 43 More specifically, if g = f Lebesgue-a.e., then g is also a pdf for X.
10.2 Properties of PDF and CDF for Continuous Random Variables 10.18. The pdf f X is determined only almost everywhere 42. That is, given a pdf f for a random variable X, if we construct a function g by
More informationNon-Monotonic Transformations of Random Variables
Non-Monotonic Transformations of Random Variables Nick McMullen, Daniel Ochoa Macalester College Math 354 December 9, 2016 1 Introduction We know how to find the pdf from Y = g(x) where g is a monotone
More informationSDS 321: Introduction to Probability and Statistics
SDS 321: Introduction to Probability and Statistics Lecture 14: Continuous random variables Purnamrita Sarkar Department of Statistics and Data Science The University of Texas at Austin www.cs.cmu.edu/
More informationDistributions of Functions of Random Variables. 5.1 Functions of One Random Variable
Distributions of Functions of Random Variables 5.1 Functions of One Random Variable 5.2 Transformations of Two Random Variables 5.3 Several Random Variables 5.4 The Moment-Generating Function Technique
More informationContinuous Random Variables
Contents IV Continuous Random Variables 1 13 Introduction 1 13.1 Probability Mass Function Does Not Exist........................... 1 13.2 Probability Distribution.....................................
More information1 Review of Probability and Distributions
Random variables. A numerically valued function X of an outcome ω from a sample space Ω X : Ω R : ω X(ω) is called a random variable (r.v.), and usually determined by an experiment. We conventionally denote
More informationProbability Distributions Columns (a) through (d)
Discrete Probability Distributions Columns (a) through (d) Probability Mass Distribution Description Notes Notation or Density Function --------------------(PMF or PDF)-------------------- (a) (b) (c)
More informationIntroduction to Probability Theory
Introduction to Probability Theory Ping Yu Department of Economics University of Hong Kong Ping Yu (HKU) Probability 1 / 39 Foundations 1 Foundations 2 Random Variables 3 Expectation 4 Multivariate Random
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 informationECE353: Probability and Random Processes. Lecture 7 -Continuous Random Variable
ECE353: Probability and Random Processes Lecture 7 -Continuous Random Variable Xiao Fu School of Electrical Engineering and Computer Science Oregon State University E-mail: xiao.fu@oregonstate.edu Continuous
More informationProbability Review. Yutian Li. January 18, Stanford University. Yutian Li (Stanford University) Probability Review January 18, / 27
Probability Review Yutian Li Stanford University January 18, 2018 Yutian Li (Stanford University) Probability Review January 18, 2018 1 / 27 Outline 1 Elements of probability 2 Random variables 3 Multiple
More informationLecture 21: Convergence of transformations and generating a random variable
Lecture 21: Convergence of transformations and generating a random variable If Z n converges to Z in some sense, we often need to check whether h(z n ) converges to h(z ) in the same sense. Continuous
More information15 Discrete Distributions
Lecture Note 6 Special Distributions (Discrete and Continuous) MIT 4.30 Spring 006 Herman Bennett 5 Discrete Distributions We have already seen the binomial distribution and the uniform distribution. 5.
More informationSolutions for Homework Assignment 5.
Solutions for Homework Assignment 5. Problem. Assume that a n is an absolute convergent series. Prove that absolutely convergent for all x in the closed interval [, ]. a n x n is Solution. Assume that
More informationMAS223 Statistical Inference and Modelling Exercises
MAS223 Statistical Inference and Modelling Exercises The exercises are grouped into sections, corresponding to chapters of the lecture notes Within each section exercises are divided into warm-up questions,
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 informationFunctions of Random Variables
Functions of Random Variables Statistics 110 Summer 2006 Copyright c 2006 by Mark E. Irwin Functions of Random Variables As we ve seen before, if X N(µ, σ 2 ), then Y = ax + b is also normally distributed.
More informationSolution to Assignment 3
The Chinese University of Hong Kong ENGG3D: Probability and Statistics for Engineers 5-6 Term Solution to Assignment 3 Hongyang Li, Francis Due: 3:pm, March Release Date: March 8, 6 Dear students, The
More informationChapter 2 Continuous Distributions
Chapter Continuous Distributions Continuous random variables For a continuous random variable X the probability distribution is described by the probability density function f(x), which has the following
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 information4. Distributions of Functions of Random Variables
4. Distributions of Functions of Random Variables Setup: Consider as given the joint distribution of X 1,..., X n (i.e. consider as given f X1,...,X n and F X1,...,X n ) Consider k functions g 1 : R n
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 informationMTH 202 : Probability and Statistics
MTH 202 : Probability and Statistics Lecture 9 - : 27, 28, 29 January, 203 4. Functions of a Random Variables 4. : Borel measurable functions Similar to continuous functions which lies to the heart of
More informationCHAPTER 3 ANALYSIS OF RELIABILITY AND PROBABILITY MEASURES
27 CHAPTER 3 ANALYSIS OF RELIABILITY AND PROBABILITY MEASURES 3.1 INTRODUCTION The express purpose of this research is to assimilate reliability and its associated probabilistic variables into the Unit
More informationRandom Variables. Random variables. A numerically valued map X of an outcome ω from a sample space Ω to the real line R
In probabilistic models, a random variable is a variable whose possible values are numerical outcomes of a random phenomenon. As a function or a map, it maps from an element (or an outcome) of a sample
More informationRandom Variate Generation
Random Variate Generation 28-1 Overview 1. Inverse transformation 2. Rejection 3. Composition 4. Convolution 5. Characterization 28-2 Random-Variate Generation General Techniques Only a few techniques
More informationCS145: Probability & Computing Lecture 11: Derived Distributions, Functions of Random Variables
CS145: Probability & Computing Lecture 11: Derived Distributions, Functions of Random Variables Instructor: Erik Sudderth Brown University Computer Science March 5, 2015 Homework Submissions Electronic
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 informationDefinitions & Theorems
Definitions & Theorems Math 147, Fall 2009 December 19, 2010 Contents 1 Logic 2 1.1 Sets.................................................. 2 1.2 The Peano axioms..........................................
More informationSTAT 516: Basic Probability and its Applications
Lecture 4: Random variables Prof. Michael September 15, 2015 What is a random variable? Often, it is hard and/or impossible to enumerate the entire sample space For a coin flip experiment, the sample space
More informationProbability Theory and Statistics. Peter Jochumzen
Probability Theory and Statistics Peter Jochumzen April 18, 2016 Contents 1 Probability Theory And Statistics 3 1.1 Experiment, Outcome and Event................................ 3 1.2 Probability............................................
More informationChapter 3: Random Variables 1
Chapter 3: Random Variables 1 Yunghsiang S. Han Graduate Institute of Communication Engineering, National Taipei University Taiwan E-mail: yshan@mail.ntpu.edu.tw 1 Modified from the lecture notes by Prof.
More informationLecture 2: Repetition of probability theory and statistics
Algorithms for Uncertainty Quantification SS8, IN2345 Tobias Neckel Scientific Computing in Computer Science TUM Lecture 2: Repetition of probability theory and statistics Concept of Building Block: Prerequisites:
More informationChapter 4 Multiple Random Variables
Review for the previous lecture Theorems and Examples: How to obtain the pmf (pdf) of U = g ( X Y 1 ) and V = g ( X Y) Chapter 4 Multiple Random Variables Chapter 43 Bivariate Transformations Continuous
More informationSTAT 712 MATHEMATICAL STATISTICS I
STAT 72 MATHEMATICAL STATISTICS I Fall 207 Lecture Notes Joshua M. Tebbs Department of Statistics University of South Carolina c by Joshua M. Tebbs TABLE OF CONTENTS Contents Probability Theory. Set Theory......................................2
More informationBASICS OF PROBABILITY
October 10, 2018 BASICS OF PROBABILITY Randomness, sample space and probability Probability is concerned with random experiments. That is, an experiment, the outcome of which cannot be predicted with certainty,
More informationCommon ontinuous random variables
Common ontinuous random variables CE 311S Earlier, we saw a number of distribution families Binomial Negative binomial Hypergeometric Poisson These were useful because they represented common situations:
More informationSTAT 450: Statistical Theory. Distribution Theory. Reading in Casella and Berger: Ch 2 Sec 1, Ch 4 Sec 1, Ch 4 Sec 6.
STAT 45: Statistical Theory Distribution Theory Reading in Casella and Berger: Ch 2 Sec 1, Ch 4 Sec 1, Ch 4 Sec 6. Basic Problem: Start with assumptions about f or CDF of random vector X (X 1,..., X p
More informationPractice Problems Section Problems
Practice Problems Section 4-4-3 4-4 4-5 4-6 4-7 4-8 4-10 Supplemental Problems 4-1 to 4-9 4-13, 14, 15, 17, 19, 0 4-3, 34, 36, 38 4-47, 49, 5, 54, 55 4-59, 60, 63 4-66, 68, 69, 70, 74 4-79, 81, 84 4-85,
More informationIt can be shown that if X 1 ;X 2 ;:::;X n are independent r.v. s with
Example: Alternative calculation of mean and variance of binomial distribution A r.v. X has the Bernoulli distribution if it takes the values 1 ( success ) or 0 ( failure ) with probabilities p and (1
More informationSTA 732: Inference. Notes 2. Neyman-Pearsonian Classical Hypothesis Testing B&D 4
STA 73: Inference Notes. Neyman-Pearsonian Classical Hypothesis Testing B&D 4 1 Testing as a rule Fisher s quantification of extremeness of observed evidence clearly lacked rigorous mathematical interpretation.
More informationECE 313 Probability with Engineering Applications Fall 2000
Exponential random variables Exponential random variables arise in studies of waiting times, service times, etc X is called an exponential random variable with parameter λ if its pdf is given by f(u) =
More informationBrief Review of Probability
Maura Department of Economics and Finance Università Tor Vergata Outline 1 Distribution Functions Quantiles and Modes of a Distribution 2 Example 3 Example 4 Distributions Outline Distribution Functions
More informationIntroduction: exponential family, conjugacy, and sufficiency (9/2/13)
STA56: Probabilistic machine learning Introduction: exponential family, conjugacy, and sufficiency 9/2/3 Lecturer: Barbara Engelhardt Scribes: Melissa Dalis, Abhinandan Nath, Abhishek Dubey, Xin Zhou Review
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationDistributions of Functions of Random Variables
STAT/MATH 395 A - PROBABILITY II UW Winter Quarter 217 Néhémy Lim Distributions of Functions of Random Variables 1 Functions of One Random Variable In some situations, you are given the pdf f X of some
More informationProbability distributions. Probability Distribution Functions. Probability distributions (contd.) Binomial distribution
Probability distributions Probability Distribution Functions G. Jogesh Babu Department of Statistics Penn State University September 27, 2011 http://en.wikipedia.org/wiki/probability_distribution We discuss
More informationThis exam is closed book and closed notes. (You will have access to a copy of the Table of Common Distributions given in the back of the text.
TEST #3 STA 536 December, 00 Name: Please read the following directions. DO NOT TURN THE PAGE UNTIL INSTRUCTED TO DO SO Directions This exam is closed book and closed notes. You will have access to a copy
More information0 otherwise. Page 100 Exercise 9: Suppose that a random variable X has a discrete distribution with the following p.m.f.: { c. 2 x. 0 otherwise.
Stat 42 Solutions for Homework Set 4 Page Exercise 5: Suppose that a box contains seven red balls and three blue balls. If five balls are selected at random, without replacement, determine the p.m.f. of
More information