Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-18T06:19:31.401Z Has data issue: false hasContentIssue false

Approximation of the difference of two Poisson-like counts by Skellam

Published online by Cambridge University Press:  26 July 2018

H. L. Gan*
Affiliation:
Northwestern University
Eric D. Kolaczyk*
Affiliation:
Boston University
*
* Postal address: Mathematics Department, Northwestern University, 2033 Sheridan Road, Evanston, IL 60208, USA. Email address: ganhl@math.northwestern.edu
** Postal address: Department of Mathematics and Statistics, Boston University, 111 Cummington Mall, Boston, MA 02215, USA. Email address: kolaczyk@bu.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Poisson-like behavior for event count data is ubiquitous in nature. At the same time, differencing of such counts arises in the course of data processing in a variety of areas of application. As a result, the Skellam distribution – defined as the distribution of the difference of two independent Poisson random variables – is a natural candidate for approximating the difference of Poisson-like event counts. However, in many contexts strict independence, whether between counts or among events within counts, is not a tenable assumption. Here we characterize the accuracy in approximating the difference of Poisson-like counts by a Skellam random variable. Our results fully generalize existing, more limited, results in this direction and, at the same time, our derivations are significantly more concise and elegant. We illustrate the potential impact of these results in the context of problems from network analysis and image processing, where various forms of weak dependence can be expected.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 2018