2Point Estimation
2.1 Introduction
The theory of point estimation is described in most books about mathematical statistics, and we refer here, as in other chapters, mainly to Rasch and Schott (2018).
We describe the problem as follows. Let the distribution Pθ of a random variable y depend on a parameter (vector) θ ∈ Ω ⊆ Rp, p ≥ 1 . With the help of a realisation, Y, of a random sample Y = (y1, y2, … , yn)T, n ≥ 1 we have to make a statement concerning the value of θ (or a function of it). The elements of a random sample Y are independently and identically distributed (i.i.d) like y. Obviously the statement about θ should be as precise as possible. What this really means depends on the choice of the loss function defined in section 1.4 in Rasch and Schott (2018). We define an estimator S(Y), i.e. a measurable mapping of Rn onto Ω taking the value S(Y) for the realisation Y=(y1, y2, … , yn)T of Y, where S(Y) is called the estimate of θ. The estimate is thus the realisation of the estimator. In this chapter, data are assumed to be realisations (y1, y2, … , yn ) of one random sample where n is called the sample size; the case of more than one sample is discussed in the following chapters. The random sample, i.e. the random variable y stems from some distribution, which is described when the method of estimation depends on the distribution – like in the maximum likelihood estimation. For this distribution the rth central moment
is assumed to exist where μ = E(y) is the expectation ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access