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

On the asymptotic properties of the likelihood estimates and some inferential issues related to hidden truncated Pareto (type II) model

Author

Listed:
  • Indranil Ghosh

Abstract

The usefulness of a hidden truncated Pareto (type II) model along with its’ inference under both the classical and Bayesian paradigm have been discussed in the literature in great details. In the multivariate set-up, some discussions are made that are primarily based on constructing a multivariate hidden truncated Pareto (type II) models with — single variable truncation or more than one variable truncation. However, in all such previous discussions regarding bivariate hidden truncated Pareto models, in the classical estimation set-up, large bias and standard error values for the truncation parameter(s) as well as for the other parameters have been observed, and no discussion was made to address this issue. In this article, we try to address this issue of large bias values by considering constrained optimization via linear/non-linear transformation of the parameters following the strategy as proposed (the reference is given in Section 3), in efficiently implementing Newton-Raphson optimization algorithm in R. This plays a major motivation for the present paper. We also derive the observed Fisher Information Matrix. For illustrative purposes, we provide a simulation study to address this issue. A real-life data set is also re-analyzed to study the utility of such two-sided hidden truncation Pareto (type II) models.

Suggested Citation

  • Indranil Ghosh, 2023. "On the asymptotic properties of the likelihood estimates and some inferential issues related to hidden truncated Pareto (type II) model," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 52(15), pages 5133-5144, August.
  • Handle: RePEc:taf:lstaxx:v:52:y:2023:i:15:p:5133-5144
    DOI: 10.1080/03610926.2021.2004422
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03610926.2021.2004422?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:52:y:2023:i:15:p:5133-5144. 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.