Join free to take this lesson
Anyone can look around, but taking a lesson needs a free account. With one, your answers are checked step by step and your progress is saved, so you can stop and pick up where you left off on any device.
10 steps ยท about 18 min
By the end you can
- Compute the probability of $k$ arrivals in an interval, with the rate converted to the right time unit
- Use the exponential distribution for waiting times, and explain the memoryless property
- Merge independent streams of arrivals by adding their rates
Who it is for: You know the Poisson distribution (lesson 5.5) and the exponential function (lesson 1.5).
The steps
- Overdue?
- Counting arrivals
- Exactly two
- Waiting times are exponential
- A quiet spell
- Memoryless light bulbs
- Merging and splitting streams
- First call from either line
- At most one
- Where the model breaks
Discussion 0 comments
Log in to join the discussion.