TESTING THE EQUALITY OF PARAMETERS IN THE DISTRIBUTIONS WHEN THE RANGE DEPENDS UPON THE PARAMETER

The authors derive the null and non-null distributions of the test statistic v=y_min/y_max (where y_min= min x_ij, y_max= max x_ij, J=1,2, …, k) connected with testing the equality of scale parameters θ₁, θ₂, …θ_k in certain, class of density functions given by      

Solving Survo puzzles using matrix combinatorial products

We investigate combinatorial matrix problems that are related to restricted integer partitions. They arise from Survo puzzles, where the basic task is to fill an m×n table by integers 1, 2,?…?, mn, so that each number appears only once, when the column sums and the row sums are fixed. We present a new computational method for solving Survo puzzles with binary matrices that are recoded and combined using the Hadamard, Kronecker, and Khatri–Rao products. The idea of our method is based on using the matrix interpreter and other data analytic tools of Survo R, which represents the newest generation of the Survo computing environment, recently implemented as a multiplatform, open source R package. We illustrate our method with detailed examples.     

Testing for and against a set of linear inequality constraints in a multinomial setting

There are numerous situations in categorical data analysis where one wishes to test hypotheses involving a set of linear inequality constraints placed upon the cell probabilities. For example, it may be of interest to test for symmetry in k × k contingency tables against one-sided alternatives. In this case, the null hypothesis imposes a set of linear equalities on the cell probabilities (namely p_ij = P_ji ×i > j), whereas the alternative specifies directional inequalities. Another important application (Robertson, Wright, and Dykstra 1988) is testing for or against stochastic ordering between the marginals of a k × k contingency table when the variables are ordinal and independence holds. Here we extend existing likelihood-ratio results to cover more general situations. To be specific, we consider testing H_t,0 against H₁ - H₀ and H₁ against H₂ - H ₁ when H₀:k × i=1 p_ix_ji = 0, j = 1,…, s, H₁:k × i=1 p_ix_ji × 0, j = 1,…, s, and does not impose any restrictions on p. The x_ji's are known constants, and s × k - 1. We show that the asymptotic distributions of the likelihood-ratio tests are of chi-bar-square type, and provide expressions for the weighting values.     

Approximate confidence bounds for ratios of variance components in two-way unbalanced crossed models with interactions

Consider the general unbalanced two-factor crossed components-of-variance model with interaction given by Y_ijk: = μ+A_i: +B_j: + C_ij: +E_ijk: (i = 1,2, … a; j = 1,…,b; k = 1,…,.n_ij:=0) A_i:,B_j:, C_ij: and E_ijk: are independent unobservable random variables. Also A_i:sim; N(0,σ² _A),B_j: ～ N(0,σ² _B), C_ij:～N(0,s² _C:) and E_ijk:～N(0,s² _E:). In this paper approximate confidence bounds are obtained for ρ_A: = ρ² _A/² and ρ_B: = ρ² _B:/ρ² (where σ² = σ² _A:+ σ² _B+σ² _Cσ² _E) for special cases of the above model. The balanced incomplete block model is studied as a special case.     

Weighting variables in K-means clustering

The aim of this study is to assign weights w ₁, …, w _m to m clustering variables Z ₁, …, Z _m , so that k groups were uncovered to reveal more meaningful within-group coherence. We propose a new criterion to be minimized, which is the sum of the weighted within-cluster sums of squares and the penalty for the heterogeneity in variable weights w ₁, …, w _m . We will present the computing algorithm for such k-means clustering, a working procedure to determine a suitable value of penalty constant and numerical examples, among which one is simulated and the other two are real.     

The Maximum Probability 2 × c Contingency Tables and the Maximum Probability Points of the Multivariate Hypergeometric Distribution

Abstract

The problem of obtaining the maximum probability 2 × c contingency table with fixed marginal sums, R  = (R ₁, R ₂) and C  = (C ₁, … , C _c ), and row and column independence is equivalent to the problem of obtaining the maximum probability points (mode) of the multivariate hypergeometric distribution MH(R ₁; C ₁, … , C _c ). The most simple and general method for these problems is Joe's (Joe, H. (1988 Joe, H. 1988. Extreme probabilities for contingency tables under row and column independence with application to Fisher's exact test. Commun. Statist. Theory Meth., 17(11): 3677–3685. [Taylor & Francis Online], [Web of Science ®] , [Google Scholar]). Extreme probabilities for contingency tables under row and column independence with application to Fisher's exact test. Commun. Statist. Theory Meth. 17(11):3677–3685.) In this article we study a family of MH's in which a connection relationship is defined between its elements. Based on this family and on a characterization of the mode described in Requena and Martín (Requena, F., Martín, N. (2000 Requena, F. and Martín, N. 2000. Characterization of maximum probability points in the multivariate hypergeometric distribution. Statist. Probab. Lett., 50: 39–47.  [Google Scholar]). Characterization of maximum probability points in the multivariate hypergeometric distribution. Statist. Probab. Lett. 50:39–47.), we develop a new method for the above problems, which is completely general, non recursive, very simple in practice and more efficient than the Joe's method. Also, under weak conditions (which almost always hold), the proposed method provides a simple explicit solution to these problems. In addition, the well-known expression for the mode of a hypergeometric distribution is just a particular case of the method in this article.     

