Notes:Poisson and Gamma distribution

From Maths
Revision as of 18:13, 19 January 2018 by Alec (Talk | contribs) (Changing computer, so saving work)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search
These are PRELIMINARY NOTES: I got somewhere and don't want to lose the work on paper.

Initial notes

Here we will use XPoi(λ) for λR>0 as "events per unit time" for simplicity of conceptualising what's going on, in practice it wont matter what continuous unit is used.


We use the following:

  • Let kN1, we are interested in the distribution of the time until k events have accumulated.
  • Let T be the time until k accumulations, so:
    • F(t):=P[Tt]=1P[T>t][Note 1] and we can use P[T>t] to be "fewer events than k occurred for the range of time [0,t]" or to be more formal / specific:
      • P[T>t]=P[the number of events that occurred for the range of time [0,t]<k]
        =P[the number of events that occurred for the range of time [0,t]k1]


Lastly,

  • If λ is the rate of events per unit time, then for t units of time tλ is the rate of events per t-units of time, so we define:
    • XtPoi(tλ)
  • And we observe:
    • P[the number of events that occurred for the range of time [0,t]k1]
      =P[Xtk1]


We have now discovered:

  • F(t)=P[Tt]=1P[Xtk1], for kN1 remember

Evaluation

We now compute P[Tt]

  • Let's start with P[Tt]=1P[Xtk1]
    =1(k1i=0P[Xt=i]) - notice the sum starts at i=0, as k1 we must at least have one term, the (i=0)th one.
    =1(k1i=0etλ(tλ)ii!)

Notes

  1. Jump up Standard cdf stuff