Estimation of the scale parameter of a log-logistic distribution

In this work the ranked set sampling technique has been applied to estimate the scale parameter $\alpha $ of a log-logistic distribution under a situation where the units in a sample can be ordered by judgement method without any error. We have evaluated the Fisher information contained in the order statistics arising from this distribution and observed that median of a random sample contains the maximum information about the parameter $\alpha $ . Accordingly we have used median ranked set sampling to estimate $\alpha $ . We have further carried out the multistage median ranked set sampling to estimate $\alpha $ with improved precision. Suppose it is not possible to rank the units in a sample according to judgement method without error but the units can be ordered based on an auxiliary variable $Z$ such that $(X, Z)$ has a Morgenstern type bivariate log-logistic distribution (MTBLLD). In such a situation we have derived the Fisher information contained in the concomitant of rth order statistic of a random sample of size $n$ from MTBLLD and identified those concomitants among others which possess largest amount of Fisher information and defined an unbalanced ranked set sampling utilizing those units in the sample and thereby proposed an estimator of $\alpha $ using the measurements made on those units in this ranked set sample.     

A generalized maximum likelihood characterization of the normal distribution

LetP be a probability measure on ℝ andI _x be the set of alln-dimensional rectangles containingx. If for allx ∈ ℝⁿ and θ ∈ ℝ the inequality holds,P is a normal distributioin with mean 0 or the unit mass at 0. The result generalizes Teicher’s (1961) maximum likelihood characterization of the normal density to a characterization ofN(0, σ²) amongall distributions (including those without density). The m.l. principle used is that of Scholz (1980).     

Estimation of quantities determined as implicit functions of unknown parameters

Consider a family of distribution functions ${\{F(x, \theta),\,\theta \in \Theta\}}Consider a family of distribution functions {F(x, q), q ? Q}{\{F(x, \theta),\,\theta \in \Theta\}} . Suppose that there exists an estimator of the unknown parameter vector θ based on given data set. Then it is readily to obtain an estimator of any quantity given as an explicit function g(θ). Particularly, it is the case when the maximum likelihood estimator of θ is available. However, often some quantities of interest can not be expressed as an explicit function, rather it is determined as an implicit function of θ. The present article studies this problem. Sufficient conditions are given for deriving estimators of these quantities. The results are then applied to estimate change point of failure rate function, and change point of mean residual life function.     

Estimating survivor function using optimally selected order statistics

This paper deals with the estimation of survivor function using optimally selected order statistics when the sample sizen is large. We use the estimates (μ*,σ*) based on the optimum set of order statistics for largen and fixedk (≤n) such that the estimate has optimum variance property. The asymptotic relative efficiency of such an estimator is compared with the one based on the complete sample. The general theory of the problem and specific details with respect to a two-parameter Normal, Logistic, Exponential and Pareto distributions is considered as an example.     

An ergodic theorem for proportions of observations that fall into random sets determined by sample quantiles

Assume that a sequence of observations \((X_n; n\ge 1)\) forms a strictly stationary process with an arbitrary univariate cumulative distribution function. We investigate almost sure asymptotic behavior of proportions of observations in the sample that fall into a random region determined by a given Borel set and a sample quantile. We provide sufficient conditions under which these proportions converge almost surly and describe the law of the limiting random variable.     

Consistency of a nonparametric estimation of a density functional

