Random Variables LECTURE DEFINITION
|
|
- Rosalyn Hamilton
- 5 years ago
- Views:
Transcription
1 LECTURE 3 Random Variables 3. DEFINITION It is often convenient to represent the outcome of a random eperiment by a number. A random variable(r.v.) is such a representation. To be more precise, let (Ω,F, P) be a probability space. Thenarandomvariable X : Ω Risamappingoftheoutcome. Ω ω X(ω) Figure 3.. Random variable as a mapping. Eample3.. Let the random variable X be the number of heads in n coin flips. The samplespaceisω = {H,T} n,thepossibleoutcomesofncoinflips;then X {0,,2,...,n} Eample3.2. Consider packet arrival times t,t 2,... in the interval (0,T]. The sample space Ω consistsof theempty string (nopacket) and all finitelengthstrings of theform (t,t 2,...,t n ) such that 0 < t t 2 t n T. Define the random variable X to be thelengthofthestring;thenx {0,,2,3,...}. Eample 3.3. Consider the voltage across a capacitor. The sample space Ω = R. Define the random variables X(ω) = ω, Y(ω) = +, ω 0,, otherwise.
2 2 Random Variables Eample3.4. Let (Ω,F, P) be a probability space. For a given event A F, define the indicator random variable, ω A, X(ω) = 0, otherwise. Weusethenotation A (ω)or χ A (ω)todenotetheindicatorrandomvariable fora. Throughout thecourse, we use uppercase letters, say, X, Y, Z, Φ, Θ, todenote random variables, and lowercase letters to denote the values taken by the random variables. Thus, X(ω) = meansthattherandomvariable Xtakesonthevaluewhentheoutcome isω. As a representation of a random eperiment in the probability space (Ω,F, P), the randomvariable X canbeviewedasanoutcomeofarandomeperimentonitsown. The samplespaceisrandthesetofeventsistheborelσ-algebrab. AneventA B occursif X Aanditsprobability is P({ω Ω: X(ω) A}), which is determined by the probability measure P of the underlying random eperiment and the inverse image of A under the mapping X : Ω R. Thus, (Ω,F, P) induces a probability space(r,b, P X ),where P X (A) = P({ω Ω: X(ω) A}), A B. AnimplicitassumptionhereisthatforeveryA B,theinverseimage{ω Ω: X(ω) A} is an event in F. A mapping X(ω) satisfying this condition is called measurable (with respecttof)andwewillalwaysassumethatagivenmappingismeasurable. Since we typically deal with multiple random variables on the same probability space, we will use thenotation P{X A} instead of themore formal notation P X (A) or P({ω Ω: X(ω) A}). R AsetA Theinverseimageof Aunder X(ω),i.e.,{ω : X(ω) A}
3 3.2 Cumulative Distribution Function CUMULATIVE DISTRIBUTION FUNCTION To determine P{X A} for any Borel set A, i.e., any set generated by open intervals via countable unions, intersections, and complements, it suffices to specify P{X (a, b)} or P{X (a,b]}forall < a < b <. Thentheprobability ofanyotherborelsetcanbe determined by the aioms of probability. Equivalently, it suffices to specify the cumulative distribution function(cdf) of the random variable X: F X () = P{X } = P{X (,]}, R. The cdf of a random variable satisfies the following properties.. F X ()isnonnegative,i.e., F X () 0, R. 2. F X ()ismonotonically nondecreasing,i.e., 3. Limits. F X (a) F X (b), a < b. lim F X() = 0 and lim F + X() =. 4. F X ()isrightcontinuous,i.e., 5. Probability of a singleton. wheref X (a ) := lim a F X (). F X (a + ) := lim a + F X() = F X (a). P{X = a} = F X (a) F X (a ), Throughout,weusethenotation X F()meansthattherandomvariable X hasthe cdff(). F X () Figure 3.2. An illustration of a cumulative distribution function (cdf).
4 4 Random Variables 3.3 PROBABILITY MASS FUNCTION (PMF) Arandomvariable X issaidtobediscreteiff X ()consistsonlyofstepsoveracountable setx asillustrated infigure3.3. Figure 3.3. The cdf of a discrete random variable. A discrete random variable X can be completely specified by its probability mass function(pmf) p X () = P{X = }, X. The set X is often referred to as the alphabet of X. Clearly, p X () 0, X p X () =, and P(X A) = p X (). A X Throughout, weuse thenotation X p() tomean that X is adiscreterandom variable X withpmf p(). We review a few famous discrete random variables. Bernoulli. X Bern(p), p [0,],hasthepmf p X () = p and p X (0) = p. Thisistheindicatorofobservingaheadfromflippingacoinwithbias p. Geometric. X Geom(p), p [0,],hasthepmf p X (k) = p( p) k, k =,2,3,... Thisisthenumberofindependentcoinflipsofbias puntilthefirsthead. Binomial. X Binom(n, p), p [0,],n =,2,..., hasthepmf p X (k) = n k pk ( p) n k, k = 0,,...,n. Thisisthenumberofheadsinnindependentcoinflipsofbias p. Poisson. X Poisson(λ), λ > 0,hasthepmf p X (k) = λk k! e λ, k = 0,,2,...
5 3.4 Probability Density Function 5 [h] Figure 3.4. The cdf of a continuous random variable. This is often used to characterize thenumber of random arrivals in aunit time interval, thenumberofrandompointsinaunitarea,andsoon. Let X Binom(n,λ/n). Then,itspmfforafied k is p X (k) = n k λ n k λ n n k = n(n ) (n k+) n k λ k k! λ n n λ n k, which converges to the Poisson(λ) pmf (λ k /k!)e λ as n. Thus, Poisson(λ) is the limit of Binom(n, λ/n). Eample 3.5. In a popular lottery called Powerball, the winning combination of numbers is selected uniformly at random among 292,20,338 possible combinations. Suppose thatαnticketsaresold. Whatistheprobability thatthereisnowinner? SincethenumberN ofwinnersisabinom(αn,/n)randomvariablewithn = verylarge, wecanusethepoissionapproimation toobtain P{N = 0} = n αn e α, asn. Ifα =,thereisnowinnerwithprobabilityof37%. Ifα = 2,thisprobabilitydecreasesto 4%. Thus, even with 600 million tickets sold, there is a significant chance that the lottery hasnowinnerandrollsovertothenetweek(withabiggerjackpot). 3.4 PROBABILITY DENSITY FUNCTION A random variable is said to be continuous if its cdf is continuous as illustrated in Figure 3.4. If F X () is continuous and differentiable (ecept possibly over a countable set), then X canbecompletelyspecifiedbyitsprobabilitydensityfunction(pdf) f X ()suchthat F X () = f X (u)du.
6 6 Random Variables IfF X ()isdifferentiable everywhere,thenbythedefinitionofderivative f X () = df X() d F( +Δ) F() = lim Δ 0 Δ P{ < X +Δ} = lim. Δ 0 Δ The pdf of a random variable satisfies the following properties.. f X ()isnonnegative,i.e., 2. Normalization. f X()d =. f X () 0, R. 3. Foranyevent A R, In particular, P{X A} = f X ()d. A b P{a < X b} = P{a < X < b} = P{a X < b} = P{a X b} = f X ()d. a Notethat f X ()shouldnot beinterpretedastheprobabilitythat X =. Infact, f X () can be greater than. It is f X ()Δ that can be interpreted as the approimation of the probability P{ < X +Δ}forΔ sufficientlysmall. Throughout, we use the notation X f() to mean that X is a continuous random variable withpdf f(). We review a few famous continuous random variables. Uniform. X Unif[a,b],a < b,hasthepdf [a,b], f X () = b a 0 otherwise. This is often used to model quantization noise. Eponential. X Ep(λ), λ > 0,hasthepdf f X () = λe λ 0, 0 otherwise. Thisisoften usedtomodeltheservicetime inaqueue orthetime betweentworandom arrivals. An eponential random variable satisfies the memoryless property P(X > + t X > t) = P{X > +t} P{X > t} = P{X > }, t, > 0.
7 3.5 Functions of a Random Variable 7 Eample3.6. Suppose that for every t > 0, the number of packet arrivals during time interval(0, t] is a Poisson(λt) random variable, i.e., p N (n) = (λt)n e λt, n = 0,,2,... n! Let X bethetimeuntilthefirstpacketarrival. Thentheevent{X > t}isequivalenttothe event{n = 0}andthus Hence, f X (t) = λe λt and X Ep(λ). Gaussian. X N(μ,σ 2 )hasthepdf F X (t) = P{X > t) = P{N = 0} = e λt. f X () = e ( μ) 2σ 2 2πσ 2 2 This characterizes many random phenomena such as thermal and shot noise, and is also called a normal random variable. The cdf of the standard normal random variable N(0, ) is Its complement is Φ() = u 2 2π e 2 du. Q() = Φ() = P{X > }. The numerical values of the Q function is often used to compute probabilities of any GaussianrandomvariableY N(μ,σ 2 )as P{Y > y} = P X > y μ σ = Q y μ. (3.) σ 3.5 FUNCTIONS OF A RANDOM VARIABLE Let X be a random variable and д : R R be a given function. Then Y = д(x) is a random variable and its probability distribution can be epressed through that of X. For eample,if X isdiscrete,theny isdiscreteand p Y (y) = P{Y = y} = P{д(X) = y} = p X (). : д()=y
8 8 Random Variables f X Q() Figure3.5. ThepdfofthestandardnormalrandomvariableandtheQfunction. In general, F Y (y) = P{Y y} which can be further simplified in many cases. = P{д(X) y}, Eample3.7(Linearfunction). Let X F X ()andy = ax +b,a 0. Ifa > 0,then F Y (y) = P{aX +b y} = P X y b a = F X y b a. Taking derivative with respect to y, we have Wecansimilarly showthatifa < 0,then and f Y (y) = a f X y b a F Y (y) = F X y b a f Y (y) = a f X y b a. y y y b a Figure 3.6. A linear function.
9 3.5 Functions of a Random Variable 9 Combining both cases, f Y (y) = a f X y b a Asaspecialcase,let X N(μ,σ 2 ),i.e., f X () = e ( μ) 2πσ 2 2 2σ 2. AgainsettingY = ax +b,wehave f Y (y) = a f X y b a = μ 2 a 2πσ 2 e 2σ 2 e (y b aμ) = 2π(aσ) 2 2 2a 2 σ 2. Therefore,Y N(aμ+b, a 2 σ 2 ). This result justifies theuse of theqfunctionin (3.) to compute probabilities for an arbitrary Gaussian random variable. Eample3.8(Quadraticfunction). LetX F X ()andy = X 2.Ify < 0,thenF Y (y) = 0. Otherwise, F Y (y) = P y X y = F X y F X ( y) If X iscontinuouswithpdf f X (),then f Y (y) = 2 y f X( y)+ f X ( y). y y y Figure 3.7. A quadratic function.
10 0 Random Variables The above two eamples can be generalized as follows. Proposition3.. Let X f X ()andy = д(x)bedifferentiable. Then f f Y (y) = X ( i ) i= д ( i ), where, 2,...are thesolutions of theequation y = д() and д ( i )is thederivative of д evaluated at i. The distribution of Y can be written eplicitly even when д is not differentiable. Eample3.9(Limiter). Let X be a r.v. with Laplacian pdf f X () = 2 e, and let Y be definedbythefunctionof X showninfigure3.8. Considerthefollowingcases. If y < a,clearlyf Y (y) = 0. If y = a, If a < y < a, F Y ( a) = F X ( ) = 2 e d = 2 e. F Y (y) = P{Y y} = P ax y = P X y a = F X y a = y/a 2 e + 2 e d. y +a a + Figure 3.8. The limiter function.
11 3.6 Generation of Random Variables If y a,f Y (y) =. Combiningthesecases,thecdfofY issketchedinfigure3.9. F Y (y) a a y Figure3.9.ThecdfoftherandomvariableY. 3.6 GENERATION OF RANDOM VARIABLES Suppose that we are given a uniform random variable X Unif[0,] and wish to generate a random variable Y with prescribed cdf F(y). If F(y) is continuous and strictly = F(y) y = F () Figure3.0. GenerationofY F(y)fromauniformrandomvariable X. increasing, set Y = F (X). Then,since X Unif[0,]and0 F(y), F Y (y) = P{Y y} = P{F (X) y} = P{X F(y)} (3.2) = F(y). Thus,YhasthedesiredcdfF(y).Foreample,togenerateY Ep(λ)fromX Unif[0,], weset Y = ln( X). λ
12 2 Random Variables More generally, for an arbitrary cdf F(y), we define F () := min{y: F(y)}, (0,]. (3.3) Since F(y) is right continuous, the above minimum is well-defined. Furthermore, since F(y)ismonotonicallynondecreasing,F () yiff F(y). WenowsetY = F (X)as before, but under this new definition of inverse. It follows immediately that the equality in (3.2) continues to hold and thaty F(y). For eample, to generatey Bern(p), we set 0 X p, Y = otherwise. In conclusion, we can generate a random variable with any desired distribution from a Unif[0, ] random variable. = F(y) p 0 y Figure 3.. Generation of a Bern(p) random variable. Conversely, a uniform random variable can be generated from any continuos random variable. Let X be a continuous random variable with cdf F() and Y = F(X). Since F() [0,],F Y (y) = P{Y y} = 0for y < 0andF Y (y) = for y >. For y [0,],let F (y)bedefinedasin(3.3). Then F Y (y) = P{Y y} = P{F(X) y} = P{X F (y)} = F(F (y)) (3.4) = y, where the equality in (3.4) follows by the definition of F (y). Hence, Y U[0,]. For eample, let X Ep(λ)and ThenY Unif[0,]. ep( λx) X 0. Y = 0 otherwise.
13 Problems 3 The eact generation of a uniform random variable, which requires an infinite number of bits to describe, is not possible in any digital computer. One can instead use the following approimation. Let X,X 2,...X n be independent and identically distributed (i.i.d.) Bern(/2) random variables, and Y =.X X 2...X n be a fraction in base 2 that lies between 0 and. Then Y is a discrete random variable uniformlydistributedovertheset{k/2 n : k = 0,,...,2 n }anditscdff(y)converges tothatofaunif[0,]randomvariableforevery yasn. Thus,byflippingmanyfair coin flips, one can simulate a uniform random variable. The fairness of coin flips is not essential to this procedure. Suppose that Z and Z 2 are i.i.d. Bern(p) random variable. The following procedure due to von Neumann can generate a single Bern(/2) random variable, even when the bias p is unknown. Let X = 0 (Z,Z 2 ) = (0,), (Z,Z 2 ) = (,0). If (Z,Z 2 ) = (0,0) or (,), then the outcome is ignored. Clearly p X (0) = p X () = /2. By repeating the same procedure, one can generate a sequence of i.i.d. Bern(/2) random variables from a sequence of i.i.d. Bern(p) random variables. PROBLEMS 3.. Probabilitiesfromacdf. Let X bearandomvariable withthecdfshownbelow. F() 2/3 / Find the probabilities of the following events. (a) {X = 2}. (b){x < 2}. (c) {X = 2} {0.5 X.5}. (d){x = 2} {0.5 X 3} Gaussian probabilities. Let X N(000, 400). Epress the following in terms of the Q function.
14 4 Random Variables (a) P{0 < X < 020}. (b) P{X < 020 X > 960} Laplacian. Let X f() = 2 e. (a) Sketchthecdfof X. (b)find P{ X 2or X 0}. (c) Find P{ X + X 3 3}. (d)find P{X 0 X } Distancetotheneareststar. Lettherandomvariable N bethenumberofstarsina regionofspaceofvolumev. AssumethatN isapoissonr.v.withpmf p N (n) = e ρv (ρv) n, forn = 0,,2,..., n! where ρ is the density of stars in space. We choose an arbitrary point in space anddefinetherandomvariable X tobethedistancefromthechosenpointtothe neareststar. Findthepdfof X (intermsof ρ) Uniform arrival. The arrival time of a professor to his office is uniformly distributed in the interval between 8 and 9 am. Find the probability that the professor will arrive during the net minute given that he has not arrived by 8:30. Repeat for 8: Lognormal distribution. Let X N(0,σ 2 ). FindthepdfofY = e X (known asthe lognormal pdf) Randomphase signal. LetY(t) = sin(ωt +Θ) beasinusoidal signal withrandom phaseθ U[ π,π]. FindthepdfoftherandomvariableY(t)(assumeherethat both t andtheradial frequencyω are constant). Comment onthedependenceof thepdfofy(t)ontime t Quantizer. Let X ep(λ), i.e., an eponential random variable with parameter λ andy = X, i.e., Y = k for k X < k +, k = 0,,2,... Find the pmf of Y. Definethequantization error Z = X Y. Findthepdfof Z Gambling. Aliceentersacasinowithoneunitofcapital. Shelooksatherwatchto generateauniformrandomvariableu unif[0,],thenbetstheamountu ona faircoinflip. Herwealthisthusgivenbyther.v. Findthecdfof X. X = +U, withprobability /2, U, withprobability / Nonlinear processing. Let X Unif[, ]. Define the random variable Y = X2 +, if X 0.5 0, otherwise.
15 FindandsketchthecdfofY. Problems 5
Lecture Notes 2 Random Variables. Discrete Random Variables: Probability mass function (pmf)
Lecture Notes 2 Random Variables Definition Discrete Random Variables: Probability mass function (pmf) Continuous Random Variables: Probability density function (pdf) Mean and Variance Cumulative Distribution
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 informationLecture Notes 2 Random Variables. Random Variable
Lecture Notes 2 Random Variables Definition Discrete Random Variables: Probability mass function (pmf) Continuous Random Variables: Probability density function (pdf) Mean and Variance Cumulative Distribution
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 informationLecture 3. Discrete Random Variables
Math 408 - Mathematical Statistics Lecture 3. Discrete Random Variables January 23, 2013 Konstantin Zuev (USC) Math 408, Lecture 3 January 23, 2013 1 / 14 Agenda Random Variable: Motivation and Definition
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 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 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 informationChapter 2. Random Variable. Define single random variables in terms of their PDF and CDF, and calculate moments such as the mean and variance.
Chapter 2 Random Variable CLO2 Define single random variables in terms of their PDF and CDF, and calculate moments such as the mean and variance. 1 1. Introduction In Chapter 1, we introduced the concept
More informationRandom variable X is a mapping that maps each outcome s in the sample space to a unique real number x, x. X s. Real Line
Random Variable Random variable is a mapping that maps each outcome s in the sample space to a unique real number,. s s : outcome Sample Space Real Line Eamples Toss a coin. Define the random variable
More informationChapter 5. Statistical Models in Simulations 5.1. Prof. Dr. Mesut Güneş Ch. 5 Statistical Models in Simulations
Chapter 5 Statistical Models in Simulations 5.1 Contents Basic Probability Theory Concepts Discrete Distributions Continuous Distributions Poisson Process Empirical Distributions Useful Statistical Models
More informationComputer Science, Informatik 4 Communication and Distributed Systems. Simulation. Discrete-Event System Simulation. Dr.
Simulation Discrete-Event System Simulation Chapter 4 Statistical Models in Simulation Purpose & Overview The world the model-builder sees is probabilistic rather than deterministic. Some statistical model
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 informationWhy study probability? Set theory. ECE 6010 Lecture 1 Introduction; Review of Random Variables
ECE 6010 Lecture 1 Introduction; Review of Random Variables Readings from G&S: Chapter 1. Section 2.1, Section 2.3, Section 2.4, Section 3.1, Section 3.2, Section 3.5, Section 4.1, Section 4.2, Section
More informationRandom variable X is a mapping that maps each outcome s in the sample space to a unique real number x, < x <. ( ) X s. Real Line
Random Variable Random variable is a mapping that maps each outcome s in the sample space to a unique real number, <
More informationChapter 3 Single Random Variables and Probability Distributions (Part 1)
Chapter 3 Single Random Variables and Probability Distributions (Part 1) Contents What is a Random Variable? Probability Distribution Functions Cumulative Distribution Function Probability Density Function
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 informationFundamental Tools - Probability Theory II
Fundamental Tools - Probability Theory II MSc Financial Mathematics The University of Warwick September 29, 2015 MSc Financial Mathematics Fundamental Tools - Probability Theory II 1 / 22 Measurable random
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 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 information1: PROBABILITY REVIEW
1: PROBABILITY REVIEW Marek Rutkowski School of Mathematics and Statistics University of Sydney Semester 2, 2016 M. Rutkowski (USydney) Slides 1: Probability Review 1 / 56 Outline We will review the following
More informationLecture Notes 3 Multiple Random Variables. Joint, Marginal, and Conditional pmfs. Bayes Rule and Independence for pmfs
Lecture Notes 3 Multiple Random Variables Joint, Marginal, and Conditional pmfs Bayes Rule and Independence for pmfs Joint, Marginal, and Conditional pdfs Bayes Rule and Independence for pdfs Functions
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 informationPart IA Probability. Definitions. Based on lectures by R. Weber Notes taken by Dexter Chua. Lent 2015
Part IA Probability Definitions Based on lectures by R. Weber Notes taken by Dexter Chua Lent 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after lectures.
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 informationEE/CpE 345. Modeling and Simulation. Fall Class 5 September 30, 2002
EE/CpE 345 Modeling and Simulation Class 5 September 30, 2002 Statistical Models in Simulation Real World phenomena of interest Sample phenomena select distribution Probabilistic, not deterministic Model
More informationSystem Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models
System Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models Fatih Cavdur fatihcavdur@uludag.edu.tr March 29, 2014 Introduction Introduction The world of the model-builder
More informationChapter 1 Statistical Reasoning Why statistics? Section 1.1 Basics of Probability Theory
Chapter 1 Statistical Reasoning Why statistics? Uncertainty of nature (weather, earth movement, etc. ) Uncertainty in observation/sampling/measurement Variability of human operation/error imperfection
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 informationAlgorithms for Uncertainty Quantification
Algorithms for Uncertainty Quantification Tobias Neckel, Ionuț-Gabriel Farcaș Lehrstuhl Informatik V Summer Semester 2017 Lecture 2: Repetition of probability theory and statistics Example: coin flip Example
More informationChapter 2: The Random Variable
Chapter : The Random Variable The outcome of a random eperiment need not be a number, for eample tossing a coin or selecting a color ball from a bo. However we are usually interested not in the outcome
More informationIntroduction to Probability Theory for Graduate Economics Fall 2008
Introduction to Probability Theory for Graduate Economics Fall 008 Yiğit Sağlam October 10, 008 CHAPTER - RANDOM VARIABLES AND EXPECTATION 1 1 Random Variables A random variable (RV) is a real-valued function
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 information1 Presessional Probability
1 Presessional Probability Probability theory is essential for the development of mathematical models in finance, because of the randomness nature of price fluctuations in the markets. This presessional
More information(Ch 3.4.1, 3.4.2, 4.1, 4.2, 4.3)
3 Probability Distributions (Ch 3.4.1, 3.4.2, 4.1, 4.2, 4.3) Probability Distribution Functions Probability distribution function (pdf): Function for mapping random variables to real numbers. Discrete
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 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 informationn px p x (1 p) n x. p x n(n 1)... (n x + 1) x!
Lectures 3-4 jacques@ucsd.edu 7. Classical discrete distributions D. The Poisson Distribution. If a coin with heads probability p is flipped independently n times, then the number of heads is Bin(n, p)
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 informationContinuous Probability Spaces
Continuous Probability Spaces Ω is not countable. Outcomes can be any real number or part of an interval of R, e.g. heights, weights and lifetimes. Can not assign probabilities to each outcome and add
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 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 informationCourse: ESO-209 Home Work: 1 Instructor: Debasis Kundu
Home Work: 1 1. Describe the sample space when a coin is tossed (a) once, (b) three times, (c) n times, (d) an infinite number of times. 2. A coin is tossed until for the first time the same result appear
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 informationChapter 3. Chapter 3 sections
sections 3.1 Random Variables and Discrete Distributions 3.2 Continuous Distributions 3.4 Bivariate Distributions 3.5 Marginal Distributions 3.6 Conditional Distributions 3.7 Multivariate Distributions
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 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 informationECS /1 Part IV.2 Dr.Prapun
Sirindhorn International Institute of Technology Thammasat University School of Information, Computer and Communication Technology ECS35 4/ Part IV. Dr.Prapun.4 Families of Continuous Random Variables
More informationRS Chapter 2 Random Variables 9/28/2017. Chapter 2. Random Variables
RS Chapter Random Variables 9/8/017 Chapter Random Variables Random Variables A random variable is a convenient way to epress the elements of Ω as numbers rather than abstract elements of sets. Definition:
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 information(Ch 3.4.1, 3.4.2, 4.1, 4.2, 4.3)
3 Probability Distributions (Ch 3.4.1, 3.4.2, 4.1, 4.2, 4.3) Probability Distribution Functions Probability distribution function (pdf): Function for mapping random variables to real numbers. Discrete
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 informationRandom Variables Example:
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 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 informationBasic concepts of probability theory
Basic concepts of probability theory Random variable discrete/continuous random variable Transform Z transform, Laplace transform Distribution Geometric, mixed-geometric, Binomial, Poisson, exponential,
More informationLecture 2. Distributions and Random Variables
Lecture 2. Distributions and Random Variables Igor Rychlik Chalmers Department of Mathematical Sciences Probability, Statistics and Risk, MVE300 Chalmers March 2013. Click on red text for extra material.
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 informationCHAPTER 3 RANDOM VARIABLES AND PROBABILITY DISTRIBUTIONS. 3.1 Concept of a Random Variable. 3.2 Discrete Probability Distributions
CHAPTER 3 RANDOM VARIABLES AND PROBABILITY DISTRIBUTIONS 3.1 Concept of a Random Variable Random Variable A random variable is a function that associates a real number with each element in the sample space.
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 informationPairs of Random Variables
LECTURE 4 Pairs of Random Variables 4. TWO RANDOM VARIABLES Let(,F, P)beaprobabl spaceandconsidertwomeasurablemappings X : Ă Ă, Y : Ă Ă. In other words, X andy are two random variables defined on the common
More information2.1 Elementary probability; random sampling
Chapter 2 Probability Theory Chapter 2 outlines the probability theory necessary to understand this text. It is meant as a refresher for students who need review and as a reference for concepts and theorems
More informationPCMI Introduction to Random Matrix Theory Handout # REVIEW OF PROBABILITY THEORY. Chapter 1 - Events and Their Probabilities
PCMI 207 - Introduction to Random Matrix Theory Handout #2 06.27.207 REVIEW OF PROBABILITY THEORY Chapter - Events and Their Probabilities.. Events as Sets Definition (σ-field). A collection F of subsets
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 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 informationStatistics and Econometrics I
Statistics and Econometrics I Random Variables Shiu-Sheng Chen Department of Economics National Taiwan University October 5, 2016 Shiu-Sheng Chen (NTU Econ) Statistics and Econometrics I October 5, 2016
More informationEE5319R: Problem Set 3 Assigned: 24/08/16, Due: 31/08/16
EE539R: Problem Set 3 Assigned: 24/08/6, Due: 3/08/6. Cover and Thomas: Problem 2.30 (Maimum Entropy): Solution: We are required to maimize H(P X ) over all distributions P X on the non-negative integers
More informationLecture Notes 7 Random Processes. Markov Processes Markov Chains. Random Processes
Lecture Notes 7 Random Processes Definition IID Processes Bernoulli Process Binomial Counting Process Interarrival Time Process Markov Processes Markov Chains Classification of States Steady State Probabilities
More informationChapter 5. Chapter 5 sections
1 / 43 sections Discrete univariate distributions: 5.2 Bernoulli and Binomial distributions Just skim 5.3 Hypergeometric distributions 5.4 Poisson distributions Just skim 5.5 Negative Binomial distributions
More informationX 1 ((, a]) = {ω Ω : X(ω) a} F, which leads us to the following definition:
nna Janicka Probability Calculus 08/09 Lecture 4. Real-valued Random Variables We already know how to describe the results of a random experiment in terms of a formal mathematical construction, i.e. the
More informationSuppose that you have three coins. Coin A is fair, coin B shows heads with probability 0.6 and coin C shows heads with probability 0.8.
Suppose that you have three coins. Coin A is fair, coin B shows heads with probability 0.6 and coin C shows heads with probability 0.8. Coin A is flipped until a head appears, then coin B is flipped until
More information7 Random samples and sampling distributions
7 Random samples and sampling distributions 7.1 Introduction - random samples We will use the term experiment in a very general way to refer to some process, procedure or natural phenomena that produces
More informationMeasure-theoretic probability
Measure-theoretic probability Koltay L. VEGTMAM144B November 28, 2012 (VEGTMAM144B) Measure-theoretic probability November 28, 2012 1 / 27 The probability space De nition The (Ω, A, P) measure space is
More informationThe random variable 1
The random variable 1 Contents 1. Definition 2. Distribution and density function 3. Specific random variables 4. Functions of one random variable 5. Mean and variance 2 The random variable A random variable
More informationProbability Theory Review
Cogsci 118A: Natural Computation I Lecture 2 (01/07/10) Lecturer: Angela Yu Probability Theory Review Scribe: Joseph Schilz Lecture Summary 1. Set theory: terms and operators In this section, we provide
More informationLecture 1: Review on Probability and Statistics
STAT 516: Stochastic Modeling of Scientific Data Autumn 2018 Instructor: Yen-Chi Chen Lecture 1: Review on Probability and Statistics These notes are partially based on those of Mathias Drton. 1.1 Motivating
More informationAppendix A : Introduction to Probability and stochastic processes
A-1 Mathematical methods in communication July 5th, 2009 Appendix A : Introduction to Probability and stochastic processes Lecturer: Haim Permuter Scribe: Shai Shapira and Uri Livnat The probability of
More information1 Review of Probability
1 Review of Probability Random variables are denoted by X, Y, Z, etc. The cumulative distribution function (c.d.f.) of a random variable X is denoted by F (x) = P (X x), < x
More informationReview of Probability. CS1538: Introduction to Simulations
Review of Probability CS1538: Introduction to Simulations Probability and Statistics in Simulation Why do we need probability and statistics in simulation? Needed to validate the simulation model Needed
More informationMath 180A. Lecture 16 Friday May 7 th. Expectation. Recall the three main probability density functions so far (1) Uniform (2) Exponential.
Math 8A Lecture 6 Friday May 7 th Epectation Recall the three main probability density functions so far () Uniform () Eponential (3) Power Law e, ( ), Math 8A Lecture 6 Friday May 7 th Epectation Eample
More informationMFM Practitioner Module: Quantitative Risk Management. John Dodson. September 23, 2015
MFM Practitioner Module: Quantitative Risk Management September 23, 2015 Mixtures Mixtures Mixtures Definitions For our purposes, A random variable is a quantity whose value is not known to us right now
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 informationProbability Review. Gonzalo Mateos
Probability Review Gonzalo Mateos Dept. of ECE and Goergen Institute for Data Science University of Rochester gmateosb@ece.rochester.edu http://www.ece.rochester.edu/~gmateosb/ September 11, 2018 Introduction
More informationRecap of Basic Probability Theory
02407 Stochastic Processes Recap of Basic Probability Theory Uffe Høgsbro Thygesen Informatics and Mathematical Modelling Technical University of Denmark 2800 Kgs. Lyngby Denmark Email: uht@imm.dtu.dk
More informationBasic concepts of probability theory
Basic concepts of probability theory Random variable discrete/continuous random variable Transform Z transform, Laplace transform Distribution Geometric, mixed-geometric, Binomial, Poisson, exponential,
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 informationCMPSCI 240: Reasoning Under Uncertainty
CMPSCI 240: Reasoning Under Uncertainty Lecture 5 Prof. Hanna Wallach wallach@cs.umass.edu February 7, 2012 Reminders Pick up a copy of B&T Check the course website: http://www.cs.umass.edu/ ~wallach/courses/s12/cmpsci240/
More informationChing-Han Hsu, BMES, National Tsing Hua University c 2015 by Ching-Han Hsu, Ph.D., BMIR Lab. = a + b 2. b a. x a b a = 12
Lecture 5 Continuous Random Variables BMIR Lecture Series in Probability and Statistics Ching-Han Hsu, BMES, National Tsing Hua University c 215 by Ching-Han Hsu, Ph.D., BMIR Lab 5.1 1 Uniform Distribution
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 informationRecap of Basic Probability Theory
02407 Stochastic Processes? Recap of Basic Probability Theory Uffe Høgsbro Thygesen Informatics and Mathematical Modelling Technical University of Denmark 2800 Kgs. Lyngby Denmark Email: uht@imm.dtu.dk
More informationLecture 8: Continuous random variables, expectation and variance
Lecture 8: Continuous random variables, expectation and variance Lejla Batina Institute for Computing and Information Sciences Digital Security Version: autumn 2013 Lejla Batina Version: autumn 2013 Wiskunde
More informationStat 512 Homework key 2
Stat 51 Homework key October 4, 015 REGULAR PROBLEMS 1 Suppose continuous random variable X belongs to the family of all distributions having a linear probability density function (pdf) over the interval
More informationTopic 3: The Expectation of a Random Variable
Topic 3: The Expectation of a Random Variable Course 003, 2017 Page 0 Expectation of a discrete random variable Definition (Expectation of a discrete r.v.): The expected value (also called the expectation
More informationIntroduction to Information Entropy Adapted from Papoulis (1991)
Introduction to Information Entropy Adapted from Papoulis (1991) Federico Lombardo Papoulis, A., Probability, Random Variables and Stochastic Processes, 3rd edition, McGraw ill, 1991. 1 1. INTRODUCTION
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 informationStochastic Models in Computer Science A Tutorial
Stochastic Models in Computer Science A Tutorial Dr. Snehanshu Saha Department of Computer Science PESIT BSC, Bengaluru WCI 2015 - August 10 to August 13 1 Introduction 2 Random Variable 3 Introduction
More informationTransform Techniques - CF
Transform Techniques - CF [eview] Moment Generating Function For a real t, the MGF of the random variable is t t M () t E[ e ] e Characteristic Function (CF) k t k For a real ω, the characteristic function
More informationThings to remember when learning probability distributions:
SPECIAL DISTRIBUTIONS Some distributions are special because they are useful They include: Poisson, exponential, Normal (Gaussian), Gamma, geometric, negative binomial, Binomial and hypergeometric distributions
More informationSystem Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models
System Simulation Part II: Mathematical and Statistical Models Chapter 5: Statistical Models Fatih Cavdur fatihcavdur@uludag.edu.tr March 20, 2012 Introduction Introduction The world of the model-builder
More informationLecture 11: Random Variables
EE5110: Probability Foundations for Electrical Engineers July-November 2015 Lecture 11: Random Variables Lecturer: Dr. Krishna Jagannathan Scribe: Sudharsan, Gopal, Arjun B, Debayani The study of random
More information