Idea: Arrivals with no memory
A Poisson process of rate has independent counts in separate windows.
- Count in time : mean and variance both
- Blocks at an hour, window of minutes:
- Answer with first, then compute
Formula: Poisson count
The chance of exactly k arrivals in a window of length t.
Idea: Gaps forget the past
Gaps are independent exponentials with mean . Nothing is ever due.
- After a quiet half hour, the next block is no closer
- Empty window with :
Formula: Merging streams
Merged Poisson streams add their rates; each arrival's source is a coin with these odds.
Quick check: Is the next order a buy?
Buys arrive at a minute and sells at , both Poisson. What is the chance the next order is a buy?
Show the answer
Answer:
Rates add to , and the buy share is .
Example: Where did the blocks fall?
blocks came in hour. What is the chance that exactly fell in the first minutes?
- Given the count, the times are uniform:
Idea: Renewal: gaps of any shape
Independent gaps with one distribution and mean give arrivals at rate .
- Reward per unit time: , a ratio of means
- Gaps of or seconds, chances and : mean
Example: The inspection paradox
Gaps are second with chance , with chance . You arrive at a random moment. Expected length of your gap?
- Your gap:
Common mistake: The average gap is not your gap
Long gaps cover more of the clock, so a random moment lands in them more often.
Instead Use . For Poisson, your gap has mean , not .
Idea: Say it out loud
Name the property you use: independent counts, no memory, merging or splitting.
- Real trades come in bursts: a constant rate is a first model
- Count variance above the mean: a Poisson error bar is too narrow
Courses / Advanced probability models