An EM type algorithm for maximum likelihood estimation of the normal-inverse Gaussian distribution
The Normal-Inverse Gaussian distribution arises as a Normal variance-mean mixture with an Inverse Gaussian mixing distribution. This article deals with Maximum Likelihood estimation of the parameters of the Normal-Inverse Gaussian distribution. Due to the complexity of the likelihood, direct maximization is difficult. An EM type algorithm is provided for the Maximum Likelihood estimation of the Normal-Inverse Gaussian distribution. This algorithm overcomes numerical difficulties occurring when standard numerical techniques are used. An application to a data set concerning the general index of the Athens Stock Exchange is given. Some operating characteristics of the algorithm are discussed.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 57 (2002)
Issue (Month): 1 (March)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Vrontos, I D & Dellaportas, P & Politis, D N, 2000. "Full Bayesian Inference for GARCH and EGARCH Models," Journal of Business & Economic Statistics, American Statistical Association, vol. 18(2), pages 187-198, April.
- Ole E. Barndorff-Nielsen & Karsten Prause, 2001. "Apparent scaling," Finance and Stochastics, Springer, vol. 5(1), pages 103-113.