Asymptotic normality of generalized maximum spacing estimators for multivariate observations
Kristi Kuljus, Bo Ranneby

TL;DR
This paper proves the asymptotic normality of generalized maximum spacing estimators for multivariate data using nearest neighbor balls, extending univariate concepts to higher dimensions.
Contribution
It introduces a generalized class of maximum spacing estimators for multivariate observations and establishes their asymptotic normality under correct model assumptions.
Findings
Asymptotic normality is established for the estimators.
Nearest neighbor balls serve as a multidimensional analogue to univariate spacings.
The results hold when the true density belongs to the model class.
Abstract
In this paper, the maximum spacing method is considered for multivariate observations. Nearest neighbour balls are used as a multidimensional analogue to univariate spacings. A class of information-type measures is used to generalize the concept of maximum spacing estimators. Asymptotic normality of these generalized maximum spacing estimators is proved when the assigned model class is correct, that is the true density is a member of the model class.
| 1.8434 | |
| 2.2130 | |
| 1.9265 | |
| 2.3421 | |
| 2.7493 | |
| 3.6546 |
| 10 | 0.3910 | 1.1613 | 0.2769 |
|---|---|---|---|
| 30 | 0.3641 | 1.0580 | 0.2514 |
| 40 | 0.3399 | 1.0025 | 0.2368 |
| 60 | 0.2796 | 0.8124 | 0.1924 |
| 100 | 0.2213 | 0.6450 | 0.1527 |
| 200 | 0.1576 | 0.4673 | 0.1101 |
| 500 | 0.1233 | 0.3504 | 0.0836 |
| 700 | 0.0382 | 0.1193 | 0.0282 |
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Distribution Estimation and Applications · Advanced Statistical Methods and Models · Probabilistic and Robust Engineering Design
Asymptotic normality of generalized maximum spacing
estimators for multivariate observations
Kristi Kuljusa and Bo Rannebyb
aInstitute of Mathematics and Statistics, University of Tartu
bDepartment of Forest Economics, Swedish University of Agricultural Sciences
Abstract
In this paper, the maximum spacing method is considered for multivariate observations. Nearest neighbour balls are used as a multidimensional analogue to univariate spacings. A class of information-type measures is used to generalize the concept of maximum spacing estimators. Asymptotic normality of these generalized maximum spacing estimators is proved when the assigned model class is correct, that is the true density is a member of the model class.
Key words: asymptotic normality, consistency, divergence measures, maximum spacing estimation, nearest neighbour balls.
1 Generalized maximum spacing estimators
1.1 Introduction
For independent and identically distributed univariate observations a new estimation method, the maximum spacing (MSP) method, was defined in Ranneby (1984) and independently by Cheng and Amin (1983). In Ranneby et al. (2005), the MSP method was extended to multivariate observations for the Kullback-Leibler information measure. In Kuljus and Ranneby (2015), the multivariate maximum spacing estimation method based on nearest neighbour balls was considered for a broader class of information-type measures. Weak and strong consistency of these generalized maximum spacing (GMSP) estimators under general conditions was proved. In the univariate case such GMSP estimators based on different metrics were studied in Ranneby and Ekström (1997), Ekström (2001) and Ghosh and Jammalamadaka (2001), in the last work also asymptotic normality of GMSP estimates was proved. Consistency and asymptotic normality of GMSP estimates in the univariate case was also considered in Luong (2018). As exemplified already in Ranneby (1984), an advantage of the maximum spacing method compared to the maximum likelihood method is the possibility of checking the validity of the assigned model class at the same time with solving the estimation problem. In Kuljus and Ranneby (2015) it was demonstrated that combining information from spacing functions under different divergence measures can provide further insight in the model validation context. In the present paper we study asymptotic normality of GMSP estimators for information-type measures considered in Kuljus and Ranneby (2015).
1.2 Notation and definitions
Let be a sequence of independent and identically distributed -dimensional random vectors with distribution that is absolutely continuous with respect to Lebesgue measure. Let the corresponding density function be . Define the nearest neighbour distance to the random variable as
[TABLE]
Let denote the ball of radius and center . Let denote the nearest neighbour of and let denote its nearest neighbour ball, i.e. this is a ball with center and radius . Suppose we assign a model with density functions , where , and assume that the true density belongs to the family with the parameter vector given by . Define random variables as
[TABLE]
In Kuljus and Ranneby (2015) the maximum spacing method was generalized to multivariate observations for strictly concave functions with maximum at . The generalized maximum spacing function was defined as
[TABLE]
Definition 1**.**
The parameter value that maximizes is called the generalized maximum spacing estimate (GMSP estimate) of and denoted by . If is not attained for any in the admissible set , then the GMSP estimate is defined as any point of that satisfies
[TABLE]
where is a sequence of constants such that as .
Examples of functions satisfying the conditions given above are:
[TABLE]
[TABLE]
where , , and . Here corresponds to Jeffreys’ divergence measure, to the Hellinger distance, to Vajda’s measure of information and to Rényi’s divergence measure. In this article, we will consider only for function families and . For , we restrict to . Observe that corresponds to with and corresponds to with . Thus, and with will be covered by .
To prove asymptotic normality of , we will work with the partial derivatives of , the vector of partial derivatives is denoted by . Let . Then
[TABLE]
Define and as follows:
[TABLE]
Observe that can be written as
[TABLE]
Since
[TABLE]
it follows that is obtained from by substituting the integral quantities above with their almost sure limits. Let and .
1.3 Idea for proving asymptotic normality of
Let denote the point maximizing the expectation function , thus it satisfies . Recall that satisfies . Consistency of implies that a sequence can be chosen so that slowly enough to ensure
[TABLE]
We will show that converges uniformly to in a neighbourhood of , thus as . Therefore, we will consider shrinking neighbourhoods , where and is such, that for every . The key steps for proving asymptotic normality of are the following.
Step 1. First we will show that
[TABLE]
is asymptotically normally distributed. To prove asymptotic normality of this quantity, we will interpret it as a function of a weighted empirical process which converges weakly to a Gaussian process.
Step 2. We will prove that
[TABLE]
Thus, has the same asymptotic distribution as .
Step 3. To finalize proving asymptotic normality of , we will follow the approach by Huber (1967) and show that
[TABLE]
Expanding around then gives that is asymptotically normally distributed.
Crucial for proving (1) is Lemma 3 in Huber (1967) stating that
[TABLE]
Since our assumptions imply that is continuously differentiable in a neighbourhood of with a negative definite derivative matrix , there exists such that when is large enough. Thus, the convergence in (2) follows if
[TABLE]
holds. Therefore, we will work with expressions having in the denominator.
Convergence of the weighted empirical process in Step 1 is used to prove asymptotic normality of general functions of the process. Both convergences will be proved in Section 2. In Section 3, this result will be applied for proving asymptotic normality of the approximation of our function of interest, that is . Step 2 will also be proved in Section 3. Section 4 deals with Step 3: bracketing technique and a stochastic differentiability condition will be used to prove asymptotic normality of .
1.4 Assumptions
We will work with first and second order derivatives of different functions with respect to the components , , of the parameter vector . The notations and will be used instead of and , respectively, when the computations are analogous or a certain condition has to hold independently of . Let denote a neighbourhood of . Asymptotic normality of will be proved under different combinations (depending on the function ) of the following assumptions:
- A1
is an open set in , is uniformly bounded and continuous on
- A2
Assume that is an interior point of . Suppose and its first and second order derivatives with respect to the components of are continuous in and in .
- A3
[TABLE]
- A4
The following random variables are uniformly integrable:
[TABLE]
- A5
The following random variables are uniformly integrable:
[TABLE]
- A6
The following random variables are uniformly integrable:
[TABLE]
- A7
[TABLE]
- A8
The following random variables are uniformly integrable:
[TABLE]
- A9
For some , ,
[TABLE]
- A10
[TABLE]
Let be the Radon-Nikodym derivative of a finite measure with respect to the Lebesgue measure on . The following two remarks give two examples of conditions when A4 and A5 are satisfied.
Remark 1**.**
Suppose
[TABLE]
then A4 holds. If we instead assume , then A6 holds.
Remark 2**.**
If for some constants , and , ,
[TABLE]
then A4 and A5 follow from A3.
2 Asymptotic normality of weighted empirical processes
In this section we will modify the results of Schilling (1983) and prove that a weighted empirical process of converges to a Gaussian process. Using a suitable transformation we then obtain asymptotic normality of
[TABLE]
where is a function of bounded variation on for any , and is a continuous weight function with the properties , . To prove asymptotic normality of the sum above, we use results from Bickel and Breiman (1983), Schilling (1983) and Zhou and Jammalamadaka (1993). Let
[TABLE]
where represents the volume of a -dimensional sphere of radius . In Bickel and Breiman (1983), it is shown that the normalized (centered and scaled) empirical distribution function of converges under the true distribution weakly to a Gaussian process with mean zero and covariance function independent of the true underlying density. In Schilling (1983), the same result is proved for a weighted empirical process with a bounded continuous weight function. To be able to use Theorem 2.2 from Schilling (1983), we will study truncated weight functions defined as follows. Since
[TABLE]
we can find for every a constant such that
[TABLE]
Define a bounded weight function as follows:
[TABLE]
Take , then and .
The general ideology for proving the convergence
[TABLE]
where , will be as follows. We consider bounded weight functions defined as in and define the weighted empirical processes and :
[TABLE]
[TABLE]
From Schilling (1983) it follows that converges weakly to a Gaussian process. For large we have . Thus, if we can show that is tight and for every , then converges to the same Gaussian process. Therefore, using the results from Bickel and Breiman (1983), Schilling (1983) and Zhou and Jammalamadaka (1993), we can show that
[TABLE]
where is a Gaussian process with mean zero and with a certain covariance function. We then apply the integral transform
[TABLE]
to and obtain via the desired result.
Proposition 1**.**
Suppose A1 and the following conditions hold:
[TABLE]
Then defined in (4) converges weakly to a Gaussian process with mean zero and covariance function , where is given by
[TABLE]
where
[TABLE]
with and corresponding to the volumes and of the balls and , respectively.
Proof.
From Schilling (1983) it follows directly that the centered empirical process converges weakly to the Gaussian process defined above. To conclude that converges to the same limit, we prove that for every , , and that is tight.
a) That as , follows with minor modifications from Zhou and Jammalamadaka (1993). Since
[TABLE]
[TABLE]
we need to show that
[TABLE]
[TABLE]
The convergence of both terms follows as in the proof of Proposition 1 of Zhou and Jammalamadaka (1993). For the proof of the convergence of the covariance term, Lemma 2.11 in Bickel and Breiman (1983) is fundamental.
b) Tightness of can be proved similarly to Schilling (1983) and Bickel and Breiman (1983). As in Schilling (1983), we can split as follows: , where
[TABLE]
It is enough to show that is tight. Let , then
[TABLE]
[TABLE]
[TABLE]
[TABLE]
Thus, applying Theorem 2.1 in Bickel and Breiman (1983) gives that for some constant ,
[TABLE]
where is a continuous distribution function defined as
[TABLE]
The rest of the proof goes according to Schilling (1983) and Bickel and Breiman (1983). ∎
Proposition 2**.**
Suppose the assumptions of Proposition 1 hold and is of bounded variation on for each . Let . Then
[TABLE]
where
[TABLE]
with .
Proof.
Recall the definition of the empirical process in (4). In the proof of Proposition 2 in Zhou and Jammalamadaka (1993) it is shown that for some , , . Therefore it follows according to our assumption that , which implies (see e.g. Cramér and Leadbetter (1967), p. 90-91) that for every ,
[TABLE]
Analogously,
[TABLE]
Therefore, is well defined and it holds with probability one that
[TABLE]
Since is of bounded variation on for every , it follows from Proposition 1 that
[TABLE]
Because
[TABLE]
[TABLE]
it follows according to Theorem 4.2 in Billingsley (1968) that
[TABLE]
The variance of the limiting distribution can now be calculated using the covariance function of . That the random variable on the right hand side of (6) is normally distributed, follows since it is an integral of a normal process. ∎
Proposition 3**.**
Assume the assumptions of Proposition 2 are valid. Substitute the truncated function with and suppose . Then
[TABLE]
Proof.
Let and . Then
[TABLE]
To prove that the covariance term converges to zero as , we use the conditional approach of Schilling (1986). Let denote the event that the nearest neighbour of is . Consider the following five mutually exclusive sets for various nearest neighbour geometries of and :
[TABLE]
[TABLE]
Then,
[TABLE]
[TABLE]
Given , we have independence, therefore the covariance is zero. Since for , , it is sufficient to show that the conditional expectations tend to zero as , . We have
[TABLE]
[TABLE]
Thus, Theorem 4.2 in Billingsley (1968) implies (7). ∎
3 Asymptotic normality of the derivative of the GMSP function
In Proposition 3 we proved asymptotic normality for a general function satisfying and . Since any linear combination of such functions has also expectation zero and a finite second moment, we can use Proposition 3 for proving asymptotic normality of our random vector of interest. Let denote the Fisher information matrix at , that is is the covariance matrix of .
Proposition 4**.**
Suppose that satisfies the conditions of Proposition 2. Assume that holds for all the partial derivatives and that the covariance matrix is positive definite. Then
[TABLE]
converges in distribution to a normal distribution with mean zero and with covariance matrix , where is calculated as in . Observe that depends on function since .
Proof.
Let . Define as
[TABLE]
The assertion then follows from Proposition 3 by using the Cramér-Wold device. ∎
Proposition 5**.**
Consider a random vector such that and the components of are continuous functions of only . Then
[TABLE]
Proof.
We have to show that for any -continuity set and any -continuity set ,
[TABLE]
where the last equality holds since and are independent. Since and is also independent of , Theorem 4.3 in Billingsley (1968) implies that (8) is the same as
[TABLE]
∎
Lemma 1**.**
Suppose assumptions
i) A2, A3, A4
ii) A2, A3
are fulfilled. Then uniformly for as for the functions i) , , with , and ii) with , respectively.
The proof of Lemma 1 is given in the Appendix. Suppose that has a unique maximum at in . This holds for example under the following weak identifiability condition:
[TABLE]
where is Lebesgue measure. Then it follows from Lemma 1 that . In the following we assume that (9) is fulfilled.
Proposition 6**.**
Suppose assumptions
i) A2, A3, A4, A5
ii) A2, A3, A4, A5, A7
iii) A2, A3, A7
are fulfilled. Then
[TABLE]
holds for the functions i) , with , ii) , iii) with , respectively.
Proof.
Since we are considering convergence in probability, there is no restriction to assume that the studied parameter is one-dimensional (corresponds to looking at the components separately). Let . Observe that and
[TABLE]
But , cf. the proof of Proposition 3. Given , the variables and are independent, thus . For , and . Therefore, the assertion follows if . Write as
[TABLE]
[TABLE]
and recall that
[TABLE]
Proposition 5 together with Lemma 1 imply that and . Thus, follows because under our assumptions the random variables and are uniformly integrable. ∎
4 Asymptotic normality of GMSP estimate via stochastic differentiability
To prove asymptotic normality of , we need to use a stochastic differentiability condition similar to Pollard (1985) and Huber (1967). We will prove that
[TABLE]
where is a compact set shrinking to as .
To prove (10), we will consider the numerator of the expression in (10) separately on a compact set and its complement , and show that the contribution from is arbitrarily small when choosing large enough. Let
[TABLE]
[TABLE]
Consider the following decomposition of the numerator in (10):
[TABLE]
[TABLE]
[TABLE]
We are going to show the following:
- , a compact set can be chosen so that for large ,
[TABLE]
- for any compact set ,
[TABLE]
Therefore, (11) and (12) together imply (10).
Let denote the following matrix of partial derivatives:
[TABLE]
where is the th element of the vector . Recall that and denote the th component of the vectors and , respectively. Let with , .
Lemma 2**.**
Suppose assumptions
i) A6, A8, A9
ii) A6, A8, A10
iii) A3, A10
are fulfilled. Then the following assertions hold for i) , with , ii) and iii) with , respectively. In a neighbourhood of , is continuously differentiable. Furthermore, uniformly for as .
Proof.
The assumptions of the lemma ensure uniform integrability of the random variables . Thus,
[TABLE]
Therefore, we can differentiate under the integral sign and
[TABLE]
Since are continuous functions of , it follows from (13) and the Lebesgue dominated convergence theorem that is continuous in . Proposition 5 implies . The uniform integrability gives for every . The uniform convergence of can be proved in the same way as the uniform convergence of in Lemma 1. ∎
Proposition 7**.**
Suppose the assumptions of Lemma 2 hold. Then a compact set can be chosen so that (11) holds for large for , and with .
Proof.
Since is a vector and the Euclidean norm of a vector is smaller than the sum of the absolute values of its components, it is equivalent to work with single components of the vector and show that the contribution from each component is small. Applying the mean value theorem we obtain:
[TABLE]
[TABLE]
[TABLE]
Thus,
[TABLE]
[TABLE]
[TABLE]
if is large and if for some . ∎
To prove (12), we will use Lemma 4 in Pollard (1985), which is based on bracketing technique, see van der Vaart (2000) and Pollard (1985). The bracketing condition enables to divide the parameter set of interest into a finite number of subsets and study the supremum of interest over a finite number of smaller parameter sets. We need also to use the following property of the radii of our nearest neighbour balls: for every . Therefore, according to Egoroff’s theorem there exists for each a set with such that uniformly on . Therefore, we can define a set , such that .
Bracketing. Lemma 4 in Pollard (1985) will be applied to functions in
[TABLE]
Since , , are identically distributed, we can suppress in , , and right now. That the bracketing condition is fulfilled follows since the functions satisfy a Lipschitz condition
[TABLE]
where
[TABLE]
with
[TABLE]
[TABLE]
and where for some constant , when is large enough.
Proposition 8**.**
Consider a compact set . Suppose assumption A2 is fulfilled. Then the family satisfies the bracketing condition and holds for some constant and for large . Therefore, the convergence in (12) holds for , and with .
Proof.
For the bracketing condition to be fulfilled we need to show that . Since this follows from , we are going to prove that
[TABLE]
[TABLE]
Define the closed -neighbourhood , where . When and , we have for large enough that . Therefore, for large ,
[TABLE]
[TABLE]
where the last inequality holds because is uniformly continuous on . In a similar way we obtain
[TABLE]
Since and has moments of all orders, (14) and (15) follow for our functions , and . The finite expectation implies
[TABLE]
and that the bracketing functions have finite variance. Moreover, in the same way as in the proof of Proposition 6 it can be shown that
[TABLE]
see also p. 306 and the proof of Lemma 4 in Pollard (1985). As , (12) follows due to Lemma 4 in Pollard (1985). ∎
As the last step we will use Lemma 3 in Huber (1967) and prove the asymptotic normality of .
Theorem 1**.**
Let hold. Suppose is positive definite and the assumptions of Proposition 6, 7 and 8 are satisfied. Then
[TABLE]
where .
Proof.
[TABLE]
Applying the mean value theorem to we obtain that there exists such that
[TABLE]
where denotes the th row of the matrix . Define a matrix , where the rows are given by , . We use the argument in to indicate that it comes from an application of the mean value theorem to the components of . As uniformly for , it follows that is invertible for large and . Therefore, for some ,
[TABLE]
It follows that
[TABLE]
which corresponds to Lemma 3 in Huber (1967). Applying Theorem 3 in Huber (1967) and using the consistency of gives
[TABLE]
where is asymptotically normally distributed with mean zero and covariance matrix . It follows that . Applying the mean value theorem again gives that for some depending on , we can define a matrix so that . As , we obtain
[TABLE]
[TABLE]
Thus, . It follows that
[TABLE]
and thus,
[TABLE]
Using that , the assertion follows. ∎
5 Discussion
For univariate spacings asymptotic normality of GMSP estimators has been shown in Ghosh and Jammalamadaka (2001). Recently, Luong (2018) also considered consistency and asymptotic normality of univariate GMSP estimates. Since the author has overlooked the local dependence between nearest neighbours, the proof of asymptotic normality in Luong (2018) is not correct and thus also the derived asymptotic variance is incorrect. Ghosh and Jammalamadaka (2001) showed that the smallest variance in the asymptotic distribution was obtained for and that this smallest variance coincides with the Cramér-Rao lower bound. We have calculated the constants in the asymptotic covariance matrix for the -functions studied in this article, see Table 1. The smallest variance is obtained for . For the variance increases with increasing values of and when , the variance tends to the variance of .
Table 1 here.
In this article, we have proved asymptotic normality of the generalized maximum spacing estimate around , where maximizes the expectation function . For the asymptotic normality to hold around , it has to be shown that . According to the mean value theorem, for some constant ,
[TABLE]
Thus, if , then follows. The behaviour of depends on what parameters are considered. In the case of multivariate normal distribution it follows because of symmetry that is maximized by regardless of . Thus, . For bivariate normal distribution with we have studied the behaviour of in simulation studies for the following parameter vector: . We simulated a sample of observations from this distribution and calculated for a randomly chosen observation in the sample the quantity
[TABLE]
This procedure was repeated for samples and was estimated with the average of the 10000 values. In Table 2, the mean values over 20 repetitions are presented for the component of that corresponds to . We calculated the values for , and with . It can be seen in Table 2 that for all the considered -functions the estimated values of for the component corresponding to decrease when increases and approach slowly zero. The same behaviour can be observed for and the correlation parameter . Thus, the simulation results indicate that as for the components corresponding to , and , although the convergence is very slow.
Table 2 here.
For most distributions, it is not difficult to check assumptions A3, A7, A9 and A10. Remark 1 is useful for checking assumptions A4, A6 and A8. It is not difficult to verify that our assumptions are satisfied for the class of multivariate normal distributions and for finite mixtures of normal distributions.
Corresponding author
e-mail: [email protected]; address: Institute of Mathematics and Statistics, J. Liivi 2, 50 409, Tartu, Estonia
Acknowledgments
This work is supported by Estonian institutional research funding IUT34-5.
6 Appendix
Proof of Lemma 1.
Proof.
Recall that and . Thus, we can suppress in the notation and write , , and for the random quantities of interest. Since uniform convergence can be proved componentwise, we will write to emphasize that the same approach holds for any component , . We suppress also in vector notations , etc. The uniform convergence of to in holds if
[TABLE]
Thus, we will study
[TABLE]
[TABLE]
We will show that both terms converge to zero under the assumptions of the lemma.
Term. Observe that
[TABLE]
We will exemplify the proof using , the proof is similar for other -functions. For we have , therefore
[TABLE]
Because , we obtain
[TABLE]
[TABLE]
Since and , and since the corresponding moments of and are finite, Term follows because of convergence of the respective expected values and because of Assumptions A3 and A4.
Term. According to Proposition 5, for each . This implies that for any , where is any finite number, the respective finite-dimensional distribution converges to a zero-vector of length in distribution. Observe that are continuous functions of in a neighbourhood of . We will prove tightness of and and use that this together with the convergence of finite-dimensional distributions implies
[TABLE]
Since is uniformly integrable due to our assumptions, we then obtain
[TABLE]
Since both and converge to in distribution, and are tight according to Prohorov’s theorem. To show tightness of , take now arbitrary and . Choose a compact set and a constant such that , . Consider arbitrary , in . Applying the equality
[TABLE]
we obtain
[TABLE]
[TABLE]
[TABLE]
Since our functions of interest are uniformly continuous on , we obtain that there exists such that
[TABLE]
whenever .
Tightness of follows analogously, but now we also need to bring in the set , where uniformly. Therefore, if is large enough and , there exists such that whenever ,
[TABLE]
[TABLE]
become sufficiently small. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1Bickel and Breiman (1983) Bickel, P. J. and Breiman, L. (1983). Sums of functions of nearest neighbor distances, moment bounds, limit theorems and a goodness of fit test. Ann. Probab. , 11(1):185–214.
- 2Billingsley (1968) Billingsley, P. (1968). Convergence of probability measures . Wiley, New York.
- 3Cheng and Amin (1983) Cheng, R. C. and Amin, N. A. (1983). Estimating parameters in continuous univariate distributions with a shifted origin. J. R. Stat. Soc. Ser. B. Stat. Methodol. , 45(3):394–403.
- 4Cramér and Leadbetter (1967) Cramér, H. and Leadbetter, M. R. (1967). Stationary and related stochastic processes . Wiley, New York.
- 5Ekström (2001) Ekström, M. (2001). Consistency of generalized maximum spacing estimates. Scand. J. Stat. , 28:343–354.
- 6Ghosh and Jammalamadaka (2001) Ghosh, K. and Jammalamadaka, S. R. (2001). A general estimation method using spacings. J. Statist. Plann. Inference , 93(1-2):71–82.
- 7Huber (1967) Huber, P. J. (1967). The behaviour of maximum likelihood estimates under nonstandard conditions. In Fifth Berkeley Symposium on Mathematical Statistics and Probability , pages 221–233. University of California, Berkeley.
- 8Kuljus and Ranneby (2015) Kuljus, K. and Ranneby, B. (2015). Generalized maximum spacing estimation for multivariate observations. Scand. J. Stat. , 42:1092–1108.
