Quantile dispersion graphs to compare the efficiencies of cluster randomized designs

The purpose of this article is to compare efficiencies of several cluster randomized designs using the method of quantile dispersion graphs (QDGs). A cluster randomized design is considered whenever subjects are randomized at a group level but analyzed at the individual level. A prior knowledge of the correlation existing between subjects within the same cluster is necessary to design these cluster randomized trials. Using the QDG approach, we are able to compare several cluster randomized designs without requiring any information on the intracluster correlation. For a given design, several quantiles of the power function, which are directly related to the effect size, are obtained for several effect sizes. The quantiles depend on the intracluster correlation present in the model. The dispersion of these quantiles over the space of the unknown intracluster correlation is determined, and then depicted by the QDGs. Two applications of the proposed methodology are presented.     

A counterexample to Beder's conjectures about Hadamard matrices

In this note we provide a counterexample which resolves conjectures about Hadamard matrices made in this journal. Beder [1998. Conjectures about Hadamard matrices. Journal of Statistical Planning and Inference 72, 7–14] conjectured that if H$\mathit{H}$ is a maximal m×n$m\times n$ row-Hadamard matrix then m is a multiple of 4; and that if n   is a power of 2 then every row-Hadamard matrix can be extended to a Hadamard matrix. Using binary integer programming we obtain a maximal 13×32$13\times 32$ row-Hadamard matrix, which disproves both conjectures. Additionally for n being a multiple of 4 up to 64, we tabulate values of m   for which we have found a maximal row-Hadamard matrix. Based on the tabulated results we conjecture that a m×n$m\times n$ row-Hadamard matrix with m?n-7$m?n-7$ can be extended to a Hadamard matrix.     

A new alternative to the standard F test for clustered data

The data collection process and the inherent population structure are the main causes for clustered data. The observations in a given cluster are correlated, and the magnitude of such correlation is often measured by the intra-cluster correlation coefficient. The intra-cluster correlation can lead to an inflated size of the standard F test in a linear model. In this paper, we propose a solution to this problem. Unlike previous adjustments, our method does not require estimation of the intra-class correlation, which is problematic especially when the number of clusters is small. Our simulation results show that the new method outperforms the existing methods.     

An intuitive risk factors search algorithm: usage of the Bayesian network technique in personalized medicine

The article focuses on the application of the Bayesian networks (BN) technique to problems of personalized medicine. The simple (intuitive) algorithm of BN optimization with respect to the number of nodes using naive network topology is developed. This algorithm allows to increase the BN prediction quality and to identify the most important variables of the network. The parallel program implementing the algorithm has demonstrated good scalability with an increase in the computational cores number, and it can be applied to the large patients database containing thousands of variables. This program is applied for the prediction for the unfavorable outcome of coronary artery disease (CAD) for patients who survived the acute coronary syndrome (ACS). As a result, the quality of the predictions of the investigated networks was significantly improved and the most important risk factors were detected. The significance of the tumor necrosis factor-alpha gene polymorphism for the prediction of the unfavorable outcome of CAD for patients survived after ACS was revealed for the first time.     

The exponentiated reduced Kies distribution: Properties and applications

Here we consider an exponentiated version of the reduced Kies distribution and discuss some of its properties. The parameters of the distribution are estimated by the method of maximum likelihood and illustrated with the help of certain real-life data sets. Asymptotic behavior of the maximum likelihood estimators of the parameters of the distribution is also studied by using certain simulated data sets.     

The Generalized Conditional Autoregressive Wishart Model for Multivariate Realized Volatility

It is well known that in finance variances and covariances of asset returns move together over time. Recently, much interest has been aroused by an approach involving the use of the realized covariance (RCOV) matrix constructed from high-frequency returns as the ex-post realization of the covariance matrix of low-frequency returns. For the analysis of dynamics of RCOV matrices, we propose the generalized conditional autoregressive Wishart (GCAW) model. Both the noncentrality matrix and scale matrix of the Wishart distribution are driven by the lagged values of RCOV matrices, and represent two different sources of dynamics, respectively. The GCAW is a generalization of the existing models, and accounts for symmetry and positive definiteness of RCOV matrices without imposing any parametric restriction. Some important properties such as conditional moments, unconditional moments, and stationarity are discussed. Empirical examples including sequences of daily RCOV matrices from the New York Stock Exchange illustrate that our model outperforms the existing models in terms of model fitting and forecasting.     

Bivariate,multivariate, and matrix variate normal characterizations: A brief survey II

The paper entitled “Bivariate and Multivariate Normal Characterizations: A Brief Survey,” by Hamedani, which was published in 1992, covered the published characterizations of bivariate and multivariate normal (MVN) distributions from 1941 to 1991. The present work is a follow-up to the 1991/1992 survey which includes not only characterizations of the bivariate and MVN distributions, but also characterizations of the matrix variate normal distribution, which have appeared from 1991/1992 to the present.     

Two-queue polling systems with switching policy based on the queue that is not being served

We study a system of two non-identical and separate M/M/1/? queues with capacities (buffers) C₁ < ∞ and C₂ = ∞, respectively, served by a single server that alternates between the queues. The server’s switching policy is threshold-based, and, in contrast to other threshold models, is determined by the state of the queue that is not being served. That is, when neither queue is empty while the server attends Q_i (i = 1, 2), the server switches to the other queue as soon as the latter reaches its threshold. When a served queue becomes empty we consider two switching scenarios: (i) Work-Conserving, and (ii) Non-Work-Conserving. We analyze the two scenarios using Matrix Geometric methods and obtain explicitly the rate matrix R, where its entries are given in terms of the roots of the determinants of two underlying matrices. Numerical examples are presented and extreme cases are investigated.     

Robust test for independence in high dimensions

This article develops a new test based on Spearman’s rank correlation coefficients for total independence in high dimensions. The test is robust to the non normality and heavy tails of the data, which is a merit that is not shared by the existing tests in literature. Simulation results suggest that the new test performs well under several typical null and alternative hypotheses. Besides, we employ a real data set to illustrate the use of the new test.     

A Comparison of Correlation Structure Selection Penalties for Generalized Estimating Equations

Correlated data are commonly analyzed using models constructed using population-averaged generalized estimating equations (GEEs). The specification of a population-averaged GEE model includes selection of a structure describing the correlation of repeated measures. Accurate specification of this structure can improve efficiency, whereas the finite-sample estimation of nuisance correlation parameters can inflate the variances of regression parameter estimates. Therefore, correlation structure selection criteria should penalize, or account for, correlation parameter estimation. In this article, we compare recently proposed penalties in terms of their impacts on correlation structure selection and regression parameter estimation, and give practical considerations for data analysts. Supplementary materials for this article are available online.