© 2020 UMass Amherst Global. All rights reserved.
Lessons 14-16
Chapter 6
Multiple Random Variables
ECE 603
Probability and Random
Processes
Objectives
Chapter 6
2
© 2020 UMass Amherst Global. All rights reserved.
• Explore joint distributions and independence.
• Analyze Moment Generating Functions (MGFs).
• Examine random vectors.
Rationale
Chapter 6
3
© 2020 UMass Amherst Global. All rights reserved.
Until now in this course, you have been working with one and two random
variables and how they might be extended to more.
You will now begin considering three or more variables. As the number of
random variables increases, you will notice how the functions become
computationally intractable. This leads to an exploration of other techniques.
Prior Learning
Chapter 6
4
• Basic Concepts
• Counting Methods
• Random Variables
• Access to the online textbook: https://www.probabilitycourse.com/
© 2020 UMass Amherst Global. All rights reserved.
Joint Distributions and Independence
Let be discrete random variables.
Joint PMF:
Chapter 6
5
© 2020 UMass Amherst Global. All rights reserved.
Joint Distributions and Independence
Let be continuous random variables.
Joint PDF:
Chapter 6
6
© 2020 UMass Amherst Global. All rights reserved.
Joint Distributions and Independence
The joint CDF of random variables (both discrete and
continuous) is defined as
Chapter 6
7
© 2020 UMass Amherst Global. All rights reserved.
Joint Distributions and Independence
Random variables are independent, if
Discrete:
Continuous:
Chapter 6
8
© 2020 UMass Amherst Global. All rights reserved.
Joint Distributions and Independence
If random variables are independent, then
Chapter 6
9
© 2020 UMass Amherst Global. All rights reserved.
Joint Distributions and Independence
Definition. Random variables are said to be independent
and identically distributed (i.i.d.) if they are independent, and they have the same
marginal distributions :
Chapter 6
10
© 2020 UMass Amherst Global. All rights reserved.
Joint Distributions and Independence
Example. if random variables are i.i.d., they will have
the same means and variances, so we can write
Chapter 6
11
© 2020 UMass Amherst Global. All rights reserved.
Joint Distributions and Independence
Example. let be i.i.d. with
We define
Find CDF and PDF of
Chapter 6
12
© 2020 UMass Amherst Global. All rights reserved.
Sums of Random Variables
Chapter 6
13
With regards to the linearity of expectation:
© 2020 UMass Amherst Global. All rights reserved.
Sums of Random Variables
Chapter 6
14
Variance of a sum of two and three random variables is
© 2020 UMass Amherst Global. All rights reserved.
Sums of Random Variables
Chapter 6
15
Generally,
© 2020 UMass Amherst Global. All rights reserved.
Sums of Random Variables
Chapter 6
16
If are uncorrelated (i.e. ), then
If are independent then they are uncorrelated, thus
© 2020 UMass Amherst Global. All rights reserved.
Moment Generating Functions
Definition. The th moment of a random variable is defined to be .
The th central moment of is defined to be .
Chapter 6
17
© 2020 UMass Amherst Global. All rights reserved.
Moment Generating Functions
The moment generating function (MGF) of a random variable is a function
defined as
We say that MGF of exists, if there exists a positive constant such that
is finite for all
Chapter 6
18
© 2020 UMass Amherst Global. All rights reserved.
Moment Generating Functions
Example. For each of the following random variables, find the MGF.
a) is a discrete random variable, with PMF
b) is a random variable.
Chapter 6
19
© 2020 UMass Amherst Global. All rights reserved.
Moment Generating Functions
Finding Moments from MGF:
Remember
Chapter 6
20
© 2020 UMass Amherst Global. All rights reserved.
Moment Generating Functions
Thus, we have
Chapter 6
21
© 2020 UMass Amherst Global. All rights reserved.
Moment Generating Functions
We can obtain all moments of from its MGF:
Chapter 6
22
© 2020 UMass Amherst Global. All rights reserved.
Moment Generating Functions
Example. Let . Find the MGF of , and all
of its moments, .
Chapter 6
23
© 2020 UMass Amherst Global. All rights reserved.
Moment Generating Functions
Theorem. Consider two random variables and . Suppose that there exists
a positive constant such that MGFs of and are finite and identical for all
values of in . Then,
MGF determines the distribution.
Chapter 6
24
© 2020 UMass Amherst Global. All rights reserved.
Moment Generating Functions
Sum of Independent Random Variables:
If and are independent RVs and then,
Chapter 6 © 2017 UMass Amherst Global. All rights reserved.
25
Moment Generating Functions
If are independent random variables, then
Chapter 6 © 2017 UMass Amherst Global. All rights reserved.
26
Moment Generating Functions
Example. If find the MGF of .
Chapter 6 © 2017 UMass Amherst Global. All rights reserved.
27
Moment Generating Functions
Example. Using MGFs prove that if and
are independent, then
Chapter 6 © 2017 UMass Amherst Global. All rights reserved.
28
Characteristic Functions
If a random variable does not have a well-defined MGF, we can use the
characteristic function defined as
where and is a real number.
Chapter 6 © 2017 UMass Amherst Global. All rights reserved.
29
Characteristic Functions
Chapter 6 © 2017 UMass Amherst Global. All rights reserved.
30
If and are independent, and , then
Random Vectors
Vectors
Column vector:
Chapter 6
31
© 2020 UMass Amherst Global. All rights reserved.
Random Vectors
Matrix multiplication
Chapter 6
32
© 2020 UMass Amherst Global. All rights reserved.
Random Vectors
Matrix multiplication
Chapter 6
33
© 2020 UMass Amherst Global. All rights reserved.
Random Vectors
When we have random variables we can put them in a
(column) vector .
Chapter 6
34
© 2020 UMass Amherst Global. All rights reserved.
Random Vectors
CDF of the random vector
PDF of the random vector
Chapter 6
35
© 2020 UMass Amherst Global. All rights reserved.
Random Vectors
Expectation:
The expected value vector or the mean vector of the random vector is
defined as
Chapter 6
36
© 2020 UMass Amherst Global. All rights reserved.
Random Vectors
random matrix
Chapter 6
37
© 2020 UMass Amherst Global. All rights reserved.
Random Vectors
Mean matrix of
Chapter 6
38
© 2020 UMass Amherst Global. All rights reserved.
Random Vectors
Linearity of expectation
Chapter 6
39
© 2020 UMass Amherst Global. All rights reserved.
Random Vectors
Linearity of expectation
Also, if are -dimensional random vectors, then we have
Chapter 6
40
© 2020 UMass Amherst Global. All rights reserved.
Random Vectors
Correlation and Covariance Matrix
Chapter 6
41
© 2020 UMass Amherst Global. All rights reserved.
Random Vectors
Correlation and Covariance Matrix
For a random vector , we define the correlation matrix, , as
Chapter 6
42
© 2020 UMass Amherst Global. All rights reserved.
Random Vectors
Covariance
Chapter 6
43
© 2020 UMass Amherst Global. All rights reserved.
Random Vectors
The covariance matrix, , is defined as
Chapter 6
44
© 2020 UMass Amherst Global. All rights reserved.
Random Vectors
Chapter 6
45
© 2020 UMass Amherst Global. All rights reserved.
Random Vectors
Chapter 6
46
© 2020 UMass Amherst Global. All rights reserved.
Random Vectors
Chapter 6
47
Example. Let be an -dimensional random vector and the random vector
be defined as
where is a fixed by matrix and is a fixed -dimensional vector. Show
that
© 2020 UMass Amherst Global. All rights reserved.
Random Vectors
Chapter 6
48
Note:
© 2020 UMass Amherst Global. All rights reserved.
Random Vectors
Chapter 6
49
Proof: Note that by linearity of expectation, we have
By definition, we have
© 2020 UMass Amherst Global. All rights reserved.
Random Vectors
Chapter 6
50
Normal (Gaussian) Random Vectors:
Random variables are said to be jointly normal if, for all
, the random variable
is a normal random variable.
© 2020 UMass Amherst Global. All rights reserved.
Random Vectors
Chapter 6
51
A random vector
is said to be normal or Gaussian if the random variables are
jointly normal.
© 2020 UMass Amherst Global. All rights reserved.
Random Vectors
Chapter 6
52
Standard Normal Random Variable:
© 2020 UMass Amherst Global. All rights reserved.
Random Vectors
Chapter 6
53
Standard normal random vector:
© 2020 UMass Amherst Global. All rights reserved.
Random Vectors
Chapter 6
54
Then,
© 2020 UMass Amherst Global. All rights reserved.
Random Vectors
Chapter 6
55
For a standard normal random vector , where 's are i.i.d. and ,
the PDF is given by
© 2020 UMass Amherst Global. All rights reserved.
Random Vectors
Chapter 6
56
Generally,
For a normal random vector with mean and covariance matrix , the PDF is
given by
© 2020 UMass Amherst Global. All rights reserved.
Random Vectors
Chapter 6
57
If is a normal random vector, and we know
for all , then are independent.
Another important result is that if
© 2020 UMass Amherst Global. All rights reserved.
Random Vectors
Chapter 6
58
If is a normal random vector, , is
an by fixed matrix, and is an -dimensional fixed vector, then the
random vector is a normal random vector with mean
and covariance matrix .
© 2020 UMass Amherst Global. All rights reserved.
Random Vectors
Chapter 6
59
Example. Let be a normal random vector with the following mean
vector and covariance matrix
Let also
© 2020 UMass Amherst Global. All rights reserved.
Random Vectors
a) Find
b) Find the expected value vector of
c) Find the covariance matrix of
d) Find
Chapter 6
60
© 2020 UMass Amherst Global. All rights reserved.
Probability Bounds
1) Union Bound and its Extensions
2) Markov and Chebyshev's Inequalities
3) Chernoff Bounds
4) Cauchy‐Schwarz Inequality
5) Jenson's Inequality
Chapter 6
61
© 2020 UMass Amherst Global. All rights reserved.
Probability Bounds
Usefulness:
1) Generality
2) When exact computation is not possible.
Chapter 6
62
© 2020 UMass Amherst Global. All rights reserved.
Probability Bounds
Remember:
More generally:
Chapter 6
63
© 2020 UMass Amherst Global. All rights reserved.
Probability Bounds
The Union Bound
For any events , we have
Chapter 6
64
© 2020 UMass Amherst Global. All rights reserved.
Probability Bounds
Example. Random Graphs: .
The number of nodes
Probability of connection between two nodes (independent from other
edges).
Chapter 6
65
© 2020 UMass Amherst Global. All rights reserved.
Probability Bounds
Example. Let be the event that a graph randomly generated according to
model has at least one isolated node (a node that is not connected to
any other nodes). Show that
b) And conclude that for any , if then
Chapter 6
66
© 2020 UMass Amherst Global. All rights reserved.
Probability Bounds
It is an interesting exercise to calculate exactly using the inclusion-
exclusion principle:
Chapter 6
67
© 2020 UMass Amherst Global. All rights reserved.
Probability Bounds
Generalization of the Union Bound: Bonferroni Inequalities
For any events , we have
Chapter 6
68
© 2020 UMass Amherst Global. All rights reserved.
Probability Bounds
Markov's Inequality
If is any nonnegative random variable, then
Chapter 6
69
© 2020 UMass Amherst Global. All rights reserved.
Probability Bounds
Let be any positive continuous random variable, we can write
Chapter 6
70
© 2020 UMass Amherst Global. All rights reserved.
Probability Bounds
Chebyshev's Inequality
If is any random variable, then for any , we have
Chapter 6
71
© 2020 UMass Amherst Global. All rights reserved.
Probability Bounds
Let be any random variable. If , then is a nonnegative
random variable.
Chapter 6
72
© 2020 UMass Amherst Global. All rights reserved.
Probability Bounds
Chernoff Bounds
Chapter 6
73
© 2020 UMass Amherst Global. All rights reserved.
Probability Bounds
For , we can write
Chapter 6
74
© 2020 UMass Amherst Global. All rights reserved.
Probability Bounds
Cauchy-Schwarz Inequality
For any two random variables and , we have
where equality holds if and only if , for some constant
Chapter 6
75
© 2020 UMass Amherst Global. All rights reserved.
Probability Bounds
Chapter 6
76
assuming
© 2020 UMass Amherst Global. All rights reserved.
Probability Bounds
Jensen's Inequality
Remember
If
Chapter 6
77
© 2020 UMass Amherst Global. All rights reserved.
Probability Bounds
Jensen's Inequality
Chapter 6
78
© 2020 UMass Amherst Global. All rights reserved.
Probability Bounds
Definition. Consider a function , where is an interval in . We
say that is a convex function if, for any two points and in and any
, we have
We say that is concave if
Chapter 6
79
© 2020 UMass Amherst Global. All rights reserved.
Probability Bounds
Jensen's Inequality
If is a convex function on , and and are finite,
then
Chapter 6
80
© 2020 UMass Amherst Global. All rights reserved.
Probability Bounds
A twice-differentiable function is convex if and only if
for all
Chapter 6
81
© 2020 UMass Amherst Global. All rights reserved.
Post-work for Lesson
Chapter 6
82
• Complete homework assignment for Lessons 14-16:
HW#8
Go to the online classroom for details.
© 2020 UMass Amherst Global. All rights reserved.
To Prepare for the Next Lesson
Chapter 6
83
• Read Chapter 7 in your online textbook:
https://www.probabilitycourse.com/chapter6/6_0_0_intro.php
• Complete the Pre-work for Lesson 17.
Visit the online classroom for details.
© 2020 UMass Amherst Global. All rights reserved.

