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

Development of a new modified hogg type adaptive scheme for multilevel models with diverse error distributions

Author

Listed:
  • Sehar Saleem
  • Rehan Ahmad Khan Sherwani
  • Muhammad Amin

Abstract

The rank-based method is a well-known robust estimation technique in analyzing the linear models for non normal error distributions. The efficiency of rank-based analysis can be upgraded by selecting a suitable score function according to the probability distribution of the error term. In this study, a modified version of Hogg’s type adaptive scheme is developed by introducing a new set of cutoff values. The novel idea is to use the rank-based estimation by using the score functions selected through Hogg’s and modified Hogg’s schemes for multilevel models that generate cluster-correlated errors. The efficiency of both schemes is compared for symmetric, asymmetric, and light-tailed to heavy-tailed error distributions under various sample sizes through simulation study based on bias, variance, mean square error, the selected score function, and precision. The modified Hogg’s scheme produces a more efficient rank-based fit than Hogg’s scheme in case of skewed error distribution and produces equal efficiency for symmetric heavy, moderate, and light-tailed distributions. The empirical comparison of score selection through both schemes is also illustrated via a real example. The modified Hogg’s scheme considered the skewness and selected an appropriate score function, giving a more efficient fit than Hogg’s scheme that ignores the skewness.

Suggested Citation

  • Sehar Saleem & Rehan Ahmad Khan Sherwani & Muhammad Amin, 2023. "Development of a new modified hogg type adaptive scheme for multilevel models with diverse error distributions," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 52(8), pages 2735-2750, April.
  • Handle: RePEc:taf:lstaxx:v:52:y:2023:i:8:p:2735-2750
    DOI: 10.1080/03610926.2021.1959612
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/03610926.2021.1959612?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:8:p:2735-2750. 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.