Review-Ch 5 Statistics

0.0(0)
studied byStudied by 15 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/48

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

49 Terms

1
New cards

Probabilities

the long run frequency of an event

2
New cards

Probability Rules

  1. ANY Probability is 0≤p(x)≤1

  2. SUM of ALL probabilities is p(sum)=1

  • complement event, event’=1-p(event)

    p(xc)=1-p(x)

  • the ā€˜ and power of c means the notation for the even not occurring

3
New cards

Law of Large numbers

  • in the long run, a cumulative relative frequency is closer and closer to the true probability of an event

  • random sampling, the larger the sample, the closer the proportion of success will be to the proportion of the population.

4
New cards

Simulation Process

  1. Assumptions

    ______ selected independently of EACH other

    ____%

  2. Assign digits & Model

  • Number 01-99, ignore 00 and excess

  • Numbers 00-99

  • single run

  • WHICH/HOW summary statistics will be recorded

  1. Stimulate multiple/many repetitions

  • Record results in a frequency distribution

  1. conclusion

  • Make sure it is in context

  • estimated probability as a decimal

*Try to write EVERY possible outcome

*flip sign and +- SAME constant from mean→ SAME probability

5
New cards

Multiplication Principle

  • The TOTAL possible outcome na wants x nb way

  • Sampling with/without replacement

Math

Independent: P(A) P(B)

Dependent: P(A) * P(B | A)

6
New cards

Conditional Probability

  • May NEED to restrict in denominator values because of the ā€œgiven thatā€ → shrinks the population of interest

Math

P(__| __): given that

7
New cards

Mutually Exclusive

  • Events that cannot occur simultaneously

  • doesn’t imply independence

  • can ADD Probabilities

8
New cards

Independant events

  • Results don’t affect EACH other

  • can multiply probabilities

  • can be assumed for large populations

9
New cards

Dependent events

  • EXPLICITLY write down EACH value/trial because results affect each other

10
New cards

Formula for mutually exclusive or not

Not mutually exclusive

Mutually exclusive

p(AUB)=p(A)+p(B)-p(A∩B)

p(AUB)=p(A)+p(B)

the mutually exclusive is because p(A∩B)=0 because events can’t happen at the SAME time

11
New cards

p(A∩B)

Probability of A and B

Independent:p(A∩B)=p(A)*p(B)

Dependent: (A∩B)=p(A)*p(A|B)

12
New cards

p(A U B)

Probability of A or B

Independent: p(A)+p(B)-p(A∩B)

Dependent: NONE

13
New cards

p(A|B)

Probability of A given that B

Independent: p(A)

Dependent: p(A∩B)/p(B)

14
New cards

Probability distribution

  • the number of practical outcomes of a CHANCE process

  • follows probability rules

  • set number of trials

  • x variable =number of success

  • Scenarios

    • if not ALL values are EXPLICITLY shown for probability → calculate what you can to solve

    • only several values, not all→ consider minimum, mean/median, maximum

<ul><li><p>the number of <strong>practical outcomes</strong> of a CHANCE process </p></li><li><p>follows <strong>probability</strong> rules </p></li><li><p><strong>set number</strong> of trials </p></li><li><p>x variable =<strong>number</strong> of success </p></li><li><p>Scenarios </p><ul><li><p>if <span style="color: red">not</span> ALL values are EXPLICITLY shown for <strong>probability</strong> → calculate what you <mark data-color="green">can</mark> to solve </p></li><li><p>only several values, <span style="color: red">not</span> all→ consider minimum, mean/median, maximum </p></li></ul></li></ul>
15
New cards

Expected value

  • the net value on average

Math

ux=E(x)=np

16
New cards

ux

  • the mean of x variable

Math

ux=Ī£xi *p(xi)

17
New cards

σ x

  • the stndard deviation of x variable

σ x= √ (Σxi - ux )²*p(xi)

sq root all

18
New cards

( σ x)²

  • variance

19
New cards

finiding z score through norrmal distribution

  1. invnorm

  • given the % of area

  • using (o,1) as (u,σ ) for the default

  1. Z formula

  • z=(x-u)/σ

20
New cards

C (Linear transformation )

C=shift in +-

  • only affects the mean

Math

uc+dx=|d|ux+c

σ c+dx=|d|σx

21
New cards

D(Linear transformation )

  • A transformation of *

  • affects BOTH the mean and the standard deviation

Math

uc+dx=|d|ux+c

σ c+dx=|d|σx

22
New cards

u mean (Combining sets)

  • u can also mean E(x), the expected vlalue

Math

ux+y=ux+uy

ux-y=ux-uy

23
New cards

σ standard deviation (Combining sets)

  • for the formulas, need to be √ and have ² inside because standard deviations are ALWAYS positive

Math

σx+y=√(σ²x+σ²y)

σx-y=√(σ²x-σ²y)

24
New cards

σ² varience (Combining sets)

  • Usually, a NEW variable is created which represents a total

  • remove the √ because variance is standard deviation ²

Math

σ²x+y=(σ²x+σ²y)

σ²x-y=(σ²x-σ²y)

25
New cards

Linear Combination

  • when constants are multiplied in

  • for mean, just multiply in

  • for sd and variance, need to square values

Math

u= aux+bux

σ=√a²σx²+ b²σy²

σ²=a²σx²+ b²σy²

26
New cards

Binomial Distribution (Definition)

BINS

B: Binary(2 outcomes ONLY)

I: Independent(outcomes don’t affect impact EACH other)

N: Number of trials is FIXED

S: Success probability (is constant)

  • as n, the number of trials, increases→ shape of distribution becomes MORE normal

27
New cards

Binomial Distribution (steps)

STEPS

  1. Name the distribution(ie. binomial…)

  2. Set Parameters(ie. n=, p=)

  3. Boundaries(eg. at least…)

  4. Direction(inequalities signs)

  5. Correct probability

28
New cards

Binomial Distribution (formula’s)

Math

ux=np

σx√=np(1-p)

σx²=np(1-p)

  • at p=0.5→ variance increases as n increases

  • fixed n value, V is the maximum when p=0.5

<p><u>Math</u></p><p>u<sub>x</sub>=np</p><p>σ<sub>x</sub><mark data-color="yellow">√</mark>=np(1-p)</p><p>σ<sub>x</sub>²=np(1-p)</p><ul><li><p>at p=0.5→ variance <span style="color: green">increases</span> as n <span style="color: green">increases</span></p></li><li><p>fixed n value, V is the <mark data-color="green">maximum</mark> when p=0.5</p></li></ul>
29
New cards

Geometric Distribution (Definition)

BINS

B: Binary(2 outcomes ONLY)

I: Independent(outcomes don’t affect impact EACH other)

N: Number of trials is not FIXED

S: Success probability (is constant)

  • random variable, x, COUNTS trial NO. until the first success

    *most likely value is 1

  • expected trials till nth success = np

  • the probability of EACH success value decreases by a factor of q= 1-p

  • Shape: ALWAYS unimodal and skewed right

30
New cards

Geometric Distribution (steps)

STEPS

  1. Name the distribution(ie. geometric…)

  2. Set Parameters(ie. p=)

  3. The trial on which the first success occurs(x=)

  4. Correct probability

31
New cards

Geometric Distribution (formula’s)

Math

  • q=fail, p=success

q=1-p

ux= 1/p

σx= (√ 1-p)/p

32
New cards

Probability that the 1st success occurs on the xth outcome

p(x=_)=geompdf(p= ,x=)

  • p=probability of a single trial, = first success occurrence

33
New cards

more than x tries till first success(calculator)

p(x>_)=1- geomcdf(p= ,x=)

  • the 1- and the x=number means everything ā€œABOVEā€

34
New cards

cumulative probability of x or BEFORE xth trail

p(x=_)=1geomcdf(p= ,x=)

  • p=probability of a single trial, = first success occurrence

  • n is not given→leave empty

  • ā€œFirst success occurrence ON or BEFORE xth trailā€

35
New cards

Probability of exactly x success

binompdf(n,p,x)

  • n=total no. of trial

  • p=probability of success of a single trial

  • x=number of wanted success’s

36
New cards

Cumulative probability of f or FEWER success in n ways

binomcdf(n,p,x)

  • n=total no. of trial

  • p=probability of success of a single trial

  • x=c or fewer success

37
New cards

At least… binom

p=(x≄number)

1-binomcdf(n=,p=,x=number-1)

38
New cards

fewer than…

(x<number)

binomcdf(n=,p=,x=number-1)

39
New cards
<p>interpret the formula for binomial </p>

interpret the formula for binomial

(n on top of p) = n!/(k!q!)

  • n=total trial no.

  • k=wanted

  • p=probability

  • q=p-1

<p>(n on top of   p) = n!/(k!q!) </p><ul><li><p>n=total trial no.</p></li><li><p>k=wanted</p></li><li><p>p=probability </p></li><li><p>q=p-1</p></li></ul>
40
New cards

Sample space

  • set of ALL possible outcomes

  • ie {H, T}

41
New cards

Event

  • Outcome OR set of outcomes of a random thing

42
New cards

Probability model

  • Assign probabilities to EACH event inn sample space

  • example

    • p(tails)=0.5

    • p(heads)=0.5

43
New cards

Random

  • A regular pattern can be inferred if long repetitious trials are run, but for individual outcomes→this is uncertain

44
New cards

Tree diagram

  • used for multi step problems

  • Label the start and then < grow on

<ul><li><p>used for multi step problems </p></li><li><p>Label the <strong>start</strong> and then &lt; grow on </p></li></ul>
45
New cards

Venn diagrams

  • intersections overlap→ don’t ā€œrepeatā€ them, so may need to use subtraction

  • outside circle: ā€œnone of aboveā€

  • rectangle box=sample space

<ul><li><p>intersections overlap→ <span style="color: red">don’t</span> ā€œrepeatā€ them, so may need to use <span style="color: red">subtraction </span></p></li><li><p>outside circle: ā€œnone of aboveā€</p></li><li><p>rectangle box=<strong>sample space </strong></p></li></ul>
46
New cards

U

add, union

47
New cards

∩

  • or

  • 1 event or BOTH occurring

48
New cards

Relative frequency

  • proportion of times the event happened

number of times event happened/total number of trials

49
New cards

Cumulative probability distribution

  • A function, table, or graph that links outcomes with the probability of less than or equal to that outcome occurring.

<ul><li><p>A function, table, or graph that links <strong>outcomes</strong> with the probability of <strong>less than or equal</strong> to that outcome occurring.</p></li></ul>