The negative contagion reflection of the polya-eggenberger distribution

The Polya-Eggenberger distribution Involves drawing a ball from an urn containing black and white balls and, after each drawing, returning the ball together with s balls of the same color, The model represents positive contagion since the added balls are the same color as the one drawn, See Johnson and Kotz, (1977),

This paper derives and examines the probability distribution which results from the Polya-Eggenberger model with only one change namely, the s additional balls added after each drawing are of the opposite color, producing a negative contagion model.

Formulas in closed form are presented for the probability distribution function, the mean and variance, all binomial moments and, where s is greater than or equal to the number of balls in the urn at start, the mode, A formula for the mode is conjectured where s is less than the number of balls in the urn at start.

Finally, the probability of obtaining k black balls in n drawings is shown in certain instances to be equal to A_nk/n!

where A_nk are the Eulerian numbers.     

The estimation of the number of balls put in a sequence of urns

Let X₁,…,X_2n be independent and identically distributed copies of the non-negative integer valued random variable X distributed according to the unknown frequency function f(x). A total of 2n disjoint sequences of urns, each consisting of k urns, are given. X_j balls are placed in urn sequence j (1 ≤ j ≤ 2n). Each ball is placed in an urn of a given sequence with a certain known probability independently of the other balls. The variables X₁,…,X_2n are not observed; rather we observe whether certain pairs of urns are both empty or not. Our object is to estimate the mean μ of the number of balls X. Two different kinds of estimators of μ are investigated. One of the estimators studied is a method of moments type estimator while the other is motivated by the maximum likelihood principle. These estimators are compared on the basis of their asymptotic mean squared error as k tends to infinity. An application of these results to a problem in genetics involved with estimating codon substitution rates is discussed.     

Asymptotics for multisample statistics

Consider a family of square-integrable R^d-valued statistics S_k = S_k(X_1,k1; X_2,k2;…; X_m,km), where the independent samples X_i,kj respectively have k_i i.i.d. components valued in some separable metric space X_i. We prove a strong law of large numbers, a central limit theorem and a law of the iterated logarithm for the sequence {S_k}, including both the situations where the sample sizes tend to infinity while m is fixed and those where the sample sizes remain small while m tends to infinity. We also obtain two almost sure convergence results in both these contexts, under the additional assumption that S_k is symmetric in the coordinates of each sample X_i,kj. Some extensions to row-exchangeable and conditionally independent observations are provided. Applications to an estimator of the dimension of a data set and to the Henze-Schilling test statistic for equality of two densities are also presented.     

Poisson approximation io the distribution of empiy cells in randomized occupancy

Let M_o denote the number of empty cells when n balls are dropped independently and at random in m cells such that each ball stays in its cell with probability p and falls through with probability 1-p. A Poisson limit is known for M_o when (n/m)→∞. We find a corresponding approximation to the distribution of M_o when m is large but finite, Ihe method is elementary, and yields the rate of convergence to the limit law. Ihe results are new for the classical case (p = 1) as well.     

Occupancy distributions for testing marginal homogeneity

In this paper different pairs of urns are considered. We are interested in the number of ways in which N balls can be placed into the urns so that differences and ratios between the number of balls in certain pairs of urns are the same.     

A comparison of some nonparametric tests for the simple tree alternative

This paper develops a new test statistic for testing hypotheses of the form H_O M₀=M₁=…=M_k versus H_a: M₀≦M₁,M₂,…,M_k] where at least one inequality is strict. M₀ is the median of the control population and M₁ is the median of the population receiving trearment i, i=1,2,…,k. The population distributions are assumed to be unknown but to differ only in their location parameters if at all. A simulation study is done comparing the new test statistic with the Chacko and the Kruskal-Wallis when the underlying population distributions are either normal, uniform, exponential, or Cauchy. Sample sizes of five, eight, ten, and twenty were considered. The new test statistic did better than the Chacko and the Kruskal-Wallis when the medians of the populations receiving the treatments were approximately the same     

Two stochastic models for the geeta distribution

The first stochastic model is based upon two urns A and B, where A contains a fixed number of white and black balls and B is empty. The player selects an integer β ≥, 2 and draws the balls one by one (with replacement) from urn A and balls of the same colour are put in urn B. The process is continued as long as the number of white balls in B exceeds (β-1) times the number of black balls in B. The player stops after drawing β(x-1) balls and is declared to be a winner if urn B has (x-1) black balls. It is shown that x has the Geeta distribution.

Assuming that the mean μ is a function of two parameters θ and β it has been shown that for small changes inthe value of θ there exists a difference-differential equation which leads to the Geeta distribution.     

A Bayes Theorem Urn Model Optimization Problem

An urn model is a finite collection of indistinguishable urns together with an arbitrary distribution of a finite number of balls (bills) of k colors (denominations) into the urns. A Bayes theorem expectation optimization problem associated with certain urn models is discussed.     

Local asymptotic normality of intermediate and central order statistics

