Exchangeable pairs and Poisson approximation

By Sourav Chatterjee, Persi Diaconis, Elizabeth Meckes. 2004

106 citations recorded by the source corpus.

This is a survery paper on Poisson approximation using Stein's method of exchangeable pairs. We illustrate using Poisson-binomial trials and many variations on three classical problems of combinatorial probability: the matching problem, the coupon collector's problem, and the birthday problem. While many details are new, the results are closely related to a body of work developed by Andrew Barbour, Louis Chen, Richard Arratia, Lou Gordon, Larry Goldstein, and their collaborators. Some comparison with these other approaches is offered.

Subfields: Discrete Mathematics and Combinatorics, Statistics and Probability

View Paper: https://www.semanticscholar.org/paper/c96113491db75ba1828dc24bd6751659c4ce1029

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Discrete Mathematics and Combinatorics

  1. Sourav Chatterjee
  2. Nathan Ross
  3. Matthew Kahle
  4. Elizabeth Meckes
  5. Jason E. Fulman
  6. Persi Diaconis
  7. Robert M. Guralnick
  8. Jim G. Dai

In Statistics and Probability

  1. Sourav Chatterjee
  2. Nathan Ross
  3. Elizabeth Meckes
  4. Matthew Kahle
  5. Persi Diaconis
  6. Robert M. Guralnick
  7. Jason E. Fulman
  8. Victor Chernozhukov

Citations in the corpus