Chapter 2 - Review of statistical models Flashcards

1
Q

discrete random variable

A

all possible values of X are countably infinite (or finite)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

probability mass function

A

sum p(x) = 1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

continuous random variables

A

range space is an interval (or collection of intervals) - get probability as integral from a to b

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

cumulative distribution function

A

sum from lowest value in range to current value

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

expectation

A

average or mean
- the expected value of X found by summing probability of X occuring by X

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

n-th moment

A

expectation is the first moment of X - variance is the second

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

variance

A

the expectation of (X - E(X))^2

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

mode

A

discrete = value that occurs most frequently
continuous = where probability distribution function is maximized

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Queuing systems

A
  • probabilistic models used to simulate queuing systems
  • uses gamma, exponential, and Weibull distributions to model interarrival and service times
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Central Limit Theorum

A
  • if have huge sample, distribution approaches a normal distribution
  • may not always be appropriate
  • all our tests rely on this theorum (ex. Z or T tests)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Dominant characteristics of a probability distribution

A
  • mean, variance, and mode
    (mean and mode are the same for a gaussian distribution)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Inventory and Supply Chain

A
  • has at least 3 random variables (number of units demanded per order/time period, time between demands, the lead time - time between placing order for stocking and receive order)
    -lead-time distribution often modelled by a gamma distribution
  • geometric, Poisson, and negative binomial distributions are provide satisfying shapes
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Reliability and Maintainability

A
  • exponential, gamma, and Weibull distribution can be used to model time to failure
  • random failure = exponential
  • standby redundancy (each component has an exponential time to failure) = gamma
  • many components and failure due to serious number of defects = Weibull
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Bernoulli Trials/Distributions

A
  • n trials that can be success or failure
  • mean [E(X)] = p
  • Variance [V(X)] = p(1-p)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Binomial distribution

A
  • number of successes in n Bernoulli trials
  • E(X) = np
  • V(X) = npq
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Geometric distribution

A
  • probability that X will be the first success
  • E(X) = 1/p
  • V(X) = q/p^2
17
Q

Poisson

A
  • when alpha > 0:
  • E(X) = V(X)
18
Q

Uniform Distribution

A
  • probability of each X is equal
19
Q

Poisson Process

A
  • counting process - a stochastic process is a counting process if N(t) represents the total number of events taht occur by time t
  • Assumes:
    1. arrivals occur one at a time
    2. stationary increments - distribution of the numbe rof arrivals between t and t+s depends on the interval s not on t (arrivals are completely random)
    3. independent increaments - number of arrivals during nonoverlapping time intervals are independent random varaibles
  • Poisson arrival processes can be split into 2 independent Poisson arrival processes with probability p and 1-p adn arrival rates of lambda(p) and lambda(p-1)