Magic rectangles and modular magic rectangles

Magic rectangles are m × n matrices with entries 1, …, mn, all row sums being equal and all column sums being equal. Sun established necessary and sufficient conditions for the existence of magic (m, n) rectangles.We introduce modular magic rectangles, variants of magic rectangles, and study two classes of modular magic rectangles: Pseudomagic and complete magic rectangles. We construct classes of pseudomagic, modular magic rectangles that are not magic rectangles, and classes of complete, modular magic rectangles. This suggests the problem of determining the spectra of pseudomagic, modular magic rectangles that are not magic rectangles; complete, modular magic rectangles; and complete, magic rectangles.     

Evaluation of a method for setting confidence intervals on the common mean of two normal populations

Let X₁, , X₂, …, X be distributed N(µ, σ² _x), let Y₁, Y₂, …, Y"_n be distributed N(µ, σ² _y), and let X , X , … X_m, Y₁, Y₂, …, Y_n be mutually independent. In this paper a method for setting confidence intervals on the common mean µ is proposed and evaluated.     

Locally best invariant and locally minimax test of independence

Let X₁ X₂ … X_N be independent normal p-vectors with common mean vector $$ = ($$) and common nonsingular covariance matrix $$ = Diag ($sG_i) [(1–p) I + pE] Diag ($sG_i), $sG_i> 0, i = 1… p, 1>p>=1/p–1. Write r_ij = sample correlation between the i th and the j th variable i j = 1,… p. It has been proved that for testing the hypothesis H₀ : p = 0 against the alternative H₁ : p>0 where $$ and $sG₁,…, $sG_p are unknown, the test which rejects H₀ for large value of $$ r_ij is locally best invariant for every $aL: 0 > $aL > 1 and locally minimax as p $$ 0 in the sense of Giri and Kiefer, 1964, for every $aL: 0 > $aL $$ $aL₀ > 1 where$aL₀ = P_p=0 $$.     

Non-parametric estimation of an acceleration parameter

Let X₁,… X_m be a random sample of m failure times under normal conditions with the underlying distribution F(x) and Y₁,…,Y_n a random sample of n failure times under accelerated condititons with underlying distribution G(x);G(x)=1?[1?F(x)]^θ with θ being the unknown parameter under study.Define:U_ij=1 otherwise.The joint distribution of _ijdoes not involve the distribution F and thus can be used to estimate the acceleration parameter θ.The second approach for estimating θ is to use the ranks of the Y-observations in the combined X- and Y-samples.In this paper we establish that the rank of the Y-observations in the pooled sample form a sufficient statistic for the information contained in the U_ii 's about the parameter θ and that there does not exist an unbiassed estimator for the parameter θ.We also construct several estimators and confidence interavals for the parameter θ.     

On the Influence of Record Terms in the Addition of Independent Random Variables

We discuss some problems connected with the role of record values and maximal values generated by sequences of random variables X₁, X₂,…, X _n in the process of the growth of sums X₁ +···+ X_n, n = 1, 2,….     

Testing optimality of experimental designs for a regression model with random variables

Tsukanov (Theor. Probab. Appl. 26 (1981) 173–177) considers the regression model $\text{E(}\text{y}\text{|}\text{Z}\text{)=}\text{Fp}\text{+}\text{Zq}$, $\text{D(}\text{y}\text{|}\text{Z}\text{)=σ}{}^2\text{I}{}_{\mathrm{n}}$, where $\text{y}\text{(n×1)}$ is a vector of measured values,$\text{F}\text{(n×k)}$ contains the control variables, $\text{Z}\text{(n×l)}$ contains the observed values, and $\text{p}\text{(k×1)}$ and $\text{q}\text{(l×1)}$ are being estimated. Assuming that $\text{Z}\text{=}\text{FL}\text{+}\text{R}$, where $\text{L}\text{(k×l)}$ is non-random, and the rows of $\text{R}\text{(n×l)}$ are i.i.d. $\text{N(}\text{0}\text{,Σ)}$, we extend Tsukanov's results by (i) computing E(detH_p), where H_p is the covariance matrix of p?, the l.s.e. of p, (ii) considering ‘optimality in the mean’ for the largest root criterion, (iii) discussing these equations when the matrix R has a left-spherical distribution.     