Chapter 6 L14-16.pptx

  • 1.
    © 2020 UMassAmherst Global. All rights reserved. Lessons 14-16 Chapter 6 Multiple Random Variables ECE 603 Probability and Random Processes
  • 2.
    Objectives Chapter 6 2 © 2020UMass Amherst Global. All rights reserved. • Explore joint distributions and independence. • Analyze Moment Generating Functions (MGFs). • Examine random vectors.
  • 3.
    Rationale Chapter 6 3 © 2020UMass Amherst Global. All rights reserved. Until now in this course, you have been working with one and two random variables and how they might be extended to more. You will now begin considering three or more variables. As the number of random variables increases, you will notice how the functions become computationally intractable. This leads to an exploration of other techniques.
  • 4.
    Prior Learning Chapter 6 4 •Basic Concepts • Counting Methods • Random Variables • Access to the online textbook: https://www.probabilitycourse.com/ © 2020 UMass Amherst Global. All rights reserved.
  • 5.
    Joint Distributions andIndependence Let be discrete random variables. Joint PMF: Chapter 6 5 © 2020 UMass Amherst Global. All rights reserved.
  • 6.
    Joint Distributions andIndependence Let be continuous random variables. Joint PDF: Chapter 6 6 © 2020 UMass Amherst Global. All rights reserved.
  • 7.
    Joint Distributions andIndependence The joint CDF of random variables (both discrete and continuous) is defined as Chapter 6 7 © 2020 UMass Amherst Global. All rights reserved.
  • 8.
    Joint Distributions andIndependence Random variables are independent, if Discrete: Continuous: Chapter 6 8 © 2020 UMass Amherst Global. All rights reserved.
  • 9.
    Joint Distributions andIndependence If random variables are independent, then Chapter 6 9 © 2020 UMass Amherst Global. All rights reserved.
  • 10.
    Joint Distributions andIndependence Definition. Random variables are said to be independent and identically distributed (i.i.d.) if they are independent, and they have the same marginal distributions : Chapter 6 10 © 2020 UMass Amherst Global. All rights reserved.
  • 11.
    Joint Distributions andIndependence Example. if random variables are i.i.d., they will have the same means and variances, so we can write Chapter 6 11 © 2020 UMass Amherst Global. All rights reserved.
  • 12.
    Joint Distributions andIndependence Example. let be i.i.d. with We define Find CDF and PDF of Chapter 6 12 © 2020 UMass Amherst Global. All rights reserved.
  • 13.
    Sums of RandomVariables Chapter 6 13 With regards to the linearity of expectation: © 2020 UMass Amherst Global. All rights reserved.
  • 14.
    Sums of RandomVariables Chapter 6 14 Variance of a sum of two and three random variables is © 2020 UMass Amherst Global. All rights reserved.
  • 15.
    Sums of RandomVariables Chapter 6 15 Generally, © 2020 UMass Amherst Global. All rights reserved.
  • 16.
    Sums of RandomVariables Chapter 6 16 If are uncorrelated (i.e. ), then If are independent then they are uncorrelated, thus © 2020 UMass Amherst Global. All rights reserved.
  • 17.
    Moment Generating Functions Definition.The th moment of a random variable is defined to be . The th central moment of is defined to be . Chapter 6 17 © 2020 UMass Amherst Global. All rights reserved.
  • 18.
    Moment Generating Functions Themoment generating function (MGF) of a random variable is a function defined as We say that MGF of exists, if there exists a positive constant such that is finite for all Chapter 6 18 © 2020 UMass Amherst Global. All rights reserved.
  • 19.
    Moment Generating Functions Example.For each of the following random variables, find the MGF. a) is a discrete random variable, with PMF b) is a random variable. Chapter 6 19 © 2020 UMass Amherst Global. All rights reserved.
  • 20.
    Moment Generating Functions FindingMoments from MGF: Remember Chapter 6 20 © 2020 UMass Amherst Global. All rights reserved.
  • 21.
    Moment Generating Functions Thus,we have Chapter 6 21 © 2020 UMass Amherst Global. All rights reserved.
  • 22.
    Moment Generating Functions Wecan obtain all moments of from its MGF: Chapter 6 22 © 2020 UMass Amherst Global. All rights reserved.
  • 23.
    Moment Generating Functions Example.Let . Find the MGF of , and all of its moments, . Chapter 6 23 © 2020 UMass Amherst Global. All rights reserved.
  • 24.
    Moment Generating Functions Theorem.Consider two random variables and . Suppose that there exists a positive constant such that MGFs of and are finite and identical for all values of in . Then, MGF determines the distribution. Chapter 6 24 © 2020 UMass Amherst Global. All rights reserved.
  • 25.
    Moment Generating Functions Sumof Independent Random Variables: If and are independent RVs and then, Chapter 6 © 2017 UMass Amherst Global. All rights reserved. 25
  • 26.
    Moment Generating Functions Ifare independent random variables, then Chapter 6 © 2017 UMass Amherst Global. All rights reserved. 26
  • 27.
    Moment Generating Functions Example.If find the MGF of . Chapter 6 © 2017 UMass Amherst Global. All rights reserved. 27
  • 28.
    Moment Generating Functions Example.Using MGFs prove that if and are independent, then Chapter 6 © 2017 UMass Amherst Global. All rights reserved. 28
  • 29.
    Characteristic Functions If arandom variable does not have a well-defined MGF, we can use the characteristic function defined as where and is a real number. Chapter 6 © 2017 UMass Amherst Global. All rights reserved. 29
  • 30.
    Characteristic Functions Chapter 6© 2017 UMass Amherst Global. All rights reserved. 30 If and are independent, and , then
  • 31.
    Random Vectors Vectors Column vector: Chapter6 31 © 2020 UMass Amherst Global. All rights reserved.
  • 32.
    Random Vectors Matrix multiplication Chapter6 32 © 2020 UMass Amherst Global. All rights reserved.
  • 33.
    Random Vectors Matrix multiplication Chapter6 33 © 2020 UMass Amherst Global. All rights reserved.
  • 34.
    Random Vectors When wehave random variables we can put them in a (column) vector . Chapter 6 34 © 2020 UMass Amherst Global. All rights reserved.
  • 35.
    Random Vectors CDF ofthe random vector PDF of the random vector Chapter 6 35 © 2020 UMass Amherst Global. All rights reserved.
  • 36.
    Random Vectors Expectation: The expectedvalue vector or the mean vector of the random vector is defined as Chapter 6 36 © 2020 UMass Amherst Global. All rights reserved.
  • 37.
    Random Vectors random matrix Chapter6 37 © 2020 UMass Amherst Global. All rights reserved.
  • 38.
    Random Vectors Mean matrixof Chapter 6 38 © 2020 UMass Amherst Global. All rights reserved.
  • 39.
    Random Vectors Linearity ofexpectation Chapter 6 39 © 2020 UMass Amherst Global. All rights reserved.
  • 40.
    Random Vectors Linearity ofexpectation Also, if are -dimensional random vectors, then we have Chapter 6 40 © 2020 UMass Amherst Global. All rights reserved.
  • 41.
    Random Vectors Correlation andCovariance Matrix Chapter 6 41 © 2020 UMass Amherst Global. All rights reserved.
  • 42.
    Random Vectors Correlation andCovariance Matrix For a random vector , we define the correlation matrix, , as Chapter 6 42 © 2020 UMass Amherst Global. All rights reserved.
  • 43.
    Random Vectors Covariance Chapter 6 43 ©2020 UMass Amherst Global. All rights reserved.
  • 44.
    Random Vectors The covariancematrix, , is defined as Chapter 6 44 © 2020 UMass Amherst Global. All rights reserved.
  • 45.
    Random Vectors Chapter 6 45 ©2020 UMass Amherst Global. All rights reserved.
  • 46.
    Random Vectors Chapter 6 46 ©2020 UMass Amherst Global. All rights reserved.
  • 47.
    Random Vectors Chapter 6 47 Example.Let be an -dimensional random vector and the random vector be defined as where is a fixed by matrix and is a fixed -dimensional vector. Show that © 2020 UMass Amherst Global. All rights reserved.
  • 48.
    Random Vectors Chapter 6 48 Note: ©2020 UMass Amherst Global. All rights reserved.
  • 49.
    Random Vectors Chapter 6 49 Proof:Note that by linearity of expectation, we have By definition, we have © 2020 UMass Amherst Global. All rights reserved.
  • 50.
    Random Vectors Chapter 6 50 Normal(Gaussian) Random Vectors: Random variables are said to be jointly normal if, for all , the random variable is a normal random variable. © 2020 UMass Amherst Global. All rights reserved.
  • 51.
    Random Vectors Chapter 6 51 Arandom vector is said to be normal or Gaussian if the random variables are jointly normal. © 2020 UMass Amherst Global. All rights reserved.
  • 52.
    Random Vectors Chapter 6 52 StandardNormal Random Variable: © 2020 UMass Amherst Global. All rights reserved.
  • 53.
    Random Vectors Chapter 6 53 Standardnormal random vector: © 2020 UMass Amherst Global. All rights reserved.
  • 54.
    Random Vectors Chapter 6 54 Then, ©2020 UMass Amherst Global. All rights reserved.
  • 55.
    Random Vectors Chapter 6 55 Fora standard normal random vector , where 's are i.i.d. and , the PDF is given by © 2020 UMass Amherst Global. All rights reserved.
  • 56.
    Random Vectors Chapter 6 56 Generally, Fora normal random vector with mean and covariance matrix , the PDF is given by © 2020 UMass Amherst Global. All rights reserved.
  • 57.
    Random Vectors Chapter 6 57 Ifis a normal random vector, and we know for all , then are independent. Another important result is that if © 2020 UMass Amherst Global. All rights reserved.
  • 58.
    Random Vectors Chapter 6 58 Ifis a normal random vector, , is an by fixed matrix, and is an -dimensional fixed vector, then the random vector is a normal random vector with mean and covariance matrix . © 2020 UMass Amherst Global. All rights reserved.
  • 59.
    Random Vectors Chapter 6 59 Example.Let be a normal random vector with the following mean vector and covariance matrix Let also © 2020 UMass Amherst Global. All rights reserved.
  • 60.
    Random Vectors a) Find b)Find the expected value vector of c) Find the covariance matrix of d) Find Chapter 6 60 © 2020 UMass Amherst Global. All rights reserved.
  • 61.
    Probability Bounds 1) UnionBound and its Extensions 2) Markov and Chebyshev's Inequalities 3) Chernoff Bounds 4) Cauchy‐Schwarz Inequality 5) Jenson's Inequality Chapter 6 61 © 2020 UMass Amherst Global. All rights reserved.
  • 62.
    Probability Bounds Usefulness: 1) Generality 2)When exact computation is not possible. Chapter 6 62 © 2020 UMass Amherst Global. All rights reserved.
  • 63.
    Probability Bounds Remember: More generally: Chapter6 63 © 2020 UMass Amherst Global. All rights reserved.
  • 64.
    Probability Bounds The UnionBound For any events , we have Chapter 6 64 © 2020 UMass Amherst Global. All rights reserved.
  • 65.
    Probability Bounds Example. RandomGraphs: . The number of nodes Probability of connection between two nodes (independent from other edges). Chapter 6 65 © 2020 UMass Amherst Global. All rights reserved.
  • 66.
    Probability Bounds Example. Letbe the event that a graph randomly generated according to model has at least one isolated node (a node that is not connected to any other nodes). Show that b) And conclude that for any , if then Chapter 6 66 © 2020 UMass Amherst Global. All rights reserved.
  • 67.
    Probability Bounds It isan interesting exercise to calculate exactly using the inclusion- exclusion principle: Chapter 6 67 © 2020 UMass Amherst Global. All rights reserved.
  • 68.
    Probability Bounds Generalization ofthe Union Bound: Bonferroni Inequalities For any events , we have Chapter 6 68 © 2020 UMass Amherst Global. All rights reserved.
  • 69.
    Probability Bounds Markov's Inequality Ifis any nonnegative random variable, then Chapter 6 69 © 2020 UMass Amherst Global. All rights reserved.
  • 70.
    Probability Bounds Let beany positive continuous random variable, we can write Chapter 6 70 © 2020 UMass Amherst Global. All rights reserved.
  • 71.
    Probability Bounds Chebyshev's Inequality Ifis any random variable, then for any , we have Chapter 6 71 © 2020 UMass Amherst Global. All rights reserved.
  • 72.
    Probability Bounds Let beany random variable. If , then is a nonnegative random variable. Chapter 6 72 © 2020 UMass Amherst Global. All rights reserved.
  • 73.
    Probability Bounds Chernoff Bounds Chapter6 73 © 2020 UMass Amherst Global. All rights reserved.
  • 74.
    Probability Bounds For ,we can write Chapter 6 74 © 2020 UMass Amherst Global. All rights reserved.
  • 75.
    Probability Bounds Cauchy-Schwarz Inequality Forany two random variables and , we have where equality holds if and only if , for some constant Chapter 6 75 © 2020 UMass Amherst Global. All rights reserved.
  • 76.
    Probability Bounds Chapter 6 76 assuming ©2020 UMass Amherst Global. All rights reserved.
  • 77.
    Probability Bounds Jensen's Inequality Remember If Chapter6 77 © 2020 UMass Amherst Global. All rights reserved.
  • 78.
    Probability Bounds Jensen's Inequality Chapter6 78 © 2020 UMass Amherst Global. All rights reserved.
  • 79.
    Probability Bounds Definition. Considera function , where is an interval in . We say that is a convex function if, for any two points and in and any , we have We say that is concave if Chapter 6 79 © 2020 UMass Amherst Global. All rights reserved.
  • 80.
    Probability Bounds Jensen's Inequality Ifis a convex function on , and and are finite, then Chapter 6 80 © 2020 UMass Amherst Global. All rights reserved.
  • 81.
    Probability Bounds A twice-differentiablefunction is convex if and only if for all Chapter 6 81 © 2020 UMass Amherst Global. All rights reserved.
  • 82.
    Post-work for Lesson Chapter6 82 • Complete homework assignment for Lessons 14-16: HW#8 Go to the online classroom for details. © 2020 UMass Amherst Global. All rights reserved.
  • 83.
    To Prepare forthe Next Lesson Chapter 6 83 • Read Chapter 7 in your online textbook: https://www.probabilitycourse.com/chapter6/6_0_0_intro.php • Complete the Pre-work for Lesson 17. Visit the online classroom for details. © 2020 UMass Amherst Global. All rights reserved.

