Skip to main content

Research Repository

Advanced Search

A Randomized Sequential Procedure to Determine the Number of Factors

Trapani, Lorenzo

Authors



Abstract

© 2018, © 2018 American Statistical Association. This article proposes a procedure to estimate the number of common factors k in a static approximate factor model. The building block of the analysis is the fact that the first k eigenvalues of the covariance matrix of the data diverge, while the others stay bounded. On the grounds of this, we propose a test for the null that the ith eigenvalue diverges, using a randomized test statistic based directly on the estimated eigenvalue. The test only requires minimal assumptions on the data, and no assumptions are required on factors, loadings or idiosyncratic errors. The randomized tests are then employed in a sequential procedure to determine k. Supplementary materials for this article are available online.

Journal Article Type Article
Publication Date Jun 26, 2018
Journal Journal of the American Statistical Association
Print ISSN 0162-1459
Electronic ISSN 1537-274X
Publisher Taylor & Francis Open
Peer Reviewed Peer Reviewed
Volume 113
Issue 523
Pages 1341-1349
APA6 Citation Trapani, L. (2018). A Randomized Sequential Procedure to Determine the Number of Factors. Journal of the American Statistical Association, 113(523), 1341-1349. https://doi.org/10.1080/01621459.2017.1328359
DOI https://doi.org/10.1080/01621459.2017.1328359
Keywords Approximate factor models, Randomised tests, Number of factors
Publisher URL https://www.tandfonline.com/doi/full/10.1080/01621459.2017.1328359
Copyright Statement Copyright information regarding this work can be found at the following address: http://eprints.nottingh.../end_user_agreement.pdf
Additional Information This is an Accepted Manuscript of an article published by Taylor & Francis in Journal of the American Statistical Association on 26/06/2017, available online: http://www.tandfonline....0/01621459.2017.1328359

Files

Trapani4R.pdf (2.5 Mb)
PDF

Copyright Statement
Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf





You might also like



Downloadable Citations

;