CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Multiple random variables Transform methods (Sec. 4.1-4.2, 4.5.7)

Slides:



Advertisements
Similar presentations
Z- Transform and Its Properties
Advertisements

Let X 1, X 2,..., X n be a set of independent random variables having a common distribution, and let E[ X i ] = . then, with probability 1 Strong law.
Week11 Parameter, Statistic and Random Samples A parameter is a number that describes the population. It is a fixed number, but in practice we do not know.
Use of moment generating functions. Definition Let X denote a random variable with probability density function f(x) if continuous (probability mass function.
1. Variance of Probability Distribution 2. Spread 3. Standard Deviation 4. Unbiased Estimate 5. Sample Variance and Standard Deviation 6. Alternative Definitions.
Review of Basic Probability and Statistics
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Conditional probability Independent events Bayes rule Bernoulli trials (Sec )
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Expectation of random variables Moments (Sec )
Descriptive statistics Experiment  Data  Sample Statistics Sample mean Sample variance Normalize sample variance by N-1 Standard deviation goes as square-root.
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Discrete random variables Probability mass function Distribution function (Secs )
CSE 3504: Probabilistic Analysis of Computer Systems Topics covered: Continuous time Markov chains (Sec )
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Independent events Bayes rule Bernoulli trials (Sec )
CSE 3504: Probabilistic Analysis of Computer Systems Topics covered: Probability axioms Combinatorial problems (Sec )
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Simple queuing models (Sec )
1 Engineering Computation Part 6. 2 Probability density function.
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Pure death process Availability analysis (Sec , 8.4.1)
CSE 3504: Probabilistic Analysis of Computer Systems Topics covered: Moments and transforms of special distributions (Sec ,4.5.3,4.5.4,4.5.5,4.5.6)
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Confidence intervals.
1 Review of Probability Theory [Source: Stanford University]
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Statistical inference (Sec. )
Descriptive statistics Experiment  Data  Sample Statistics Experiment  Data  Sample Statistics Sample mean Sample mean Sample variance Sample variance.
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Course outline and schedule Introduction Event Algebra (Sec )
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Statistical inference.
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Continuous random variables Uniform and Normal distribution (Sec. 3.1, )
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Exponential distribution Reliability and failure rate (Sec )
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Combinatorial problems Conditional probability Independent events (Sec , )
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Event algebra Probability axioms Combinatorial problems (Sec )
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Course outline and schedule Introduction (Sec )
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Discrete time Markov chains (Sec )
CSE 3504: Probabilistic Analysis of Computer Systems Topics covered: Discrete time Markov chains (Sec )
Probability theory 2011 Convergence concepts in probability theory  Definitions and relations between convergence concepts  Sufficient conditions for.
The moment generating function of random variable X is given by Moment generating function.
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Special discrete distributions Sec
Chapter 5. Operations on Multiple R. V.'s 1 Chapter 5. Operations on Multiple Random Variables 0. Introduction 1. Expected Value of a Function of Random.
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Stochastic processes Bernoulli and Poisson processes (Sec. 6.1,6.3.,6.4)
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Analysis of software reliability and performance.
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Discrete time Markov chains (Sec. 7.1)
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Statistical inference.
Distribution Function properties. Density Function – We define the derivative of the distribution function F X (x) as the probability density function.
Discrete Random Variables: PMFs and Moments Lemon Chapter 2 Intro to Probability
General information CSE : Probabilistic Analysis of Computer Systems
Functions of Random Variables. Methods for determining the distribution of functions of Random Variables 1.Distribution function method 2.Moment generating.
Winter 2006EE384x1 Review of Probability Theory Review Session 1 EE384X.
Functions of Random Variables. Methods for determining the distribution of functions of Random Variables 1.Distribution function method 2.Moment generating.
Unit 5 Section 5-4 – Day : The Binomial Distribution  The mean, variance, and standard deviation of a variable that has the binomial distribution.
Use of moment generating functions 1.Using the moment generating functions of X, Y, Z, …determine the moment generating function of W = h(X, Y, Z, …).
Convergence in Distribution
4-1 Continuous Random Variables 4-2 Probability Distributions and Probability Density Functions Figure 4-1 Density function of a loading on a long,
One Random Variable Random Process.
Probability and Statistics Dr. Saeid Moloudzadeh Random Variables/ Distribution Functions/ Discrete Random Variables. 1 Contents Descriptive.
IE 300, Fall 2012 Richard Sowers IESE. 8/30/2012 Goals: Rules of Probability Counting Equally likely Some examples.
Week 121 Law of Large Numbers Toss a coin n times. Suppose X i ’s are Bernoulli random variables with p = ½ and E(X i ) = ½. The proportion of heads is.
By Satyadhar Joshi. Content  Probability Spaces  Bernoulli's Trial  Random Variables a. Expectation variance and standard deviation b. The Normal Distribution.
Psychology 202a Advanced Psychological Statistics September 29, 2015.
Probability Distributions and Expected Value
Simulation Discrete Variables. What is it? A mathematical model Probabilistic Uses the entire range of possible values of a variable in the model.
Geology 6600/7600 Signal Analysis 04 Sep 2014 © A.R. Lowry 2015 Last time: Signal Analysis is a set of tools used to extract information from sequences.
Conditional Probability 423/what-is-your-favorite-data-analysis-cartoon 1.
Conditional probability
Probabilistic Analysis of Computer Systems
Probability for Machine Learning
Appendix A: Probability Theory
Psychology 202a Advanced Psychological Statistics
Conditional Probability on a joint discrete distribution
Chapter 3 Discrete Random Variables and Probability Distributions
Tutorial 9: Further Topics on Random Variables 2
ASV Chapters 1 - Sample Spaces and Probabilities
6.2/6.3 Probability Distributions and Distribution Mean
Further Topics on Random Variables: 1
Chapter 5 – Probability Rules
Presentation transcript:

CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Multiple random variables Transform methods (Sec , 4.5.7)

Sum of random variables: Expectation  Expectation of a sum of two random variables:  Expectation of a sum of n random variables:  Special case: All the random variables have the same mean

Sum of random variables: Expectation  Alternate expression for variance:

Sum of random variables: Expectation  Example: Variance of the number of heads in a sequence of three coin tosses

Sum of random variables: Variance  Exponential random variable:

Sum of random variables: Variance

Moment generating function  Definition:

Moment generating function (contd..)  Laplace-Stilje’s transform:

Moment generating function (contd..)  Probability Generating Function:

Moment generating function (contd..)  How to use these functions:

Moment generating function (contd..)  Laplace-Stilje’s transform of the exponential distribution:

Moment generating function (contd..)  Convolution theorem:

Moment generating function (contd..)  Sum of exponential random variables (Erlang distribution):