On approximate pseudo-maximum likelihood estimation for LARCH-processes

Mathematics – Statistics Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Published in at http://dx.doi.org/10.3150/09-BEJ189 the Bernoulli (http://isi.cbs.nl/bernoulli/) by the International Statisti

Scientific paper

10.3150/09-BEJ189

Linear ARCH (LARCH) processes were introduced by Robinson [J. Econometrics 47 (1991) 67--84] to model long-range dependence in volatility and leverage. Basic theoretical properties of LARCH processes have been investigated in the recent literature. However, there is a lack of estimation methods and corresponding asymptotic theory. In this paper, we consider estimation of the dependence parameters for LARCH processes with non-summable hyperbolically decaying coefficients. Asymptotic limit theorems are derived. A central limit theorem with $\sqrt{n}$-rate of convergence holds for an approximate conditional pseudo-maximum likelihood estimator. To obtain a computable version that includes observed values only, a further approximation is required. The computable estimator is again asymptotically normal, however with a rate of convergence that is slower than $\sqrt{n}.$

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On approximate pseudo-maximum likelihood estimation for LARCH-processes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On approximate pseudo-maximum likelihood estimation for LARCH-processes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On approximate pseudo-maximum likelihood estimation for LARCH-processes will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-459028

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.