Asymptotic distribution of CLS estimators in the nearly unstable and unstable PINAR(1) model

Author(s):  
Abderrahmen Manaa ◽  
Wissam Bentarzi
2020 ◽  
Vol 8 (1) ◽  
pp. 11-21
Author(s):  
S. M. Yaroshko ◽  
◽  
M. V. Zabolotskyy ◽  
T. M. Zabolotskyy ◽  
◽  
...  

The paper is devoted to the investigation of statistical properties of the sample estimator of the beta coefficient in the case when the weights of benchmark portfolio are constant and for the target portfolio, the global minimum variance portfolio is taken. We provide the asymptotic distribution of the sample estimator of the beta coefficient assuming that the asset returns are multivariate normally distributed. Based on the asymptotic distribution we construct the confidence interval for the beta coefficient. We use the daily returns on the assets included in the DAX index for the period from 01.01.2018 to 30.09.2019 to compare empirical and asymptotic means, variances and densities of the standardized estimator for the beta coefficient. We obtain that the bias of the sample estimator converges to zero very slowly for a large number of assets in the portfolio. We present the adjusted estimator of the beta coefficient for which convergence of the empirical variances to the asymptotic ones is not significantly slower than for a sample estimator but the bias of the adjusted estimator is significantly smaller.


Author(s):  
Sven-Erik Ekström ◽  
Paris Vassalos

AbstractIt is known that the generating function f of a sequence of Toeplitz matrices {Tn(f)}n may not describe the asymptotic distribution of the eigenvalues of Tn(f) if f is not real. In this paper, we assume as a working hypothesis that, if the eigenvalues of Tn(f) are real for all n, then they admit an asymptotic expansion of the same type as considered in previous works, where the first function, called the eigenvalue symbol $\mathfrak {f}$ f , appearing in this expansion is real and describes the asymptotic distribution of the eigenvalues of Tn(f). This eigenvalue symbol $\mathfrak {f}$ f is in general not known in closed form. After validating this working hypothesis through a number of numerical experiments, we propose a matrix-less algorithm in order to approximate the eigenvalue distribution function $\mathfrak {f}$ f . The proposed algorithm, which opposed to previous versions, does not need any information about neither f nor $\mathfrak {f}$ f is tested on a wide range of numerical examples; in some cases, we are even able to find the analytical expression of $\mathfrak {f}$ f . Future research directions are outlined at the end of the paper.


Author(s):  
Simon Clinet ◽  
William T. M. Dunsmuir ◽  
Gareth W. Peters ◽  
Kylie-Anne Richards

2008 ◽  
Vol 138 (6) ◽  
pp. 1836-1850 ◽  
Author(s):  
Hanxiang Peng ◽  
Shaoli Wang ◽  
Xueqin Wang

1997 ◽  
Vol 65 (1) ◽  
pp. 130-149 ◽  
Author(s):  
Pavel Kargaev ◽  
Anatoly Zhigljavsky

Psychometrika ◽  
1981 ◽  
Vol 46 (3) ◽  
pp. 331-336 ◽  
Author(s):  
Larry V. Hedges ◽  
Ingram Olkin

Sign in / Sign up

Export Citation Format

Share Document