On random walks on affine group

Diaconis' presumption that the number of steps required to get close to uniform for a random walk on the affine group A _pis c(p)p ²with c(p) →ã is verified. We also discuss the random number generation associated with the random walk on the affine group. The number of steps to force the generated number to become random is improved. A modified version of Diacohis-Shahshahani's upper bound lemma is given and applied     

On Generalized Binomial and Negative Binomial Distributions for Dependent Bernoulli Variables

We study the distributions of the random variables S_n and V_r related to a sequence of dependent Bernoulli variables, where S_n denotes the number of successes in n trials and V_r the number of trials necessary to obtain r successes. The purpose of this article is twofold: (1) Generalizing some results on the “nature” of the binomial and negative binomial distributions we show that S_n and V_r can follow any prescribed discrete distribution. The corresponding joint distributions of the Bernoulli variables are characterized as the solutions of systems of linear equations. (2) We consider a specific type of dependence of the Bernoulli variables, where the probability of a success depends only on the number of previous successes. We develop some theory based on new closed-form representations for the probability mass functions of S_n and V_r which enable direct computations of the probabilities.     

Comparison of computer programs for simple linear L 1 regression

A number of efficient computer codes are available for the simple linear L ₁ regression problem. However, a number of these codes can be made more efficient by utilizing the least squares solution. In fact, a couple of available computer programs already do so.

We report the results of a computational study comparing several openly available computer programs for solving the simple linear L ₁ regression problem with and without computing and utilizing a least squares solution.     

Exploring the distribution for the estimator of Rosenthal's ‘fail-safe’ number of unpublished studies in meta-analysis

The present article discusses the statistical distribution for the estimator of Rosenthal's ‘file-drawer’ number N_R, which is an estimator of unpublished studies in meta-analysis. We calculate the probability distribution function of N_R. This is achieved based on the central limit theorem and the proposition that certain components of the estimator N_R follow a half-normal distribution, derived from the standard normal distribution. Our proposed distributions are supported by simulations and investigation of convergence.     

One-sided tolerance limits for unbalanced one-way anova andomc effects model

In this article, we investigate techniques for constructing tolerance limits such that the probability is γ that at least _p proportion of the population would exceed that limit. We consider the unbalanced case and study the behavior of the limit as a function of n_i 's (where n_i is the number of observations in the ith batch), as well as that of the variance ratio. To construct the tolerance limits we use the approximation given in Thomas and Hultquist (1978). We also discuss the procedure for constructing the tolerance limits when the variance ratio is unknown. An example is given to illustrate the results.     

A note on the minimum size of an orthogonal array

It is an elementary fact that the size of an orthogonal array of strength t on k factors must be a multiple of a certain number, say L_t, that depends on the orders of the factors. Thus L_t is a lower bound on the size of arrays of strength t on those factors, and is no larger than L_k, the size of the complete factorial design. We investigate the relationship between the numbers L_t, and two questions in particular: For what t is L_t < L_k? And when L_t = L_k, is the complete factorial design the only array of that size and strength t? Arrays are assumed to be mixed-level.

We refer to an array of size less than L_k as a proper fraction. Guided by our main result, we construct a variety of mixed-level proper fractions of strength k ? 1 that also satisfy a certain group-theoretic condition.     

Weak and strong representations for quantile processes from finite populations with application to simulation size in resampling inference

We prove three results on the weak or strong representations for quantile processes of samples drawn randomly with or without replacement from a finite population. As an application of the strong-approximation result (Theorem 2), we give an approach for determining the order of B, the number of Monte Carlo simulations required for the accuracy of resampling inference. In typical situations the order of B is between nb_n and n^2+δ, where n is the original sample size, δ > 0, and (log log n)/b_n → 0.     

Number of observations near the maximum in an F α-scheme

Let K _n (a) be the number of observations in the interval (M _n ,?a, M _n ), where M _n is the maximum value in a sequence of size n. We study the asymptotic properties of K _n (a) under the F ^α-scheme and discuss the influence of the associated sequence α _n on the limit behaviour of this random variable.     

On a problem of counting by weighing