Editor's Notes

  • #2 Now: Slides with Annotation Next: Slides with Annotation   *****Preparation Notes***** Students taking this course should already have covered linear algebra elsewhere. We will use linear algebra extensively in this course.
  • #3 Now: Slides with Annotation Next: Slides with Annotation
  • #4 Now: Slides with Annotation Next: Slides with Annotation
  • #5 Now: Slides with Annotation Next: Slides with Annotation
  • #6 Now: Slides with Annotation Next: Slides with Annotation
  • #7 Now: Slides with Annotation Next: Slides with Annotation
  • #8 Now: Slides with Annotation Next: Slides with Annotation
  • #9 Now: Slides with Annotation Next: Slides with Annotation
  • #10 Now: Slides with Annotation Next: Slides with Annotation
  • #11 Now: Slides with Annotation Next: Slides with Annotation
  • #12 Now: Slides with Annotation Next: Slides with Annotation
  • #13 Now: Slides with Annotation Next: Slides with Annotation
  • #14 Now: Slides with Annotation Next: Slides with Annotation
  • #15 Now: Slides with Annotation Next: Slides with Annotation
  • #16 Now: Slides with Annotation Next: Slides with Annotation
  • #17 Now: Slides with Annotation Next: Slides with Annotation
  • #18 Now: Slides with Annotation Next: Slides with Annotation
  • #19 Now: Slides with Annotation Next: Slides with Annotation
  • #20 Now: Slides with Annotation Next: Slides with Annotation
  • #21 Now: Slides with Annotation Next: Slides with Annotation
  • #22 Now: Slides with Annotation Next: Slides with Annotation
  • #23 Now: Slides with Annotation Next: Slides with Annotation
  • #24 Now: Slides with Annotation Next: Slides with Annotation
  • #25 Now: Slides with Annotation Next: Slides with Annotation
  • #26 Now: Slides with Annotation Next: Slides with Annotation
  • #27 Now: Slides with Annotation Next: Slides with Annotation
  • #28 Now: Slides with Annotation Next: Slides with Annotation
  • #29 Now: Slides with Annotation Next: Slides with Annotation
  • #30 Now: Slides with Annotation Next: Slides with Annotation
  • #31 Now: Slides with Annotation Next: Slides with Annotation
  • #32 Now: Slides with Annotation Next: Slides with Annotation
  • #33 Now: Slides with Annotation Next: Slides with Annotation
  • #34 Now: Slides with Annotation Next: Slides with Annotation
  • #35 Now: Slides with Annotation Next: Slides with Annotation
  • #36 Now: Slides with Annotation Next: Slides with Annotation
  • #37 Now: Slides with Annotation Next: Slides with Annotation
  • #38 Now: Slides with Annotation Next: Slides with Annotation
  • #39 Now: Slides with Annotation Next: Slides with Annotation
  • #40 Now: Slides with Annotation Next: Slides with Annotation
  • #41 Now: Slides with Annotation Next: Slides with Annotation
  • #42 Now: Slides with Annotation Next: Slides with Annotation
  • #43 Now: Slides with Annotation Next: Slides with Annotation
  • #44 Now: Slides with Annotation Next: Slides with Annotation
  • #45 Now: Slides with Annotation Next: Slides with Annotation
  • #46 Now: Slides with Annotation Next: Slides with Annotation
  • #47 Now: Slides with Annotation Next: Slides with Annotation
  • #48 Now: Slides with Annotation Next: Slides with Annotation
  • #49 Now: Slides with Annotation Next: Slides with Annotation
  • #50 Now: Slides with Annotation Next: Slides with Annotation
  • #51 Now: Slides with Annotation Next: Slides with Annotation
  • #52 Now: Slides with Annotation Next: Slides with Annotation
  • #53 Now: Slides with Annotation Next: Slides with Annotation
  • #54 Now: Slides with Annotation Next: Slides with Annotation
  • #55 Now: Slides with Annotation Next: Slides with Annotation
  • #56 Now: Slides with Annotation Next: Slides with Annotation
  • #57 Now: Slides with Annotation Next: Slides with Annotation
  • #58 Now: Slides with Annotation Next: Slides with Annotation
  • #59 Now: Slides with Annotation Next: Slides with Annotation
  • #60 Now: Slides with Annotation Next: Slides with Annotation
  • #61 Now: Slides with Annotation Next: Slides with Annotation
  • #62 Now: Slides with Annotation Next: Slides with Annotation
  • #63 Now: Slides with Annotation Next: Slides with Annotation
  • #64 Now: Slides with Annotation Next: Slides with Annotation
  • #65 Now: Slides with Annotation Next: Slides with Annotation
  • #66 Now: Slides with Annotation Next: Slides with Annotation
  • #67 Now: Slides with Annotation Next: Slides with Annotation
  • #68 Now: Slides with Annotation Next: Slides with Annotation
  • #69 Now: Slides with Annotation Next: Slides with Annotation
  • #70 Now: Slides with Annotation Next: Slides with Annotation
  • #71 Now: Slides with Annotation Next: Slides with Annotation
  • #72 Now: Slides with Annotation Next: Slides with Annotation
  • #73 Now: Slides with Annotation Next: Slides with Annotation
  • #74 Now: Slides with Annotation Next: Slides with Annotation
  • #75 Now: Slides with Annotation Next: Slides with Annotation
  • #76 Now: Slides with Annotation Next: Slides with Annotation
  • #77 Now: Slides with Annotation Next: Slides with Annotation
  • #78 Now: Slides with Annotation Next: Slides with Annotation
  • #79 Now: Slides with Annotation Next: Slides with Annotation
  • #80 Now: Slides with Annotation Next: Slides with Annotation
  • #81 Now: Slides with Annotation Next: Slides with Annotation
  • #82 Now: Slides with Annotation Next: Slides with Annotation
  • #83 Now: Slides with Annotation Next: Slides with Annotation
  • #84 Now: Slides with Annotation