LetX be a random variable with distribution functionF and density functionf. Let ? and ψ be known measurable functions defined on the real lineR and the closed interval [0, 1], respectively. This paper proposes a smooth nonparametric estimate of the density functional \(\theta = \int\limits_R \phi (x) \psi \left[ {F (x)} \right]f^2 (x) dx\) based on a random sampleX ₁, ...,X _n fromF using a kernel functionk. The proposed estimate is given by \(\hat \theta = (n^2 a_n )^{ - 1} \mathop \sum \limits_{i = 1}^n \mathop \sum \limits_{j = 1}^n \phi (X_i ) \psi \left[ {\hat F (X_i )} \right]k\left[ {(X_i - X_j )/a_n } \right]\) , where \(\hat F(x) = n^{ - 1} \mathop \sum \limits_{i = 1}^n K\left[ {(x - X_i )/a_n } \right]\) with \(K (w) = \int\limits_{ - \infty }^w {k (u) } du\) . The estimate \(\hat \theta \) is shown to be consistent both in the weak and strong sense and is used to estimate the asymptotic relative efficiency of various nonparametric tests, with particular reference to those using the Chernoff-Savage statistic.     

Asymptotically optimal nonparametric one- and two-way analysis of variance tests for the log linear model under censoring

We considerr ×c populations with failure ratesλ _ij(t) satisfying the condition

On a simple characterisation of threshold graphs

In their very interesting paper “Set-packing problems and threshold graphs” [1] V. Chvatal and P. L. Hammer have shown that the constraints $$\begin{gathered} \sum\limits_{j = 1}^n {a_{ij} x_j \leqslant 1(i = 1,2, . . . , m)} \hfill \\ x_j \in (0,1)(j = 1,2, . . . , n) \hfill \\ \end{gathered} $$ are equivalent to the only inequality $$\begin{gathered} \sum\limits_{j - 1}^n {c_j x_j \leqslant d} \hfill \\ x_j \in (0,1)(j = 1,2, . . . , n) \hfill \\ \end{gathered} $$ if and only if the intersection graph associated with the matrix (a _ij ) — see § 1 — is a threshold graph i.e. a graph none of whose induced subgraphs are isomorphic to 2K ₂,P ₄,C ₄: As Chvatal and Hammer have shown [1], threshold graphs can be characterised in many different ways; the main result of this paper is to give a new, very simple characterisation which will enable us to test whether a graph is a threshold by a simple inspection of its incidence matrix.     

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].     

{\varvec{P}}-value model selection criteria for exponential families of increasing dimension

Let $\mathcal{M }_{\underline{i}}$ be an exponential family of densities on $[0,1]$ pertaining to a vector of orthonormal functions $b_{\underline{i}}=(b_{i_1}(x),\ldots ,b_{i_p}(x))^\mathbf{T}$ and consider a problem of estimating a density $f$ belonging to such family for unknown set ${\underline{i}}\subset \{1,2,\ldots ,m\}$ , based on a random sample $X_1,\ldots ,X_n$ . Pokarowski and Mielniczuk (2011) introduced model selection criteria in a general setting based on p-values of likelihood ratio statistic for $H_0: f\in \mathcal{M }_0$ versus $H_1: f\in \mathcal{M }_{\underline{i}}\setminus \mathcal{M }_0$ , where $\mathcal{M }_0$ is the minimal model. In the paper we study consistency of these model selection criteria when the number of the models is allowed to increase with a sample size and $f$ ultimately belongs to one of them. The results are then generalized to the case when the logarithm of $f$ has infinite expansion with respect to $(b_i(\cdot ))_1^\infty $ . Moreover, it is shown how the results can be applied to study convergence rates of ensuing post-model-selection estimators of the density with respect to Kullback–Leibler distance. We also present results of simulation study comparing small sample performance of the discussed selection criteria and the post-model-selection estimators with analogous entities based on Schwarz’s rule as well as their greedy counterparts.     

On the relationship between absolute prudence and absolute risk aversion

Abstract For a utility function , the functions and are the Arrow-Pratt coefficient of absolute risk aversion (ara) and the coefficient of absolute prudence (ap). They measure respectively an agent’s sensitivity to risk and the strength of the precautionary saving motive under income uncertainty.     

Characterization of the exponential distribution function by Properties of the differenceX k+s∶n−X k∶n of order statistics

