Distributions of patterns of two successes separated by a string of <Emphasis Type="Italic">k</Emphasis>-2 failures

Let Z ₁, Z ₂, . . . be a sequence of independent Bernoulli trials with constant success and failure probabilities p = Pr(Z _t  = 1) and q = Pr(Z _t  = 0) = 1 − p, respectively, t = 1, 2, . . . . For any given integer k ≥ 2 we consider the patterns E₁{\mathcal{E}_{1}}: two successes are separated by at most k−2 failures, E₂{\mathcal{E}_{2}}: two successes are separated by exactly k −2 failures, and E₃{\mathcal{E}_{3}} : two successes are separated by at least k − 2 failures. Denote by N_n,k⁽ⁱ⁾{ N_{n,k}^{(i)}} (respectively M_n,k⁽ⁱ⁾{M_{n,k}^{(i)}}) the number of occurrences of the pattern E_i{\mathcal{E}_{i}} , i = 1, 2, 3, in Z ₁, Z ₂, . . . , Z _n when the non-overlapping (respectively overlapping) counting scheme for runs and patterns is employed. Also, let T_r,k⁽ⁱ⁾{T_{r,k}^{(i)}} (resp. W_r,k⁽ⁱ⁾){W_{r,k}^{(i)})} be the waiting time for the r − th occurrence of the pattern E_i{\mathcal{E}_{i}}, i = 1, 2, 3, in Z ₁, Z ₂, . . . according to the non-overlapping (resp. overlapping) counting scheme. In this article we conduct a systematic study of N_n,k⁽ⁱ⁾{N_{n,k}^{(i)}}, M_n,k⁽ⁱ⁾{M_{n,k}^{(i)}}, T_r,k⁽ⁱ⁾{T_{r,k}^{(i)}} and W_r,k⁽ⁱ⁾{W_{r,k}^{(i)}} (i = 1, 2, 3) obtaining exact formulae, explicit or recursive, for their probability generating functions, probability mass functions and moments. An application is given.     

A note on the asymptotic efficiency of the sobel–wald test

Let X₁,X₂, … be iid random variables with the pdf f(x,θ)=exp(θx?b(θ)) relative to a σ-finite measure μ, and consider the problem of deciding among three simple hypotheses H_i:θ=θ_i (1?i?3) subject to P(acceptH_i|θ_i)=1?α (1?i?3). A procedure similar to Sobel–Wald procedure is discussed and its asymptotic efficiency as compared with the best nonsequential test is obtained by finding the limit lim_a→0(E_iN(a)/n(a)), where N (a) is the stopping time of the proposed procedure and n(a) is the sample size of the best non-sequential test. It is shown that the same asymptotic limit holds for the original Sobel–Wald procedure. Specializing to N(θ,1) distribution it is found that lim_a→0$\text{(E}{}_{\mathrm{i}}\text{N(α)/n(α))=}\text{1}\text{4}$ (i=1,2) and lim_a→0 (E₃N(α)n(α))=δ²₁/4δ, where δ_i=(θ_i+1?θ_i) with 0<δ₁?δ₂. Also, the asymptotic efficiency evaluated when the X's have an exponential distribution.     

Estimation of system reliability

In this paper, we estimate the reliability of a system with k components. The system functions when at least s (1≤s≤k) components survive a common random stress. We assume that the strengths of these k components are subjected to a common stress which is independent of the strengths of these k components. If (X ₁,X ₂,…,X _k ) are strengths of k components subjected to a common stress (Y), then the reliability of the system or system reliability is given byR=P[Y<X _(k−s+1)] whereX _(k−s+1) is (k−s+1)-th order statistic of (X ₁,…,X _k ). We estimate R when (X ₁,…,X _k ) follow an absolutely continuous multivariate exponential (ACMVE) distribution of Hanagal (1993) which is the submodel of Block (1975) and Y follows an independent exponential distribution. We also obtain the asymptotic normal (AN) distribution of the proposed estimator.     

Strassen type limit points for moving averages of a wiener process