Suppose it is desired to obtain a large number N_s of items for which individual counting is impractical, but one can demand a batch to weigh at least w units so that the number of items N in the batch may be close to the desired number N_s. If the items have mean weight ωTH, it is reasonable to have w equal to ωTHN_s when ωTH is known. When ωTH is unknown, one can take a sample of size n, not bigger than N_s, estimate ωTH by a good estimator ω_n, and set w equal to ω_nN_s. Let R_n = Kp²N²_s/n + K_sn be a measure of loss, where K_e and K_s are the coefficients representing the cost of the error in estimation and the cost of the sampling respectively, and p is the coefficient of variation for the weight of the items. If one determines the sample size to be the integer closest to pCN_s when p is known, where C is (K_e/K_s)^1/2, then R_n will be minimized. If p is unknown, a simple sequential procedure is proposed for which the average sample number is shown to be asymptotically equal to the optimal fixed sample size. When the weights are assumed to have a gamma distribution given ω and ω has a prior inverted gamma distribution, the optimal sample size can be found to be the nonnegative integer closest to pCN_s + p²A(pC – 1), where A is a known constant given in the prior distribution.     

On the Exponential Decay Rate of the Tail of a Discrete Probability Distribution

Abstract

We give a sufficient condition for the exponential decay of the tail of a discrete probability distribution π = (π _n ) _n≥0 in the sense that lim _n→∞(1/n) log∑ _i>n π _i  = ?θ with 0 < θ < ∞. We focus on analytic properties of the probability generating function of a discrete probability distribution, especially, the radius of convergence and the number of poles on the circle of convergence. Furthermore, we give an example of an M/G/1 type Markov chain such that the tail of its stationary distribution does not decay exponentially.     

Smooth-Threshold GEE Variable Selection in High-Dimensional Partially Linear Models with Longitudinal Data

We consider the problem of variable selection in high-dimensional partially linear models with longitudinal data. A variable selection procedure is proposed based on the smooth-threshold generalized estimating equation (SGEE). The proposed procedure automatically eliminates inactive predictors by setting the corresponding parameters to be zero, and simultaneously estimates the nonzero regression coefficients by solving the SGEE. We establish the asymptotic properties in a high-dimensional framework where the number of covariates p_n increases as the number of clusters n increases. Extensive Monte Carlo simulation studies are conducted to examine the finite sample performance of the proposed variable selection procedure.     

ON A SHARED ALLELE TEST OF RANDOM MATING

A simple random sample is observed from a population with a large number‘K’ of alleles, to test for random mating. Of n couples, n_ijkl have female genotype ij and male genotype kl (i, j, k, l{1,…, A‘}). The large contingency table is collapsed into three counts, n₀, n₁ and n₂ where n_p is the number of couples with s alleles in common (s = 0,1, 2). The counts are estimated by np?_o where n₀, is the estimated probability of a couple having s alleles in common under the hypothesis of random mating. The usual chi-square goodness of fit statistic X² compares observed (n_s) with expected (np?) over the three categories, s = 0,1,2. An empirical observation has suggested that X² is close to having a chi-square distribution with two degrees of freedom (X) despite a large number of parameters implicitly estimated in _e. This paper gives two theorems which show that x is indeed the approximate distribution of X² for large n and K₁“, provided that no allele type over-dominates the others.     

GEOMETRIC DECAY OF THE STEADY-STATE PROBABILITIES IN A QUASI-BIRTH-AND-DEATH PROCESS WITH A COUNTABLE NUMBER OF PHASES

A sufficient condition is proved for geometric decay of the steady-state probabilities in a quasi-birth-and-death process having a countable number of phases in each level. If there is a positive number η and positive vectors x = (x _i) and y = (y _j ) satisfying some equations and inequalities, the steady-state probability π _mi decays geometrically with rate η in the sense π _mi ～ cη ^m x _i as m → ∞. As an example, the result is applied to a two-queue system with shorter queue discipline.     

Nonparametric empirical Bayes for the Dirichlet process mixture model

The Dirichlet process prior allows flexible nonparametric mixture modeling. The number of mixture components is not specified in advance and can grow as new data arrive. However, analyses based on the Dirichlet process prior are sensitive to the choice of the parameters, including an infinite-dimensional distributional parameter G ₀. Most previous applications have either fixed G ₀ as a member of a parametric family or treated G ₀ in a Bayesian fashion, using parametric prior specifications. In contrast, we have developed an adaptive nonparametric method for constructing smooth estimates of G ₀. We combine this method with a technique for estimating α, the other Dirichlet process parameter, that is inspired by an existing characterization of its maximum-likelihood estimator. Together, these estimation procedures yield a flexible empirical Bayes treatment of Dirichlet process mixtures. Such a treatment is useful in situations where smooth point estimates of G ₀ are of intrinsic interest, or where the structure of G ₀ cannot be conveniently modeled with the usual parametric prior families. Analysis of simulated and real-world datasets illustrates the robustness of this approach.     

A Resampling Approach for Under-estimating a Finite Population Total from a Censored Sample

