The aligned rank transform and discrete variables: A warning

For two-way layouts in a between subjects ANOVA design the aligned rank transform (ART) is compared with the parametric F-test as well as six other nonparametric methods: rank transform (RT), inverse normal transform (INT), a combination of ART and INT, Puri & Sen's L statistic, van der Waerden and Akritas & Brunners ATS. The type I error rates are computed for the uniform and the exponential distributions, both as continuous and in several variations as discrete distribution. The computations had been performed for balanced and unbalanced designs as well as for several effect models. The aim of this study is to analyze the impact of discrete distributions on the error rate. And it is shown that this scaling impact is restricted to the ART- as well as the combination of ART- and INT-method. There are two effects: first with increasing cell counts their error rates rise beyond any acceptable limit up to 20 percent and more. And secondly their rates rise when the number of distinct values of the dependent variable decreases. This behavior is more severe for underlying exponential distributions than for uniform distributions. Therefore there is a recommendation not to apply the ART if the mean cell frequencies exceed 10.     

Cumulative correspondence analysis using orthogonal polynomials

Taguchi's statistic has long been known to be a more appropriate measure of association of the dependence for ordinal variables compared to the Pearson chi-squared statistic. Therefore, there is some advantage in using Taguchi's statistic in the correspondence analysis context when a two-way contingency table consists at least of an ordinal categorical variable. The aim of this paper, considering the contingency table with two ordinal categorical variables, is to show a decomposition of Taguchi's index into linear, quadratic and higher-order components. This decomposition has been developed using Emerson's orthogonal polynomials. Moreover, two case studies to explain the methodology have been analyzed.     

Decomposition of Variance for Spatial Cox Processes

Abstract. Spatial Cox point processes is a natural framework for quantifying the various sources of variation governing the spatial distribution of rain forest trees. We introduce a general criterion for variance decomposition for spatial Cox processes and apply it to specific Cox process models with additive or log linear random intensity functions. We moreover consider a new and flexible class of pair correlation function models given in terms of normal variance mixture covariance functions. The proposed methodology is applied to point pattern data sets of locations of tropical rain forest trees.     

Cumulants of random sum distributions

Consider a random variable S being the sum of a number N of independent and identically distributed random variables X_j (j = 1, 2, ...) where the number N is itself a non-negative integer-valued random variable independent of the X_j An explicit expression of the r-th cumulant of S is given in terms of the cumulants of N and X_j, Asymptotic properties of the distribution of S are also discussed.     

A class of integral operators generated by random variables

H. Kres Statistisehe Tafeln zur multlvariaten Analysis. Springer-Verlag, Berlin- Heidel-berg-New York 1975, XVIII, 431 S., 26 Tab., DM 48.

D. Rasch: Einführung in die mathematische Statistik - WahrscheinUcllkeitsrechnung und Grundlagen der mathematlsehan Statistlk. VEB Deutscher Verlag delr Wissenschaften, Berlin 1976, 371 S., 37 Abb., 46 'I'ab., 40,– M.

D. Rasch: Einführung in die muthematisehe Statlstik - II .Anweuduugen, VEB Deutscher Verlag der Wissenschaften, Berlin 1976.

Donald L. Snyder: Random Point Processes. -JohnWiley &; Sons, New York 1975,485 S.     

A strong law of large numbers for independent random variables under non-additive probabilities

Abstract

Under non‐additive probabilities, cluster points of the empirical average have been proved to quasi-surely fall into the interval constructed by either the lower and upper expectations or the lower and upper Choquet expectations. In this paper, based on the initiated notion of independence, we obtain a different Marcinkiewicz-Zygmund type strong law of large numbers. Then the Kolmogorov type strong law of large numbers can be derived from it directly, stating that the closed interval between the lower and upper expectations is the smallest one that covers cluster points of the empirical average quasi-surely.     

An improved alternative estimation procedure for current population mean in presence of positively and negatively correlated auxiliary variables in two-occasion rotation patterns

Abstract

The present study confirms the influential role of a positively and a negatively correlated auxiliary variables in enhancing the precision of estimates of current population mean in two occasion rotation (successive) sampling. Exponential-type estimators of current population mean have been proposed for three different situations: (i) the information on a positively correlated auxiliary variable is readily available on both occasions (ii) the information on a negatively correlated auxiliary variable is readily available on both occasions and (iii) the information on both positively and negatively correlated auxiliary variables are readily available on both the occasions. The characteristics of the proposed estimators have been explored and their efficacious performances are compared with the natural and recent contemporary estimators. Optimum replacement strategies of the proposed estimation procedures have been formulated. Simulation and empirical studies are carried out to justify the proposition of the proposed estimators and appropriate recommendations have been put forward to the survey practitioners.     

Throughput and delay analysis of an opportunistic tree algorithm

Tree algorithms are a well-known class of random access algorithms with a provable maximum stable throughput under the infinite population model (as opposed to ALOHA or the binary exponential backoff algorithm). In this article, we propose a tree algorithm for opportunistic spectrum usage in cognitive radio networks. A channel in such a network is shared among so-called primary and secondary users, where the secondary users are allowed to use the channel only if there is no primary user activity. The tree algorithm designed in this article can be used by the secondary users to share the channel capacity left by the primary users.

We analyze the maximum stable throughput and mean packet delay of the secondary users by developing a tree structured Quasi-Birth Death Markov chain under the assumption that the primary user activity can be modeled by means of a finite state Markov chain and that packets lengths follow a discrete phase-type distribution.

Numerical experiments provide insight on the effect of various system parameters and indicate that the proposed algorithm is able to make good use of the bandwidth left by the primary users.     

A combinatorial study of two-periodic random walks

Two-periodic random walks have up-steps and down-steps of one unit as usual, but the probability of an up-step is α after an even number of steps and β = 1 ? α after an odd number of steps, and reversed for down-steps. This concept was studied by Böhm and Hornik^{[2 Böhm, W.; Hornik, K. On two-periodic random walks with boundaries. Stoch. Models 2010, 26, 165–194.[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]]}. We complement this analysis by using methods from (analytic) combinatorics. By using two steps at once, we can reduce the analysis to the study of Motzkin paths, with up-steps, down-steps, and level-steps. Using a proper substitution, we get the generating functions of interest in an explicit and neat form. The parameters that are discussed here are the (one-sided) maximum (already studied by Böhm and Hornik^{[2 Böhm, W.; Hornik, K. On two-periodic random walks with boundaries. Stoch. Models 2010, 26, 165–194.[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]]}) and the two-sided maximum. For the asymptotic evaluation of the average value of the two-sided maximum after n random steps, more sophisticated methods from complex analysis (Mellin transform, singularity analysis) are required. The approach to transfer the analysis to Motzkin paths is, of course, not restricted to the two parameters under consideration.     

一类含有随机参数的混沌系统的Hopf分岔研究

文章选取随机变量为系统的随机变量研究含有随机参数混沌系统的Hopf分岔,利用Chebyshev正交多项式逼近理论将含有随机变量的系统转化为等价的确定性系统,通过Hopf分岔定理和Lyapunov系数讨论了随机参数系统的Hopf分岔及稳定性,发现随机系统的渐进稳定性参数区间大小不仅和确定性参数有关,还与随机参数有非常密切的关系.