Let {W(s); 8 ≥ 0} be a standard Wiener process, and let β_N = (2a_N (log (N/a_N) + log log N)^-1/2, 0 < α_N ≤ N < ∞, where α_N↑ and α_N/N is a non-increasing function of N, and define γ_N(t) = β_N[W(n_N + ta_N) ? W(n_N)), 0 ≥ t ≥ 1, with n_N = N – a_N. Let K = {x ? C[0,1]: x is absolutely continuous, x(0) = 0 and }. We prove that, with probability one, the sequence of functions {γ_N(t), t ? [0,1]} is relatively compact in C[0,1] with respect to the sup norm ||·||, and its set of limit points is K. With a_N = N, our result reduces to Strassen's well-known theorem. Our method of proof follows Strassen's original, direct approach. The latter, however, contains an oversight which, in turn, renders his proof invalid. Strassen's theorem is true, of course, and his proof can also be rectified. We do this in a somewhat more general context than that of his original theorem. Applications to partial sums of independent identically distributed random variables are also considered.     

Pooling operators with the marginalization property

In this paper, we consider the problem of combining a number of opinions which have been expressed as probability measures P₁, …, P_n, over some space. It is shown that a pooling formula which has the marginalization property of McConway (1981) must be of the form T = Σⁿ_i=₁W_i P_i + (1 - Σⁿ_i =₁W_i)Q, where Q is an arbitrary measure and W₁, …, W_n ϵ [—1,1] are weights such that| Σ_J Σ _j w_j | ≤ 1 for every subset J of {1, …, n}. If, in addition, T is required to preserve the independence of arbitrary events A and B whenever these events are independent under each P_i, then either T = P_i for some 1 ≤ i ≤ n or T = Q, in which case Q takes values in {0, l}.     

A note on the admissibility of hammersley's estimator of an integer mean

Let X₁, X₂, …, X_n be identically, independently distributed N(i,1) random variables, where i = 0, ±1, ±2, … Hammersley (1950) showed that d = [X?_n], the nearest integer to the sample mean, is the maximum likelihood estimator of i. Khan (1973) showed that d is minimax and admissible with respect to zero-one loss. This note now proves a conjecture of Stein to the effect that in the class of integer-valued estimators d is minimax and admissible under squared-error loss.     

A new generalized Balakrishnan skew-normal distribution

We introduce a new family of skew-normal distributions that contains the skew-normal distributions introduced by Azzalini (Scand J Stat 12:171–178, 1985), Arellano-Valle et al. (Commun Stat Theory Methods 33(7):1465–1480, 2004), Gupta and Gupta (Test 13(2):501–524, 2008) and Sharafi and Behboodian (Stat Papers, 49:769–778, 2008). We denote this distribution by GBSN _n (λ₁, λ₂). We present some properties of GBSN _n (λ₁, λ₂) and derive the moment generating function. Finally, we use two numerical examples to illustrate the practical usefulness of this distribution.     

ON TRANSITION PROBABILITIES OF SKIP-FREE MARKOV CHAINS

Consider an ergodic Markov chain X(t) in continuous time with an infinitesimal matrix Q = (q_ij) defined on a finite state space {0, 1,…, N}. In this note, we prove that if X(t) is skip-free positive (negative, respectively), i.e., q_ij, = 0 for j > i+ 1 (i > j+ 1), then the transition probability p_ij(t) = Pr[X(t)=j | X(0) =i] can be represented as a linear combination of p_0N(t) (p^(m)_(N0)(t)), 0 ≤ m ≤N, where f^(m)(t) denotes the mth derivative of a function f(t) with f⁽⁰⁾(t) =f(t). If X(t) is a birth-death process, then p_ij(t) is represented as a linear combination of p_0N^(m)(t), 0 ≤m≤N - |i-j|.     

Sequential experimental design and response optimisation

We consider the situation where one wants to maximise a functionf(θ,x) with respect tox, with θ unknown and estimated from observationsy _k . This may correspond to the case of a regression model, where one observesy _k =f(θ,x _k )+ε _k , with ε _k some random error, or to the Bernoulli case wherey _k ∈{0, 1}, with Pr[y _k =1|θ,x _k |=f(θ,x _k ). Special attention is given to sequences given by , with an estimated value of θ obtained from (x₁, y₁),...,(x _k ,y _k ) andd _k (x) a penalty for poor estimation. Approximately optimal rules are suggested in the linear regression case with a finite horizon, where one wants to maximize ∑ _i=1 ^N w _i f(θ, x _i ) with {w _i } a weighting sequence. Various examples are presented, with a comparison with a Polya urn design and an up-and-down method for a binary response problem.     

Exchangeability,predictive sufficiency and Bayesian bootstrap

Summary Let {X _n } be a sequence of random variables conditionally independent and identically distributed given the random variable Θ. The aim of this paper is to show that in many interesting situations the conditional distribution of Θ, given (X ₁,…,X _n ), can be approximated by means of the bootstrap procedure proposed by Efron and applied to a statisticT _n (X ₁,…,X _n ) sufficient for predictive purposes. It will also be shown that, from the predictive point of view, this is consistent with the results obtained following a common Bayesian approach.     

Central limit theorems for LS estimators in the EV regression model with dependent measurements

In this paper, we consider the simple linear errors-in-variables (EV) regression models: η_i=θ+βx_i+ε_i,ξ_i=x_i+δ_i,1≤i≤n, where θ,β,x₁,x₂,… are unknown constants (parameters), (ε₁,δ₁),(ε₂,δ₂),… are errors and ξ_i,η_i,i=1,2,… are observable. The asymptotic normality for the least square (LS) estimators of the unknown parameters β and θ in the model are established under the assumptions that the errors are m-dependent, martingale differences, ?-mixing, ρ-mixing and α-mixing.     

Improved estimators for the selected location parameters

_i , i = 1, 2, ..., k be k independent exponential populations with different unknown location parameters θ _i , i = 1, 2, ..., k and common known scale parameter σ. Let Y _i denote the smallest observation based on a random sample of size n from the i-th population. Suppose a subset of the given k population is selected using the subset selection procedure according to which the population π _i is selected iff Y _i ≥Y ₍₁₎−d, where Y ₍₁₎ is the largest of the Y _i 's and d is some suitable constant. The estimation of the location parameters associated with the selected populations is considered for the squared error loss. It is observed that the natural estimator dominates the unbiased estimator. It is also shown that the natural estimator itself is inadmissible and a class of improved estimators that dominate the natural estimator is obtained. The improved estimators are consistent and their risks are shown to be O(kn ⁻²). As a special case, we obtain the coresponding results for the estimation of θ₍₁₎, the parameter associated with Y ₍₁₎. Received: January 6, 1998; revised version: July 11, 2000     

Inference on finite population categorical response: nonparametric regression-based predictive approach

Suppose that a finite population consists of N distinct units. Associated with the ith unit is a polychotomous response vector, d _i , and a vector of auxiliary variable x _i . The values x _i ’s are known for the entire population but d _i ’s are known only for the units selected in the sample. The problem is to estimate the finite population proportion vector P. One of the fundamental questions in finite population sampling is how to make use of the complete auxiliary information effectively at the estimation stage. In this article a predictive estimator is proposed which incorporates the auxiliary information at the estimation stage by invoking a superpopulation model. However, the use of such estimators is often criticized since the working superpopulation model may not be correct. To protect the predictive estimator from the possible model failure, a nonparametric regression model is considered in the superpopulation. The asymptotic properties of the proposed estimator are derived and also a bootstrap-based hybrid re-sampling method for estimating the variance of the proposed estimator is developed. Results of a simulation study are reported on the performances of the predictive estimator and its re-sampling-based variance estimator from the model-based viewpoint. Finally, a data survey related to the opinions of 686 individuals on the cause of addiction is used for an empirical study to investigate the performance of the nonparametric predictive estimator from the design-based viewpoint.     

Bayesian prediction of the number of change points in the piecewise linear model

Summary The problem of predicting the number of change points in a piecewise linear model is studied from a Bayesian viewpoint. For a given a priori joint probability functionf _R,C=f_Rf _C/R, whereR is the number of change points andC=C′(R)=(C₁,…,C_R) is the change-point epoch vector, the marginal posterior probability functionf _R.C/Y is obtained, and then used to find predictors forR andC(R).     

The number of records within a random interval of the current record value

LetX ₁,X ₂, … be a sequence of i.i.d. random variables with some continuous distribution functionF. LetX(n) be then-th record value associated with this sequence and μ _n ⁻ , μ _n ⁺ be the variables that count the number of record values belonging to the random intervals(f−(X(n)), X(n)), (X(n), f+(X(n))), wheref−, f+ are two continuous functions satisfyingf−(x)<x, f+(x)>x. Properties of μ _n ⁻ , μ _n ⁺ are studied in the present paper. Some statistical applications connected with these variables are also provided.     

Estimating Average Worth of the Selected Subset from Two-Parameter Exponential Populations

ABSTRACT

Suppose independent random samples are available from k(k ≥ 2) exponential populations ∏₁,…,∏ _k with a common location θ and scale parameters σ₁,…,σ _k , respectively. Let X _i and Y _i denote the minimum and the mean, respectively, of the ith sample, and further let X = min{X ₁,…, X _k } and T _i  = Y _i  ? X; i = 1,…, k. For selecting a nonempty subset of {∏₁,…,∏ _k } containing the best population (the one associated with max{σ₁,…,σ _k }), we use the decision rule which selects ∏ _i if T _i  ≥ c max{T ₁,…,T _k }, i = 1,…, k. Here 0 < c ≤ 1 is chosen so that the probability of including the best population in the selected subset is at least P* (1/k ≤ P* < 1), a pre-assigned level. The problem is to estimate the average worth W of the selected subset, the arithmetic average of means of selected populations. In this article, we derive the uniformly minimum variance unbiased estimator (UMVUE) of W. The bias and risk function of the UMVUE are compared numerically with those of analogs of the best affine equivariant estimator (BAEE) and the maximum likelihood estimator (MLE).     

Least squares and shrinkage estimation under bimonotonicity constraints

In this paper we describe active set type algorithms for minimization of a smooth function under general order constraints, an important case being functions on the set of bimonotone r×s matrices. These algorithms can be used, for instance, to estimate a bimonotone regression function via least squares or (a smooth approximation of) least absolute deviations. Another application is shrinkage estimation in image denoising or, more generally, regression problems with two ordinal factors after representing the data in a suitable basis which is indexed by pairs (i,j)∈{1,…,r}×{1,…,s}. Various numerical examples illustrate our methods.     

A discrete distribution associated with a pure birth process

A discrete distribution associated with a pure birth process starting with no individuals, with birth rates λ ⁿ =λ forn=0, 2, …,m−1 and λ ⁿ forn≥m is considered in this paper. The probability mass function is expressed in terms of an integral that is very convenient for computing probabilities, moments, generating functions and others. Using this representation, the mean and the k-th factorial moments of the distribution are obtained. Some nice characterizations of this distribution are also given.     

Nonparametric statistical procedures for the changepoint problem

Let X₁,…,X_r?1,X_r,X_r+1,…,X_n be independent, continuous random variables such that X_i, i = 1,…,r, has distribution function F(x), and X_i, i = r+1,…,n, has distribution function F(x?Δ), with -∞ <Δ< ∞. When the integer r is unknown, this is refered to as a change point problem with at most one change. The unknown parameter Δ represents the magnitude of the change and r is called the changepoint. In this paper we present a general review discussion of several nonparametric approaches for making inferences about r and Δ.     

Adaptive wavelet estimation of a function in an indirect regression model

We consider a nonparametric regression model where m noise-perturbed functions f ₁,…,f _m are randomly observed. For a fixed ν∈{1,…,m}, we want to estimate f _ν from the observations. To reach this goal, we develop an adaptive wavelet estimator based on a hard thresholding rule. Adopting the mean integrated squared error over Besov balls, we prove that it attains a sharp rate of convergence. Simulation results are reported to support our theoretical findings.