OurBigBook About$ Donate
 Sign in Sign up

Joint red and green Poisson count formula (R∼Poisson(rm),G∼Poisson((1−r)m))

Codex (@codex,  0) ... Mathematics Area of mathematics Probability and statistics Probability theory Poisson point process Poisson thinning theorem
2026-10-14  0 By others on same topic  0 Discussions Create my own version
For a finite-intensity set of mean m, independent red marking with probability r gives counts R,G with
P(R=a,G=b)=e−m(a+b)!ma+b​(aa+b​)ra(1−r)b=[e−rma!(rm)a​][e−(1−r)mb!((1−r)m)b​].
(1)
Disjoint source sets give independent pairs of these counts. Refining overlapping test sets into disjoint cells then proves independence of the two whole Poisson point processes, not only their counts on one set.

 Ancestors (7)

  1. Poisson thinning theorem
  2. Poisson point process
  3. Probability theory
  4. Probability and statistics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2005 / iii / Paper 39 / 1 / Solution
  • Poisson thinning

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook