Effect of outliers on the estimation of parameters

Summary The estimation of parameter in the type of distributionf(x)=b x ^{–1 /b} exp (–x ^b (/b),x>0, is considered, when several outliers of the type , ,r=1,2, ...,k, are present in the data. The estimates of as well as of 's are put in the closed form. Special cases, Weibull, Gamma and Exponential are considered for the case of single outlier. Actual estimates are calculated from the generated samples of size 2 and 3 for the Weibull and Exponential.     

Wrapped distributions and measurement errors

Summary For a random variableX and >0 letU n (X)–X, wheren (x)=nZ iffx(n–/2,n+/2]. Random variables of this type are important in the theory of measurement errors. We derive formulas for the distribution ofU and apply them to the case XN(,²). General conditions for the unimodality ofU are given. The correlation of the measurement errorsX–E (X) andU (X) is seen to beO (^j) withj depending on the smoothness and asymptotic behavior of the density ofX. This gives a precise sense to the assertion that scale errors upwards and downwards are averagely well-balanced. In the normal case the density ofU is shown to be constant up to , as 0.     

A conventional statistical problem with irregular minimax behavior

Summary The problem of testing the mean vector of the two dimensional circularly symmetrical normal distribution with unit variances, where the data consists of just one sample point inR ², is examined for stability of -maximin criteria. If the null hypothesisH ₀ is the one point set containing the origin and the alternative set equal to the whole ofR ²–H ₀, then the -maximin is not unique. If a zone of indifference _I containingH ₀ is introduced, then the problem of testingH ₀ againstR ² – _I can turn out to have a unique -maximin test. In the present paper we show a class of such _I for which this is the case. We show further that, given any -maximin test for testingH ₀ againstR ²–H ₀, there is a decreasing sequence of _I , with intersection equal toH ₀, for which the corresponding sequence of -maximin tests forH ₀ againstR ² – _I approaches a limit (in the usual weak star topology) which is not equivalent to .     

On functionals of order statistics

Summary Let g_n be real functions,U _ni, 1in, the ordered sample ofn independentU(0,1) distributed random variables, andc _ni(), 1in, 01 be (known) real numbers,n=1, 2, ... The random quantity , 01, is studied. Based on a method proposed byShorack [1972] the main result is the weak convergence of to Gaussian processes, where , 01. The convergence is with respect to theSkorokhod [1956]-topologiesM ₂,M ₁ onD (I) and the -topology onC(I), depending on the conditions imposed on thec _ni().     

A characterization of entropies of degree α

The functional equation has been studied by several authors under various assumptions onf and onk, l. Here we solve this equation iff is measurable andk 3,l 2 are fixed integers. Using the solution we characterize the entropies of degree for all real . Our results generalize the results ofBehara/Nath [1973],Kannappan [1974] andMittal [1976].     

Moment (in-)equalities for differences of order statistics with different sample sizes

Summary Leto _j:n be thej-th order statistic andq _:n the -quantile of sample sizen. Ther-th moment of |o _j1:n1-o _j2:n2| is calculated in terms of hypergeometric distributions. This equality is applied to obtain moment (in-)equalities for |q _:n1-q _:n2|.     

Das maximale signifikanzniveau des Tests: “LehneH o ab,wennk untern gegebenen tests zur ablehnung führen”

Summary On one sample space there aren tests with critical regionsK ₁ and levels of significance _i ,i=1, ...,n (resp.n eventsK _i in a probability space with probabilities not greater than _i ,i=1, ...,n). In this paper we calculate the smallest upper bound of the level of significance of the test reject the hypothesis, if at leastk among the,n tests do so (resp. of the probability of the event at leastk among then events are realized). By the way, we will show, that this smallest upper bound does not change, if we replace at leastk by exactlyk.     

Über die Existenz überall trennscharfer Tests im nicht-dominierten Fall

Einleitung Es sei (,A) ein Meßraum undP eine Familie von Wahrscheinlichkeitsmaßen auf . IstP durch ein -endliches Maß dominiert, so ist nachPfanzagl [1960] für die Existenz eines überall trennscharfen Tests zu jedem Niveau für die HypotheseP=P _o (P, P _o P) gegen die AlternativePP ₀ notwendig und hinreichend, daßP/{P ₀} isotonen Likelihood-Quotienten bzgl.P ₀ besitzt. Für den Fall, daßP total geordnet und dominiert ist, gilt nach [Pfanzagl, 1963] eine entsprechende Aussage: Genau dann existiert zu jedem Niveau ein überall trennscharfer Test, wennP isotonen Likelihood-Quotienten besitzt.Die vorliegende Arbeit zeigt, daß auf die Annahme der Dominiertheit verzichtet werden kann, und liefert darüber hinaus einen einheitlichen Beweis für die beiden oben zitierten Sätze vonPfanzagl.

---

Summary Two theorems ofPfanzagl [1960, 1963] about necessary and sufficient conditions for the existence of uniformly most powerful tests are generalized to the undominated case. Moreover a unified proof for the two theorems ofPfanzagl is given.

     

On the power of nonparametric changepoint-tests

We consider a sequenceX _1n,..., X_nn, n N, of independent random elements. Suppose there exists a [0, 1) such thatX _1n,...,X _(n),n have the distribution v₁ andX _[n]+1.n ,...,X _nn have the distribution v₂v₁. We construct consistent level- tests forH ₀:=0 versusH ₁:(0, 1), which are based on certainU-statistic type processes. A detailed investigation of the power function is also provided.     

Vergleich des verallgemeinerten nichtzentralent-Tests mit dem Binomialtest

Zusammenfassung Es sei {F _,(x); –<<, >0} mitF _,(x)=F((x–)/)–F(x) eine standardisierte Verteilungsfunktion — die Familie der zulässigen Verteilungsfunktionen. Der (früher eingeführte) verallgemeinerte nichtzentralet-Test für die Hypothese {PP ₀} mitP:=F _,(x ₀) gegen die Alternative {P>P ₀} zum Niveau wird mit dem entsprechenden nichtparametrischen Test (Test für die Hypothese {pP ₀} über den Parameterp einer Binomialverteilung gegen die Alternative {p>P ₀}) verglichen. Für dent-Test wird die relative asymptotische Effizienz bestimmt.Beide Tests lassen sich als Tests für das zur WahrscheinlichkeitP ₀ gehörende Quantil einer Verteilungsfunktion interpretieren. Der klassische zentrale Student-Test ergibt sich als Spezialfall (F(x)=(x),P ₀=0,5).

---

Summary Let {F _,(x);–<<, >0} withF _,(x ₀):=F((x–)/–F(x) a standarized distribution function — the family of admissible distribution functions. The (earlier introduced) generalized noncentralt-test for the hypothesis {PP ₀} withP:=F _,(x ₀) against the alternative {P>P ₀} at level of significance is compared with the corresponding nonparametric test (Binomial test). The relative asymptotic efficiency of thet-test is determined. Both kinds of tests can be interpreted as quantiltests. In caseF(x)=(x),P ₀=0,5 one gets the classical central Student-test.

     

Una classe di funzioni monotone generalizzate

Si considera la classe delle funzioni realiF(x,y) definite inS×S, conSR ^N , che soddisfano per ognix,yS la condizione di monotoniaF(x,y)+F(y,x)0. Indebolendo la precedente disuguaglianza si introducono classi di funzioni monotone generalizzate e, supponendo soddisfatta una opportuna condizione di omogeneità, si caratterizzano tali funzioni in base alla struttura del segno delle funzioni _{x, v} (t, s) = F(x + tv, x + sv), x S, v R ^N \{0}. Infine dopo aver definite le funzioni F-differenziabili, si introducono classi di funzioni conversse generalizzate, rispetto ad F, e si studiano i collegamenti tra queste classi e la monotonia generalizzata diF.

---

Summary We consider the class of real valued functionF(x,y) defined inS×S, withSR ^N , satisfying x,yS the monotone conditionF(x,y)+F(y,x)0. Weakening the previous inequality we introduce the class of quasi-monotone, pseudo-monotone and strictly pseudo-monotone functions. Under a suitable assumption of homogeneity we characterize the generalized monotone functions studying the sign structure of the functions _{x, v} (t, s) = F(x + tv, x + sv), x S, v R ^N \{0}.Finally by means of the notion ofF-differentiability we introduce new classes of generalized convex functions (with respect toF) and we study the relationship between these classes and the generalized monotonicity ofF.

---

---

Questa ricerca è stata parzialmente finanziata dal Ministero per l'Università e la Ricerca Scientifica.     

Die messende Prüfung bei Abweichung von der Normalverteilungsannahme

Summary For sampling inspection by variables in the one-sided case (item bad if variablex>a) under the usual assumption of normality with known variance ₂ the operating characteristic is given by , wherep denotes the fraction defective. If instead of a normal distribution ((·–a–)/) there is a distributionF((·–a–)/) whereF is sufficiently regular and normed like , one has the approximative operating characteristic . It is shown that for arbitrarily fixed parametersn andc the function takes the valueL _n,c ⁽⁾ (p) at the pointp _F (p)=1–F(–^–1(p)). Sufficient conditions for a simple behavior of the differencep _F (p)–p are given. In the cases of rectangular and symmetrically truncated normal distribution these conditions are shown to be fulfilled.     

Dictatorial voting operators

Voting operators map n-tuples of subsets of a given set X of candidates (the voters choices) into subsets of X (the social choice). This paper characterizes dictatorial voting operators by means of three conditions (the non-emptiness condition A1, the independence condition A2 and the resoluteness condition A3) motivated by the idea of transferring to the social choice properties common to all the voters choices. The result is used to refine Lahiris (2001) characterization and to derive dictatorial results in other three types of aggregation problems, in which choice functions are transformed into choice functions, binary relations into choices and binary relations into binary relations.Received: 20 May 2002, Accepted: 5 August 2003, JEL Classification: D70, D71Antonio Quesada: Present address: Departament dEconomia, Facultat de Ciéncies Económiques i Empresarials, Universitat Rovira i Virgili, Avinguda de la Universitat 1, 43204 Reus (Tarragona), Spain. I would like to express my gratitude to the referees for their contribution to improve this paper.Part of this work was done at the Departament dAnálisi Económica, Facultat dEconomia, Universitat de Valéncia, Avinguda dels Tarongers s/n, 46022 Valéncia, Spain.     

The large-sample power of the 195-1195-1195-1test for multidimensional contingency tables

Summary The asymptotic power of the frequency ² test depends on a noncentrality parameter, ,Mitra [1958] offered a general expression for , which is rather difficult to apply. This work provides simplified formulae for in various models associated with multidimensional contingency tables.     

Sequential allocation to two treatments that converges to an α-superior treatment

Summary Two treatments are being compared as to which has the higher mean response. The response for the 2 treatments is assumed to be normally distributed, with unknown means. Observations are being allocated sequentially to the different treatments, the purpose is to locate the superior treatment, the one with the higher mean response. We are going to find a treatment for which we have 1— confidence of its being superior, we call it then an -superior treatment, Allocation schemes are discussed for which there will be a convergence on an -superior treatment, while heuristically trying to reduce the number of allocations to the inferior treatment. No stopping rule is applied and there is no point at which the experiment is terminated and the use begins, the scheme assures that the allocation will eventually converge on one treatment.     

Scharfe untere und obere Schranken für die Wahrscheinlichkeit der Realisation vonk untern Ereignissen

Summary LetA ₁,...,A _n be events in a probability space (,A,W). We denote byL _k the event, that at leastk events among then eventsA ₁,...A _n occur, and byK _k the event, that exactlyk events occur. If only the inequalities _i W(A _i ) _i ,i=1,...,n, are known, we calculate sharp lower and upper bounds forW(L _k ) andW(K _k ). These bounds only depend onn, k and _i , _i ,i=1,...,n. They are relevant, when treating combined tests or confidence procedures.     

Estimation of a regression coefficient after two preliminary tests of significance

Summary The estimation of the regression coefficient of a population, defined byE (y)= +x, incorporating two preliminary tests of significance has been discussed. The experimenter has two random samples of different sizes from two such populations, as defined above, with regression coefficients ₁ and ₂ respectively, where ₂ may possibly be equal to ₁. Besides this, it is also conjectured that the common conditional variance ² of the two populations has a specified value ₀ ² . The two preliminary tests are used to resolve these two uncertainties.The author has rejoined Lucknow University, Lucknow India on Oct. 4, 1976 after availing leave for two years.     

Berechnung des maximalen Signifikanzniveaus des Testes „LehneH 0 ab,wennk untern gegebenen Tests zur Ablehnung führen”

Summary If for a simple hypothesis there aren tests with critical regionsK _i and level of significance _i a new test may be constructed with the rule reject the hypothesis if at leastk among then tests reject. The level of significance of this compound test was calculated byRüger [1978] in this journal; a simple proof is supplied here.     

Cascaded channels and the equivocation inequality

The variation of the equivocation and the average mutual information over cascaded channels is studied, using the generalized information measures (entropies of degree ) and Renyi information measures (entropies of order ). The equivocation inequality, which indicates that the equivocation can never decrease as we go further from the input on a sequence of cascaded channels, is shown to be satisfied by Renyi entropies (for 0<<1) for all channels and all probability distributions. The generalized entropies are shown to satisfy this inequality for binary symmetric channels for certain probability distributions The relations among the mutual information measures between the different terminals of the sequence of cascaded channels are studied, considering both the generalized and Renyi entropies. A necessary and sufficient condition for transmitting information without any loss across cascaded channels is obtained, when Renyi entropies are applied. The same condition is proved to be sufficient for achieving the equivocation equality (which indicates the case of no information loss across cascaded channels) over the class of binary symmetric channels, when the generalized entropies are applied.     

A note on optimum spacing of observations from a continuous time simple Markov process

Summary Assume thatX() is a continuous time simple Markov process with a parameter . The problem is to choose observation points ₀ < ₁ <...<_T which provide with the maximum possible information on . Suppose that the observation points are equally spaced, that is, fort=1, ...,T, T, ;_t–_t–1 is constant. Then the optimum value fors is obtained.