IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v48y2019i7p1682-1692.html
   My bibliography  Save this article

Efficient and superefficient estimators of filtered Poisson process intensities

Author

Listed:
  • Fares Alazemi
  • Khalifa Es-Sebaiy
  • Youssef Ouknine

Abstract

Let NK = {NKt, t ∈ [0, T]} be a filtered Poisson process defined on a probability space (Ω,F,(Ft)t∈[0,T],P)$(\Omega,\mathcal {F},(\mathcal {F}_t)_{t\in [0,T]},P)$, and let θ ≔ (θt, t ∈ [0, T]) be a deterministic function which is the intensity of NK under a probability Pθ. In the present paper we prove that the natural maximum likelihood estimator (MLE) NK is an efficient estimator for θ under Pθ. Using Malliavin calculus we construct superefficient estimators of Stein type for θ which dominate, under the usual quadratic risk, the MLE NK. These superefficient estimators are given under the form NtK+DtN˜Klog(F)$N^K_t+D_t^{\widetilde{N}^K}\log (F)$ where F is a random variable satisfying some assumptions and DtN˜K$D_t^{\widetilde{N}^K}$ is the Malliavin derivative with respect to the compensated version N˜K$\widetilde{N}^K$ of NK.

Suggested Citation

  • Fares Alazemi & Khalifa Es-Sebaiy & Youssef Ouknine, 2019. "Efficient and superefficient estimators of filtered Poisson process intensities," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 48(7), pages 1682-1692, April.
  • Handle: RePEc:taf:lstaxx:v:48:y:2019:i:7:p:1682-1692
    DOI: 10.1080/03610926.2018.1438622
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2018.1438622
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03610926.2018.1438622?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    More about this item

    Statistics

    Access and download statistics

    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:taf:lstaxx:v:48:y:2019:i:7:p:1682-1692. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    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.