Abstract

Suppose a finite population of N objects each of which has an unknown value μ _i  ≥ 0, i = 1, … , N of a nonnegative characteristic of interest. A random sample has been drawn, but only for a selected subset of the sample the μ-values have been observed. The subset selection procedure has been somewhat obscure, and thus the subsample is censorized rather than random. Despite that, a reliable lower bound for the population total (the sum of all μ _i ) is required which uses the statistical information contained in the data. We propose a resampling procedure to construct an under-estimate of the population total. We also consider the case when the objects of the population have unequal sampling probabilities, in particular when the population is divided into a few number of strata with constant probabilities within each stratum. A real data example illustrates the method.     

ON THE NUMBER OF RECORDS NEAR THE MAXIMUM

Recent work has considered properties of the number of observations X_j, independently drawn from a discrete law, which equal the sample maximum X_(n) The natural analogue for continuous laws is the number K_n(a) of observations in the interval (X_(n)–a, X_(n)], where a > 0. This paper derives general expressions for the law, first moment, and probability generating function of K_n(a), mentioning examples where evaluations can be given. It seeks limit laws for n→ and finds a central limit result when a is fixed and the population law has a finite right extremity. Whenever the population law is attracted to an extremal law, a limit theorem can be found by letting a depend on n in an appropriate manner; thus the limit law is geometric when the extremal law is the Gumbel type. With these results, the paper obtains limit laws for ‘top end’ spacings X_(n) - X_(n-j) with j fixed.     

On bootstrapping the number of components in finite mixtures of Poisson distributions

Finite mixture models arise in a natural way in that they are modeling unobserved population heterogeneity. It is assumed that the population consists of an unknown number k of subpopulations with parameters λ₁, ..., λ_k receiving weights p₁, ..., p_k. Because of the irregularity of the parameter space, the log-likelihood-ratio statistic (LRS) does not have a (χ²) limit distribution and therefore it is difficult to use the LRS to test for the number of components. These problems are circumvented by using the nonparametric bootstrap such that the mixture algorithm is applied B times to bootstrap samples obtained from the original sample with replacement. The number of components k is obtained as the mode of the bootstrap distribution of k. This approach is presented using the Times newspaper data and investigated in a simulation study for mixtures of Poisson data.     

Maximum Likelihood Estimation for Stochastic Differential Equations with Random Effects

Abstract. We consider N independent stochastic processes (X _i (t), t ∈ [0,T _i ]), i=1,…, N, defined by a stochastic differential equation with drift term depending on a random variable φ _i . The distribution of the random effect φ _i depends on unknown parameters which are to be estimated from the continuous observation of the processes X_i. We give the expression of the exact likelihood. When the drift term depends linearly on the random effect φ _i and φ _i has Gaussian distribution, an explicit formula for the likelihood is obtained. We prove that the maximum likelihood estimator is consistent and asymptotically Gaussian, when T _i =T for all i and N tends to infinity. We discuss the case of discrete observations. Estimators are computed on simulated data for several models and show good performances even when the length time interval of observations is not very large.     

Statistical inference on the drift parameter in fractional Brownian motion with a deterministic drift

In statistical inference on the drift parameter a in the fractional Brownian motion W^H_t with the Hurst parameter H ∈ (0, 1) with a constant drift Y^H_t = at + W^H_t, there is a large number of options how to do it. We may, for example, base this inference on the properties of the standard normal distribution applied to the differences between the observed values of the process at discrete times. Although such methods are very simple, it turns out that more appropriate is to use inverse methods. Such methods can be generalized to non constant drift. For the hypotheses testing about the drift parameter a, it is more proper to standardize the observed process, and to use inverse methods based on the first exit time of the observed process of a pre-specified interval until some given time. These procedures are illustrated, and their times of decision are compared against the direct approach. Other generalizations are possible when the random part is a symmetric stochastic integral of a known, deterministic function with respect to fractional Brownian motion.     

Goodness-of-fit test for uniform stochastic ordering among several distributions

The likelihood-ratio test (LRT) is considered as a goodness-of-fit test for the null hypothesis that several distribution functions are uniformly stochastically ordered. Under the null hypothesis, H₁ : F₁ ? F₂ ?···? F_N, the asymptotic distribution of the LRT statistic is a convolution of several chi-bar-square distributions each of which depends upon the location parameter. The least-favourable parameter configuration for the LRT is not unique. It can be two different types and depends on the number of distributions, the number of intervals and the significance level α. This testing method is illustrated with a data set of survival times of five groups of male fruit flies.