A RENEWAL THEOREM IN MULTIDIMENSIONAL TIME

Let Y_l, Y₂,… be i.i.d., positive, integer-valued random variables with means, μ. Let the sequences {Y_ij, j= 1,2,…}, i= 1,…, r be independent copies of {Y₁, Y₂,…}. For n={n₁,…, n_r.}, n₁≥1, let S_n=S?ⁿ¹_k1=1= 1 …S?^nr_kr=1 Y_ik1… Y_rkr. We show that S?^N_k=1S?^∞_k1=1…S?^∞_nr=1 P[[S_n= k] ? [μ^-r N log^r-1 (N)/(r-1)!] as N →∞.     

A general reduction method for n–variate normal orthant probability

Let X₁,X₂,…,X_n be n normal variates with zero means, unit variances and correlation matrix {p_ij). The orthant probability is the probability that all of the X₁'s are simultaneously positive. This paper presents a general reduction method by extending the method of Childs (1967), and shows that the probability can be represented by a linear combination of some multivariate integrals of order([n/2]?1). As illustrations, we apply the proposed method to the quadrivariate and six–variate cases. Some numerical results are also given.     

Limiting behavior of randomly weighted averages of symmetric heavy-tailed random variables

In this paper we consider a sequence of independent continuous symmetric random variables X₁, X₂, …, with heavy-tailed distributions. Then we focus on limiting behavior of randomly weighted averages S_n = R⁽ⁿ⁾₁X₁ + ??? + R⁽ⁿ⁾_nX_n, where the random weights R⁽ⁿ⁾₁, …, R_n⁽ⁿ⁾ which are independent of X₁, X₂, …, X_n, are the cuts of (0, 1) by the n ? 1 order statistics from a uniform distribution. Indeed we prove that c_nS_n converges in distribution to a symmetric α-stable random variable with c_n = n^{1 ? 1/α}/Γ^1/α(α + 1).     

A class of fixed-width confidence intervals for a ranked normal mean

Suppose that we are given k(≥ 2) independent and normally distributed populations π₁, …, π_k where π_i has unknown mean μ_i and unknown variance σ² _i (i = 1, …, k). Let μ_[i] (i = 1, …, k) denote the i^th smallest one of μ₁, …, μ_k. A two-stage procedure is used to construct lower and upper confidence intervals for μ_[i] and then use these to obtain a class of two-sided confidence intervals on μ_[i] with fixed width. For i = k, the interval given by Chen and Dudewicz (1976) is a special case. Comparison is made between the class of two-sided intervals and a symmetric interval proposed by Chen and Dudewicz (1976) for the largest mean, and it is found that for large values of k at least one of the former intervals requires a smaller total sample size. The tables needed to actually apply the procedure are provided.     

An exact decomposition for a class of exponential dispersion models: Application to sequential testing

We define the Wishart distribution on the cone of positive definite matrices and an exponential distribution on the Lorentz cone as exponential dispersion models. We show that these two distributions possess a property of exact decomposition, and we use this property to solve the following problem: given q samples (y_il,… y_iNj), i = l,…,q, from a N(μ_i,Σ_i,) distribution, test H:Σ₁ = Σ₂ = … = σ_q. Using the exact decomposition property, the classical test statistic for H, involving q parameters p_i = (N_i, - l)/2, i = 1,…,q, is replaced by a sequence of q - l test statistics for the sequence of tests H_i,:σ₁ =σ₂ = … =σ_i given that H_i-1 is true, i = 2,…,q. Each one of these test statistics involves two parameters only, p._i-1 = p₁ + … + p_i-1 and p_i. We also use the exact decomposition property to test equality of the “direction parameters” for q sample points from the exponential distribution on the Lorentz cone. We give a table of critical values for the distribution on the three-dimensional Lorentz cone. Tables of critical values in higher dimensions can easily be computed following the same method as in dimension three.     

COMPARISON OF THREE NON-PARAMETRIC TESTS FOR BIVARIATE INTERCHANGEABILITY1

Given a random sample(X₁, Y₁), …,(X_n, Y_n) from a bivariate (BV) absolutely continuous c.d.f. H (x, y), we consider rank tests for the null hypothesis of interchangeability H₀: H(x, y). Three linear rank test statistics, Wilcoxon (W_N), sum of squared ranks (SSR_N) and Savage (S_N), are described in Section 1. In Section 2, asymptotic relative efficiency (ARE) comparisons of the three types of tests are made for Morgenstern (Plackett, 1965) and Moran (1969)BV alternatives with marginal distributions satisfying G(x) = F(x/θ) for some θ≠ 1. Both gamma and lognormal marginal distributions are used.     

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