Consider n independent random variables Z_i,…, Z_n on R with common distribution function F, whose upper tail belongs to a parametric family F(t) = F_θ(t),t ≥ x₀, where θ ∈ ? ? R ^d. A necessary and sufficient condition for the family F_θ, θ ∈ ?, is established such that the k-th largest order statistic Z_n?k+1:n alone constitutes the central sequence yielding local asymptotic normality ( LAN ) of the loglikelihood ratio of the vector (Z_n?i+1:n)¹ _i=kof the k largest order statistics. This is achieved for k = k(n)→_n→∞∞ with k/n→_n→∞ 0.

In the case of vectors of central order statistics ( Z_r:n, Z_r+1:n,…, Z_s:n ), with r/n and s/n both converging to q ∈ ( 0,1 ), it turns out that under fairly general conditions any order statistic Z_m:n with r ≤ m ≤s builds the central sequence in a pertaining LAN expansion.These results lead to asymptotically optimal tests and estimators of the underlying parameter, which depend on single order statistics only     

The probability generating function of empty cell variable in a randomized occupancy problem

Let M_o denote the number of empty cells when n distinguishable balls are distributed independently and at random in ra cells such that each ball stays with probability p in its cell, and falls through with probability 1-p. We find the probability generating function of M_o by solving a partial differential equation satisfied by a suitable generating function. The corresponding function for the classical case p = 1 is well-known, but obtained by different methods.     

Consistency of stochastic approximation algorithm with quasi-associated random errors

ABSTRACT

Many mathematical and physical problems are led to find a root of a real function f. This kind of equation is an inverse problem and it is difficult to solve it. Especially in engineering sciences, the analytical expression of the function f is unknown to the experimenter, but it can be measured at each point x_k with M(x_k) as expected value and induced error ξ_k. The aim is to approximate the unique root θ under some assumptions on the function f and errors ξ_k. We use a stochastic approximation algorithm that constructs a sequence (x_k)_{k ? 1}. We establish the almost complete convergence of the sequence (x_k)_k to the exact root θ by considering the errors (ξ_k)_k quasi-associated and we illustrate the method by numerical examples to show its efficiency.     

On the number of near-records after the maximum observation in a continuous sample

{X_n, n≥1} are independent and identically distributed random variables with continuous distribution function F(x). For j=1,…,n, X_j is called a near-record up to time n if X_j ∈ (M_na, M_n], where M_n = max_1≤j≤n {X_j} and a is a positive constant. Let Z_n(a) denote the number of near-records after, and including the maximum observation of the sequence. In this paper, the distributional results of Z_n(a) are considered and its asymptotic behaviours are studied.     

Asymptotic expaxsioxs for the joint distribution of cirrelated hotellings t2 statlstics under normality

Let T² _i=z′_iS^?1z_i, i==,…k be correlated Hotelling's T² statistics under normality. where z=(z′_i,…,z′_k)′ and nS are independently distributed as N_kp((O,ρ?∑) and Wishart distribution W_p(∑, n), respectively. The purpose of this paper is to study the distribution function F(x₁,…,x_k) of (T² _i,…,T² _k) when n is large. First we derive an asymptotic expansion of the characteristic function of (T² _i,…,T² _k) up to the order n^?2. Next we give asymptotic expansions for (T² _i,…,T² _k) in two cases (i)ρ=I_k and (ii) k=2 by inverting the expanded characteristic function up to the orders n^?2 and n^?1, respectively. Our results can be applied to the distribution function of max (T² _i,…,T² _k) as a special case.     

On approximating the central and noncentral multivariate gamma distributions

In this paper a finite series approximation involving Laguerre polynomials is derived for central and noncentral multivariate gamma distributions. It is shown that if one approximates the density of any k nonnegative continuous random variables by a finite series of Laguerre polynomials up to the (n₁, …, n_k)th degree, then all the mixed moments up to the order (n₁, …, n_k) of the approximated distribution equal to the mixed moments up to the same order of the random variables. Some numerical results are given for the bivariate central and noncentral multivariate gamma distributions to indicate the usefulness of the approximations.     

A one-sided test for testino homogeneity of scale parameters against simple ordered alternative

In an earlier paper the authors (1997) extended the results of Hayter (1990) to the two parameter exponential probability model. This paper addressee the extention to the scale parameter case under location-scale probability model. Consider k (k≧3) treatments or competing firms such that an observation from with treatment or firm follows a distribution with cumulative distribution function (cdf) F_i(x)=F[(x-μ_i)/Q_i], where F(·) is any absolutely continuous cdf, i=1,…,k. We propose a test to test the null hypothesis H₀:θ₁=…=θ_k against the simple ordered alternative H₁:θ₁≦…≦θ_k, with at least one strict inequality, using the data X_i,j, i=1,…k; j=1,…,n₁. Two methods to compute the critical points of the proposed test have been demonstrated by talking k two parameter exponential distributions. The test procedure also allows us to construct simultaneous one sided confidence intervals (SOCIs) for the ordered pairwise ratios θ_j/θ_i, 1≦i<j≦k. Statistical simulation revealed that: 9i) actual sizes of the critical points are almost conservative and (ii) power of the proposed test relative to some existing tests is higher.     

