✦ LIBER ✦

Rates of convergence of approximate maximum likelihood estimators in the Ornstein-Uhlenbeck process

✍ Scribed by J.P.N. Bishwal; A. Bose

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 828 KB
Volume: 42
Category: Article
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(01)00127-4

No coin nor oath required. For personal study only.

✦ Synopsis

Berry-Esseen bounds, with random and nonrandom normings, and large deviation probability bounds for two approximate maximum likelihood estimators of the drift parameter in the

Ornstein-Uhlenbeck process are obtained when the process is observed at equally spaced dense time points. Also obtained are the rates at which these estimators converge to the maximum likelihood estimator based on continuous observation.

📜 SIMILAR VOLUMES

Accuracy of normal approximation for the

Accuracy of normal approximation for the maximum likelihood estimator and Bayes estimators in the Ornstein–Uhlenbeck process using random normings

✍ J.P.N. Bishwal 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 124 KB

Optimal designs for parameter estimation

Optimal designs for parameter estimation of the Ornstein–Uhlenbeck process

✍ Maroussa Zagoraiou; Alessandro Baldi Antognini 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 152 KB 👁 2 views

## Abstract This paper deals with optimal designs for Gaussian random fields with constant trend and exponential correlation structure, widely known as the Ornstein–Uhlenbeck process. Assuming the maximum likelihood approach, we study the optimal design problem for the estimation of the trend µ and

Non-convergence of the approximate maxim

Non-convergence of the approximate maximum likelihood identification algorithm

✍ V. Panuska 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 205 KB

The question of non-convergence of the approximate maximum likelihood identification algorithm is discussed. It is pointed out that although there are systems for which in theory the algorithm does not converge to any finite limit, the computer implementation always gives results which settle at con

Maximum Likelihood Estimation of the Mor

Maximum Likelihood Estimation of the Mortality Rate Function

✍ B. N. Dimitrov; S. T. Rachev; Dr. Sci. A. Yu. Yakovlev 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 465 KB 👁 2 views

Maximum likelihood estimator is obtained for the mortality rate function of a specific type appearing in survival data andysis. Strict consistency of this estimator is proved.

On minimum L1-norm estimate of the param

On minimum L1-norm estimate of the parameter of the Ornstein—Uhlenbeck process

✍ Y. Kutoyants; P. Pilibossian 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 314 KB

Comments on ‘non-convergence of the appr

Comments on ‘non-convergence of the approximate maximum likelihood identification algorithm’

✍ Lennart Ljung 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 130 KB

The following three comments and claims are made: 1. The 'approximate maximum likelihood method ' [called RELS in (S6derstr6m et al., 1978)] may work well in applications even though it has been proven that it does not always converge. 2. It was incorrect in (\* Ljung et al., 1975) to call the 'si