Scribd
Upload
4 views1 page

Probability Concepts and Calculations

The document covers key concepts in probability and statistics, including the use of complements, expected value, and variance. It explains sample spaces, conditional probability, and independence of events, along with methods for calculating probabilities and arrangements. Additionally, it introduces the concept of a spanning subgraph in graph theory.

Uploaded by

martinlapczyk33
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views1 page

Probability Concepts and Calculations

The document covers key concepts in probability and statistics, including the use of complements, expected value, and variance. It explains sample spaces, conditional probability, and independence of events, along with methods for calculating probabilities and arrangements. Additionally, it introduces the concept of a spanning subgraph in graph theory.

Uploaded by

martinlapczyk33
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Final Review

1.​ Abuse complements and realize that A and B are disjoint


2.​ Expected value is sum of: (probability*variable value)-also, linearity of expectation
means E(X+Y)=E(X)+E(Y); variance is E[(X-mean)^2]
3.​ At least 1=use complement of success probability

Lesson 16
-sample space: pair (S,P) where S is a finite non empty set and P is a function such that
sum of P(s)=1; basically, S is a value or event and P is probability of it occurring
-if one has a sample space of n(say for spinning coins) and one wants to see how many
𝑛
times the event h occurs; one can calculate this by (𝑛 ℎ)/2 , where 2 can be replaced by
the number of possible outcomes in one event(for instance, spinning a coin has 2
outcomes)
-remember to subtract from options when non replacement
-use factorials and falling factorials when necessary, like assessing possible
arrangements of things; also remember the k^n thing

Lecture 17
-conditional probability=P(𝐴 ∩ 𝐵)/P(B); P(B) can’t be 0
-to prove independence, show that P(𝐴 ∩ 𝐵)=P(A)*P(B)

Lecture 18
-another way of proving independence(this case for random variables) is P(A)=
𝑃(𝐴 ∩ 𝐵) + 𝑃(𝐴 ∩ 𝐵(𝑐𝑜𝑚𝑝𝑙𝑒𝑚𝑒𝑛𝑡))
-Var(X)=E(X^2)-E(X)^2

Lecture 19

Lecture 23
-spanning subgraph: subgraph created by edge deletion

You might also like