IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v44y1993i1p75-88.html
   My bibliography  Save this article

On the optimality of multivariate Poisson approximation

Author

Listed:
  • Witte, Hans-Jürgen

Abstract

Let {[xi]i}1 [less-than-or-equals, slant] i [less-than-or-equals, slant] n be a sequence of independent Bernoulli point processes defined on a complete separable metric space (E, [delta]) (i.e., [xi]i is a random measure with P([xi]i(B) = 1) = 1 - P([xi]i(B) = 0) = E[xi]i(B) for each relatively compact Borel set B [subset, double equals] E), [xi] = [summation operator]ni = 1 [xi]i a Poisson-Bernoulli point process and the success probabilities pi = E[xi]i(E), 1 [less-than-or-equals, slant] i [less-than-or-equals, slant] n, be ordered according to their magnitude. The problem under consideration is the optimal fit of a Poisson point process [eta] = [summation operator]ni = 1 [eta]i to [xi] with respect to the total variation distance where the Poisson point processes [eta]i are independent with intensity measures proportional to those of the Bernoulli point processes. In case that the supports of the Bernoulli point processes are mutually disjoint it is proved under rather weak constraints that the optimal approximation is achieved by distributing the total intensity or mass E[eta](E) = -[summation operator]ni = 1 log(1 - pi) emphasizing those point processes with the smallest intensities. To be more precise, E[eta]i(E) = pi/(1 - pi), k [less-than-or-equals, slant] i [less-than-or-equals, slant] n, for some suitable k, and the remaining mass is distributed equally to the rest of the Poisson point processes disregarding the differences of the success probabilities. For the above case the exact minimal total variation is calculated which is an upper bound, in general. As the solution of the problem is well known in case of identically distributed Bernoulli point processes (coinciding supports) and the supports can be chosen to overlap to an arbitrary extent this evaluates the whole bandwidth of possibly best approximations providing sharp upper and lower bounds for the total variation distance. The result is applied to Poisson approximations to the multinomial distribution and the record counting process (i.e., the process counting the records of an i.i.d. sequence of random variables with continuous distribution).

Suggested Citation

  • Witte, Hans-Jürgen, 1993. "On the optimality of multivariate Poisson approximation," Stochastic Processes and their Applications, Elsevier, vol. 44(1), pages 75-88, January.
  • Handle: RePEc:eee:spapps:v:44:y:1993:i:1:p:75-88
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0304-4149(93)90038-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Borovkov, K. A. & Pfeifer, D., 1996. "Pseudo-Poisson approximation for Markov chains," Stochastic Processes and their Applications, Elsevier, vol. 61(1), pages 163-180, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:spapps:v:44:y:1993:i:1:p:75-88. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.