IDEAS home Printed from https://ideas.repec.org/a/spr/compst/v16y2001i4d10.1007_s180-001-8328-6.html
   My bibliography  Save this article

The split-up algorithm: a fast symbolic method for computing p-values of distribution-free statistics

Author

Listed:
  • Mark van de Wiel

    (Eindhoven University of Technology)

Abstract

Summary Many distribution-free statistics have the drawback that computing exact p-values under the null hypothesis is an intensive task. When the sample sizes are small or the number of ties is large, approximations are often unsatisfactory. Moreover, tables of exact critical values are not available for conditional rank statistics (ties, censoring), for rank statistics with arbitrary regression constants, or for permutation test statistics. In those cases, it is important to have a fast algorithm for computing exact p-values. We present a new algorithm and apply it to a large class of distribution-free one-sample, two-sample and serial statistics. The algorithm is based on splitting the probability generating function of the test statistic into two parts. We compare the speed of this “split-up algorithm” to that of existing procedures and we conclude that our new algorithm is faster in many cases.

Suggested Citation

  • Mark van de Wiel, 2001. "The split-up algorithm: a fast symbolic method for computing p-values of distribution-free statistics," Computational Statistics, Springer, vol. 16(4), pages 519-538, December.
  • Handle: RePEc:spr:compst:v:16:y:2001:i:4:d:10.1007_s180-001-8328-6
    DOI: 10.1007/s180-001-8328-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s180-001-8328-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s180-001-8328-6?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.

    References listed on IDEAS

    as
    1. Hallin, Marc & Puri, Madan L., 1991. "Time series analysis via rank order theory: Signed-rank tests for ARMA models," Journal of Multivariate Analysis, Elsevier, vol. 39(1), pages 1-29, October.
    2. Marc Hallin & Madan Lal Puri, 1988. "Optimal rank-based procedures for time series analysis: testing an ARMA model against other ARMA models," ULB Institutional Repository 2013/2013, ULB -- Universite Libre de Bruxelles.
    3. Marc Hallin & Guy Melard, 1988. "Rank-based tests for randomness against first-order serial dependence," ULB Institutional Repository 2013/2015, ULB -- Universite Libre de Bruxelles.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. repec:jss:jstsof:28:i08 is not listed on IDEAS
    2. Beninel, Farid & Grelaud, Gerard, 2007. "Exact algorithms for computing p-values of statistics-linear combination of 3-nomial variables," Computational Statistics & Data Analysis, Elsevier, vol. 52(2), pages 737-749, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hallin, M. & Vermandele, C. & Werker, B.J.M., 2003. "Serial and Nonserial Sign-and-Rank Statistics : Asymptotic Representation and Asymptotic Normality," Discussion Paper 2003-23, Tilburg University, Center for Economic Research.
    2. Garel, Bernard & Hallin, Marc, 2000. "Rank-based partial autocorrelations are not asymptotically distribution-free," Statistics & Probability Letters, Elsevier, vol. 47(3), pages 219-227, April.
    3. J. Terpstra & M. Rao, 2001. "Generalized Rank Estimates For An Autoregressive Time Series: A U-Statistic Approach," Statistical Inference for Stochastic Processes, Springer, vol. 4(2), pages 155-179, May.
    4. Miguel A. Delgado, 1996. "Testing Serial Independence Using The Sample Distribution Function," Journal of Time Series Analysis, Wiley Blackwell, vol. 17(3), pages 271-285, May.
    5. Hallin, Marc & La Vecchia, Davide, 2017. "R-estimation in semiparametric dynamic location-scale models," Journal of Econometrics, Elsevier, vol. 196(2), pages 233-247.
    6. Lanh Tran & Ba Chu & Chunfeng Huang & Kim P. Huynh, 2014. "Adaptive permutation tests for serial independence," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 68(3), pages 183-208, August.
    7. Jarle Aarstad & Olav Andreas Kvitastein & Stig-Erik Jakobsen, 2019. "What Drives Enterprise Product Innovation? Assessing How Regional, National, And International Inter-Firm Collaboration Complement Or Substitute For R&D Investments," International Journal of Innovation Management (ijim), World Scientific Publishing Co. Pte. Ltd., vol. 23(05), pages 1-25, June.
    8. Marc Hallin & Bas Werker, 2003. "Semiparametric efficiency, distribution-freeness, and invariance," ULB Institutional Repository 2013/2119, ULB -- Universite Libre de Bruxelles.
    9. Petar Sorić, 2020. "“Normal†growth of the Chinese economy: new metrics based on consumer confidence data," Economics Bulletin, AccessEcon, vol. 40(2), pages 1740-1746.
    10. Guy Melard & Jean-Michel Pasteels, 1998. "User's manual of Time Series Expert: TSE version 2.3," ULB Institutional Repository 2013/14082, ULB -- Universite Libre de Bruxelles.
    11. M. Hallin & D. La Vecchia & H. Liu, 2022. "Center-Outward R-Estimation for Semiparametric VARMA Models," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 117(538), pages 925-938, April.
    12. Bauwens, Luc & Veredas, David, 2004. "The stochastic conditional duration model: a latent variable model for the analysis of financial durations," Journal of Econometrics, Elsevier, vol. 119(2), pages 381-412, April.
    13. Luca Bagnato & Lucio De Capitani & Antonio Punzo, 2014. "Testing Serial Independence via Density-Based Measures of Divergence," Methodology and Computing in Applied Probability, Springer, vol. 16(3), pages 627-641, September.
    14. Diks Cees & Panchenko Valentyn, 2008. "Rank-based Entropy Tests for Serial Independence," Studies in Nonlinear Dynamics & Econometrics, De Gruyter, vol. 12(1), pages 1-21, March.
    15. Massé, Bruno & Viano, Marie-Claude, 1995. "Explicit and exponential bounds for a test on the coefficient of an AR(1) model," Statistics & Probability Letters, Elsevier, vol. 25(4), pages 365-371, December.
    16. Luca Bagnato & Lucio De Capitani & Antonio Punzo, 2017. "A diagram to detect serial dependencies: an application to transport time series," Quality & Quantity: International Journal of Methodology, Springer, vol. 51(2), pages 581-594, March.
    17. Bernard Garel & Marc Hallin, 1995. "Local asymptotic normality of multivariate ARMA processes with a linear trend," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 47(3), pages 551-579, September.
    18. Luca Bagnato & Lucio De Capitani & Antonio Punzo, 2018. "Testing for Serial Independence: Beyond the Portmanteau Approach," The American Statistician, Taylor & Francis Journals, vol. 72(3), pages 219-238, July.
    19. Marc Hallin & Davide La Vecchia, 2014. "Semiparametrically Efficient R-Estimation for Dynamic Location-Scale Models," Working Papers ECARES ECARES 2014-45, ULB -- Universite Libre de Bruxelles.
    20. Giuseppe Cavaliere & Dimitris N. Politis & Anders Rahbek & Karl B. Gregory & Soumendra N. Lahiri & Daniel J. Nordman, 2015. "Recent developments in bootstrap methods for dependent data," Journal of Time Series Analysis, Wiley Blackwell, vol. 36(3), pages 442-461, May.

    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:spr:compst:v:16:y:2001:i:4:d:10.1007_s180-001-8328-6. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.