Characterizations of geometric distribution through progressively Type-II right-censored order statistics

In this paper, we consider characterizations of geometric distribution based on some properties of progressively Type-II right-censored order statistics. Specifically, we establish characterizations through conditional expectation, identical distribution, and independence of functions of progressively Type-II right-censored order statistics. Moreover, extensions of these results to generalized order statistics are also sketched. These generalize the corresponding results known for the case of ordinary order statistics.     

Some characterizations of discrete distributions based on weak records

Let X ₁, X ₂,... be iid random variables (rv's) with the support on nonnegative integers and let (W _n , n≥0) denote the corresponding sequence of weak record values. We obtain new characterization of geometric and some other discrete distributions based on different forms of partial independence of rv's W _n and W _n+r —W _n for some fixed n≥0 and r≥1. We also prove that rv's W ₀ and W _n+1 —W _n have identical distribution if and only if (iff) the underlying distribution is geometric.     

Pmc-optimal nonparametric quantile estimator

According to Pitman's Measure of Closeness, if T₁and T₂are two estimators of a real parameter $[d], then T₁is better than T₂if Po[d]{\T₁-o[d] < \T₂-0[d]\} > 1/2 for all 0[d]. It may however happen that while T₁is better than T₂and T₂is better than T₃, T₃is better than T₁. Given q ? (0,1) and a sample X₁, X₂, ..., X_nfrom an unknown F ? F, an estimator T* = T*(X₁,X₂...X_n)of the q-th quantile of the distribution F is constructed such that P_F{\F(T*)-q\ <[d] \F(T)-q\} >[d] 1/2 for all F?F and for all T€T, where F is a nonparametric family of distributions and T is a class of estimators. It is shown that T* =X_j:n'for a suitably chosen jth order statistic.     

T-optimum designs for discrimination between two multiresponse dynamic models

Summary.  The paper is concerned with a problem of finding an optimum experimental design for discriminating between two rival multiresponse models. The criterion of optimality that we use is based on the sum of squares of deviations between the models and picks up the design points for which the divergence is maximum. An important part of our criterion is an additional vector of experimental conditions, which may affect the design. We give the necessary conditions for the design and the additional parameters of the experiment to be optimum, we present the algorithm for the numerical optimization procedure and we show the relevance of these methods to dynamic systems, especially to chemical kinetic models.     

2-Rainbow domination number of Cartesian products: C_{n}\square C_{3} and C_{n}\square C_{5}

A function \(f:V(G)\rightarrow \mathcal P (\{1,\ldots ,k\})\) is called a \(k\) -rainbow dominating function of \(G\) (for short \(kRDF\) of \(G)\) if \( \bigcup \nolimits _{u\in N(v)}f(u)=\{1,\ldots ,k\},\) for each vertex \( v\in V(G)\) with \(f(v)=\varnothing .\) By \(w(f)\) we mean \(\sum _{v\in V(G)}\left|f(v)\right|\) and we call it the weight of \(f\) in \(G.\) The minimum weight of a \( kRDF\) of \(G\) is called the \(k\) -rainbow domination number of \(G\) and it is denoted by \(\gamma _{rk}(G).\) We investigate the \(2\) -rainbow domination number of Cartesian products of cycles. We give the exact value of the \(2\) -rainbow domination number of \(C_{n}\square C_{3}\) and we give the estimation of this number with respect to \(C_{n}\square C_{5},\) \((n\ge 3).\) Additionally, for \(n=3,4,5,6,\) we show that \(\gamma _{r2}(C_{n}\square C_{5})=2n.\)      

Subhypergraph counts in extremal and random hypergraphs and the fractional <Emphasis Type="Italic">q</Emphasis>-independence

We study the extremal parameter N(n,m,H) which is the largest number of copies of a hypergraph H that can be formed of at most n vertices and m edges. Generalizing previous work of Alon (Isr. J. Math. 38:116–130, 1981), Friedgut and Kahn (Isr. J. Math. 105:251–256, 1998) and Janson, Oleszkiewicz and the third author (Isr. J. Math. 142:61–92, 2004), we obtain an asymptotic formula for N(n,m,H) which is strongly related to the solution α _q (H) of a linear programming problem, called here the fractional q-independence number of H. We observe that α _q (H) is a piecewise linear function of q and determine it explicitly for some ranges of q and some classes of H. As an application, we derive exponential bounds on the upper tail of the distribution of the number of copies of H in a random hypergraph.