Reliability and Some Characteristics of Circular Consecutive-k-Within-m-Out-of-n:F System

A system can be classified with respect to the physical arrangement of its components and the functioning principle. A circular consecutive k-within-m-out-of-n:F system consists of n circularly ordered components and fails if and only if there are m consecutive components that include among them at least k failed components. A circular consecutive k-within-m-out-of-n:F system turns into circular consecutive k-out-of-n:F for m = k and k-out-of-n:F system for m = n. In this study, signature-based analysis of circular consecutive k-within-m-out-of-n:F system is performed. A new approximation to this system is provided based on maximum number of failed components and an illustrative example is given for different values of n, m, k to compare the approximate results with simulated and exact results.     

Simultaneous selection of extreme populations:a bayesian approach

The problem of simultaneously selecting two non-empty subsets, S_Land S_U, of k populations which contain the lower extreme population (LEP) and the upper extreme population (UEP), respectively, is considered. Unknown parameters θ₁,…,θ_kcharacterize the populations π₁,…,π_kand the populations associated with θ_[1]=min θ_i. and θ_[k]= max θ_i. are called the LEP and the UEP, respectively. It is assumed that the underlying distributions possess the monotone likelihood ratio property and that the prior distribution of θ= (θ₁,…,θ_k) is exchangeable. The Bayes rule with respect to a general loss function is obtained. Bayes rule with respect to a semi-additive and non-negative loss function is also determined and it is shown that it is minimax and admissible. When the selected subsets are required to be disjoint, it shown that the Bayes rule with respect to a specific loss function can be obtained by comparing certain computable integrals, Application to normal distributions with unknown means θ₁,…,θ_kand a common known variance is also considered.     

Quadratic subspaces and construction of Bayes invariant quadratic estimators of variance components in mixed linear models

Gnot et al. (J Statist Plann Inference 30(1):223–236, 1992) have presented the formulae for computing Bayes invariant quadratic estimators of variance components in normal mixed linear models of the form where the matrices V _i , 1 ≤ i ≤ k − 1, are symmetric and nonnegative definite and V _k is an identity matrix. These formulae involve a basis of a quadratic subspace containing MV ₁ M,...,MV _k-1 M,M, where M is an orthogonal projector on the null space of X′. In the paper we discuss methods of construction of such a basis. We survey Malley’s algorithms for finding the smallest quadratic subspace including a given set of symmetric matrices of the same order and propose some modifications of these algorithms. We also consider a class of matrices sharing some of the symmetries common to MV ₁ M,...,MV _k-1 M,M. We show that the matrices from this class constitute a quadratic subspace and describe its explicit basis, which can be directly used for computing Bayes invariant quadratic estimators of variance components. This basis can be also used for improving the efficiency of Malley’s algorithms when applied to finding a basis of the smallest quadratic subspace containing the matrices MV ₁ M,...,MV _k-1 M,M. Finally, we present the results of a numerical experiment which confirm the potential usefulness of the proposed methods. Dedicated to the memory of Professor Stanisław Gnot.     

Optimal linear combinations using householder transformations

In pattern classification of sampled vector valued random variables it is often essential, due to computational and accuracy considerations, to consider certain measurable transformations of the random variable. These transformations are generally of a dimension-reducing nature. In this paper we consider the class of linear dimension reducing transformations, i.e., the k × n matrices of rank k where k < n and n is the dimension of the range of the sampled vector random variable.

In this connection, we use certain results (Decell and Quirein, 1973), that guarantee, relative to various class separability criteria, the existence of an extremal transformation. These results also guarantee that the extremal transformation can be expressed in the form (I_k∣ Z)U where I_k is the k × k identity matrix and U is an orthogonal n × n matrix. These results actually limit the search for the extremal linear transformation to a search over the obviously smaller class of k × n matrices of the form (I_k ∣Z)U. In this paper these results are refined in the sense that any extremal transformation can be expressed in the form (I_K∣Z)H_p … H₁ where p ≤ min{k, n?k} and H_i is a Householder transformation i=l,…, p, The latter result allows one to construct a sequence of transformations (L_K∣ Z)H₁, (I_K Z)H₂H₁ … such that the values of the class separability criterion evaluated at this sequence is a bounded, monotone sequence of real numbers. The construction of the i-th element of the sequence of transformations requires the solution of an n-dimensional optimization problem. The solution, for various class separability criteria, of the optimization problem will be the subject of later papers. We have conjectured (with supporting theorems and empirical results) that, since the bounded monotone sequence of real class separability values converges to its least upper bound, this least upper bound is an extremal value of the class separability criterion.

Several open questions are stated and the practical implications of the results are discussed.