We considern independent and identically distributed random variables with common continuous distribution functionF concentrated on (0, ∞). LetX _1∶n≤X_2∶n...≤X_n∶n be the corresponding order statistics. Put $$d_s \left( x \right) = P\left( {X_{k + s:n} - X_{k:n} \geqslant x} \right) - P\left( {X_{s:n - k} \geqslant x} \right), x \geqslant 0,$$ and $$\delta _s \left( {x, \rho } \right) = P\left( {X_{k + s:n} - X_{k:n} \geqslant x} \right) - e^{ - \rho \left( {n - k} \right)x} ,\rho > 0,x \geqslant 0.$$ Fors=1 it is well known that each of the conditions d₁(x)=O ?x≥0 and δ₁ (x, p) = O ?x≥0 implies thatF is exponential; but the analytic tools in the proofs of these two statements are radically different. In contrast to this in the present paper we present a rather elementary method which permits us to derive the above conclusions for somes, 1≤n —k, using only asymptotic assumptions (either forx→0 orx→∞) ond _s(x) and δ₁ (x, p), respectively.     

A note on minimum variance

Summary Minimizing is discussed under the unbiasedness condition: and the condition (A):f _i (x) (i=1, ..., p) are linearly independent , and .     

A remark on robustness of linear best estimates

Let s₀ = ||x- h₀ (x)||₀ , s(B₁ ) = ||x- h₁ (x)||₀ , s₁ (B₁ ) = ||x- h₁ (x)||₁ , \begin{gathered} \sigma _0 = \parallel \xi - \eta _0 (\xi )\parallel _0 , \hfill \\ \sigma (B_1 ) = \parallel \xi - \eta _1 (\xi )\parallel _0 , \hfill \\ \sigma _1 (B_1 ) = \parallel \xi - \eta _1 (\xi )\parallel _1 , \hfill \\ \end{gathered}     

Asymptotic behaviour of near-maxima of Gaussian sequences

Let \((X_1,X_2,\ldots ,X_n)\) be a Gaussian random vector with a common correlation coefficient \(\rho _n,\,0\le \rho _n<1\) , and let \(M_n= \max (X_1,\ldots , X_n),\,n\ge 1\) . For any given \(a>0\) , define \(T_n(a)= \left\{ j,\,1\le j\le n,\,X_j\in (M_n-a,\,M_n]\right\} ,\,K_n(a)= \#T_n(a)\) and \(S_n(a)=\sum \nolimits _{j\in T_n(a)}X_j,\,n\ge 1\) . In this paper, we obtain the limit distributions of \((K_n(a))\) and \((S_n(a))\) , under the assumption that \(\rho _n\rightarrow \rho \) as \(n\rightarrow \infty ,\) for some \(\rho \in [0,1)\) .     

On generalized transforms of distribution functions

In this note we discuss the following problem. LetX andY to be two real valued independent r.v.'s with d.f.'sF and ?. Consider the d.f.F*? of the r.v.X oY, being o a binary operation among real numbers. We deal with the following equation: $$\mathcal{G}^1 (F * \phi ,s) = \mathcal{G}^2 (F,s)\square \mathcal{G}^3 (\phi ,s)\forall s \in S$$ where \(\mathcal{G}^1 ,\mathcal{G}^2 ,\mathcal{G}^3 \) are real or complex functionals, т another binary operation ands a parameter. We give a solution, that under stronger assumptions (Aczél 1966), is the only one, of the problem. Such a solution is obtained in two steps. First of all we give a solution in the very special case in whichX andY are degenerate r.v.'s. Secondly we extend the result to the general case under the following additional assumption: $$\begin{gathered} \mathcal{G}^1 (\alpha F + (1 - \alpha )\phi ,s) = H[\mathcal{G}^i (F,s),\mathcal{G}^i (\phi ,s);\alpha ] \hfill \\ \forall \alpha \in [0,1]i = 1,2,3 \hfill \\ \end{gathered} $$ .