Distribution of the range when sample size has a GPED<Subscript>1</Subscript>

The probability density function of the range R, in random sampling from a uniform distribution on (k, l) and exponential distribution with parameter λ is obtained, when the sample size is a random variable having the Generalized Polya Eggenberger Distribution of the first kind (GPED ₁). The results of Raghunandanan and Patil (1972) and Bazargan-lari (1999) follow as special cases. The p.d.f of rangeR is obtained, when the distribution of the sample sizeN belongs to Katz family of distributions, as a special case. An erratum to this article is available at .     

On a new goodness‐of‐fit process for families of copulas

A goodness‐of‐fit procedure is proposed for parametric families of copulas. The new test statistics are functionals of an empirical process based on the theoretical and sample versions of Spearman's dependence function. Conditions under which this empirical process converges weakly are seen to hold for many families including the Gaussian, Frank, and generalized Farlie–Gumbel–Morgenstern systems of distributions, as well as the models with singular components described by Durante [Durante ( 2007 ) Comptes Rendus Mathématique. Académie des Sciences. Paris, 344, 195–198]. Thanks to a parametric bootstrap method that allows to compute valid P‐values, it is shown empirically that tests based on Cramér–von Mises distances keep their size under the null hypothesis. Simulations attesting the power of the newly proposed tests, comparisons with competing procedures and complete analyses of real hydrological and financial data sets are presented. The Canadian Journal of Statistics 37: 80‐101; 2009 © 2009 Statistical Society of Canada     

A confidence set for that <Emphasis Type="Italic">x</Emphasis>-coordinate where a quadratic regression model has a given gradient

An exact confidence set for that x-coordinate where a quadratic regression model has a given gradient is derived. The limits of the confidence set are given by mathematical formulae. They are implemented in Fortran programs that can be downloaded from the web. The confidence set need not be an interval. Its increase and its changing shape for increasing confidence level is extensively described and visualized in a figure that relates to data from nitrogen-rate trials in Germany. The wheat yields in this example are modeled as quadratic functions of the nitrogen input in order to determine a confidence set for the economically optimum nitrogen fertilization. The disadvantage that the confidence set does not distinguish between concave and convex parabolae, between profit maxima and minima, is also discussed.     

On a Berry-Esséen theorem for a Studentized jackknife L-estimate

Consider a linear function of order statistics (“L-estimate”) which can be expressed as a statistical function T(F_n) based on the sample cumulative distribution function F_n. Let T*(F_n) be the corresponding jackknifed version of T(F_n), and let V²_n be the jackknife estimate of the asymptotic variance of n ^1/2T(F_n) or n ^1/2T*(F_n). In this paper, we provide a Berry-Esséen rate of the normal approximation for a Studentized jackknife L-estimate n^1/2[T*(F_n) - T(F)]/V_n, where T(F) is the basic functional associated with the L-estimate.     

Block‐threshold‐adapted Estimators via a Maxiset Approach

We study the maxiset performance of a large collection of block thresholding wavelet estimators, namely the horizontal block thresholding family. We provide sufficient conditions on the choices of rates and threshold values to ensure that the involved adaptive estimators obtain large maxisets. Moreover, we prove that any estimator of such a family reconstructs the Besov balls with a near‐minimax optimal rate that can be faster than the one of any separable thresholding estimator. Then, we identify, in particular cases, the best estimator of such a family, that is, the one associated with the largest maxiset. As a particularity of this paper, we propose a refined approach that models method‐dependent threshold values. By a series of simulation studies, we confirm the good performance of the best estimator by comparing it with the other members of its family.     

Idle thoughts of a ‘well‐calibrated’ Bayesian in clinical drug development

The use of Bayesian approaches in the regulated world of pharmaceutical drug development has not been without its difficulties or its critics. The recent Food and Drug Administration regulatory guidance on the use of Bayesian approaches in device submissions has mandated an investigation into the operating characteristics of Bayesian approaches and has suggested how to make adjustments in order that the proposed approaches are in a sense calibrated. In this paper, I present examples of frequentist calibration of Bayesian procedures and argue that we need not necessarily aim for perfect calibration but should be allowed to use procedures, which are well‐calibrated, a position supported by the guidance. Copyright © 2016 John Wiley & Sons, Ltd.     

Testing fuzzy hypotheses based on vague observations: a <Emphasis Type="Italic">p</Emphasis>-value approach

This paper deals with the problem of testing statistical hypotheses when both the hypotheses and data are fuzzy. To this end, we first introduce the concept of fuzzy p-value and then develop an approach for testing fuzzy hypotheses by comparing a fuzzy p-value and a fuzzy significance level. Numerical examples are provided to illustrate the approach for different cases.     

Complement to a comparative analysis of heuristics for the <Emphasis Type="Italic">p</Emphasis>-median problem

A recent comparison of evolutionary, neural network, and scatter search heuristics for solving the p-median problem is completed by (i) gathering or obtaining exact optimal values in order to evaluate errors precisely, and (ii) including results obtained with several variants of a variable neighborhood search (VNS) heuristic. For a first, well-known, series of instances, the average errors of the evolutionary and neural network heuristics are over 10% and more than 1000 times larger than that of VNS. For a second series, this error is about 3% while the errors of the parallel VNS and of a hybrid heuristic are about 0.01% and that of parallel scatter search even smaller.     

A review and re‐interpretation of a group‐sequential approach to sample size re‐estimation in two‐stage trials

In this paper, we review the adaptive design methodology of Li et al. (Biostatistics 3 :277–287) for two‐stage trials with mid‐trial sample size adjustment. We argue that it is closer in principle to a group sequential design, in spite of its obvious adaptive element. Several extensions are proposed that aim to make it even more attractive and transparent alternative to a standard (fixed sample size) trial for funding bodies to consider. These enable a cap to be put on the maximum sample size and for the trial data to be analysed using standard methods at its conclusion. The regulatory view of trials incorporating unblinded sample size re‐estimation is also discussed. © 2014 The Authors. Pharmaceutical Statistics published by John Wiley & Sons, Ltd.     

Estimation of the characteristics of a Lévy process

We consider a Lévy process that is e.g. used in finance to model stock price developments. We want to estimate the characteristics of that process, based on historical data where we assume that we have discrete, high frequency observations. We introduce a threshold estimation method and show consistency and in the case of finite activity asymptotic normality of these estimators.     

Estimation with right‐censored observations under a semi‐Markov model

The semi‐Markov process often provides a better framework than the classical Markov process for the analysis of events with multiple states. The purpose of this paper is twofold. First, we show that in the presence of right censoring, when the right end‐point of the support of the censoring time is strictly less than the right end‐point of the support of the semi‐Markov kernel, the transition probability of the semi‐Markov process is nonidentifiable, and the estimators proposed in the literature are inconsistent in general. We derive the set of all attainable values for the transition probability based on the censored data, and we propose a nonparametric inference procedure for the transition probability using this set. Second, the conventional approach to constructing confidence bands is not applicable for the semi‐Markov kernel and the sojourn time distribution. We propose new perturbation resampling methods to construct these confidence bands. Different weights and transformations are explored in the construction. We use simulation to examine our proposals and illustrate them with hospitalization data from a recent cancer survivor study. The Canadian Journal of Statistics 41: 237–256; 2013 © 2013 Statistical Society of Canada     

L p –Estimators as Estimates of a Parameter of Location for a Sharp–pointed Symmetric Density

We study the asymptotics of L _p estimators, p > 0, over a sample having a symmetric density with a sharp–point at the centre of symmetry of the distribution. The rates of convergence of the L _p estimators in this situation depend on p and on the shape of the density. To obtain some of the limit distributions, we present new results in the asymptotics of M–estimators. We extend the delta method to the case when the Euclidean norm of the conveniently normalized M–estimators converge to a power of the Euclidean norm of a (possibly Gaussian) stable distribution.     

Nonparametric maximum likelihood computation of a <Emphasis Type="Italic">U</Emphasis>-shaped hazard function

A new algorithm is presented and studied in this paper for fast computation of the nonparametric maximum likelihood estimate of a U-shaped hazard function. It successfully overcomes a difficulty when computing a U-shaped hazard function, which is only properly defined by knowing its anti-mode, and the anti-mode itself has to be found during the computation. Specifically, the new algorithm maintains the constant hazard segment, regardless of its length being zero or positive. The length varies naturally, according to what mass values are allocated to their associated knots after each updating. Being an appropriate extension of the constrained Newton method, the new algorithm also inherits its advantage of fast convergence, as demonstrated by some real-world data examples. The algorithm works not only for exact observations, but also for purely interval-censored data, and for data mixed with exact and interval-censored observations.     

Distributions of patterns of two successes separated by a string of <Emphasis Type="Italic">k</Emphasis>-2 failures

Let Z ₁, Z ₂, . . . be a sequence of independent Bernoulli trials with constant success and failure probabilities p = Pr(Z _t  = 1) and q = Pr(Z _t  = 0) = 1 − p, respectively, t = 1, 2, . . . . For any given integer k ≥ 2 we consider the patterns E₁{\mathcal{E}_{1}}: two successes are separated by at most k−2 failures, E₂{\mathcal{E}_{2}}: two successes are separated by exactly k −2 failures, and E₃{\mathcal{E}_{3}} : two successes are separated by at least k − 2 failures. Denote by N_n,k⁽ⁱ⁾{ N_{n,k}^{(i)}} (respectively M_n,k⁽ⁱ⁾{M_{n,k}^{(i)}}) the number of occurrences of the pattern E_i{\mathcal{E}_{i}} , i = 1, 2, 3, in Z ₁, Z ₂, . . . , Z _n when the non-overlapping (respectively overlapping) counting scheme for runs and patterns is employed. Also, let T_r,k⁽ⁱ⁾{T_{r,k}^{(i)}} (resp. W_r,k⁽ⁱ⁾){W_{r,k}^{(i)})} be the waiting time for the r − th occurrence of the pattern E_i{\mathcal{E}_{i}}, i = 1, 2, 3, in Z ₁, Z ₂, . . . according to the non-overlapping (resp. overlapping) counting scheme. In this article we conduct a systematic study of N_n,k⁽ⁱ⁾{N_{n,k}^{(i)}}, M_n,k⁽ⁱ⁾{M_{n,k}^{(i)}}, T_r,k⁽ⁱ⁾{T_{r,k}^{(i)}} and W_r,k⁽ⁱ⁾{W_{r,k}^{(i)}} (i = 1, 2, 3) obtaining exact formulae, explicit or recursive, for their probability generating functions, probability mass functions and moments. An application is given.     

Structured approach to the elicitation of expert beliefs for a Bayesian‐designed clinical trial: a case study

To quantify uncertainty in a formal manner, statisticians play a vital role in identifying a prior distribution for a Bayesian‐designed clinical trial. However, when expert beliefs are to be used to form the prior, the literature is sparse on how feasible and how reliable it is to elicit beliefs from experts. For late‐stage clinical trials, high importance is placed on reliability; however, feasibility may be equally important in early‐stage trials. This article describes a case study to assess how feasible it is to conduct an elicitation session in a structured manner and to form a probability distribution that would be used in a hypothetical early‐stage trial. The case study revealed that by using a structured approach to planning, training and conduct, it is feasible to elicit expert beliefs and form a probability distribution in a timely manner. We argue that by further increasing the published accounts of elicitation of expert beliefs in drug development, there will be increased confidence in the feasibility of conducting elicitation sessions. Furthermore, this will lead to wider dissemination of the pertinent issues on how to quantify uncertainty to both practicing statisticians and others involved with designing trials in a Bayesian manner. Copyright © 2013 John Wiley & Sons, Ltd.     

Monotonic minimax estimators of a 2×2 covariance matrix

Let S : 2 × 2 have a nonsingular Wishart distribution with unknown matrix σ and n degrees of freedom. For estimating σ two families of mimmax estimators, with respect to the entropy loss, are presented. These estimators are of the form σ(S) = Rø(L)R^t where R is orthogonal, L and Φ are diagonal, and RLR^T = S. Conditions under which the components of Φ and L follow the same order relation [i.e., writing Φ = diag(Φ₁,Φ₂) and L = diag(l₁,/₂) with l₁ ≥ l₂, we have Φ₁ ≥ Φ₂] are established. Comparisons with Stein's estimators and other orthogonally invariant estimators are discussed.     

Estimating Abundance from Presence–Absence Maps via a Paired Negative‐Binomial Model

The estimation of abundance from presence–absence data is an intriguing problem in applied statistics. The classical Poisson model makes strong independence and homogeneity assumptions and in practice generally underestimates the true abundance. A controversial ad hoc method based on negative‐binomial counts (Am. Nat.) has been empirically successful but lacks theoretical justification. We first present an alternative estimator of abundance based on a paired negative binomial model that is consistent and asymptotically normally distributed. A quadruple negative binomial extension is also developed, which yields the previous ad hoc approach and resolves the controversy in the literature. We examine the performance of the estimators in a simulation study and estimate the abundance of 44 tree species in a permanent forest plot.     

Coverage‐adjusted Confidence Intervals for a Binomial Proportion

We consider the classic problem of interval estimation of a proportion p based on binomial sampling. The ‘exact’ Clopper–Pearson confidence interval for p is known to be unnecessarily conservative. We propose coverage adjustments of the Clopper–Pearson interval that incorporate prior or posterior beliefs into the interval. Using heatmap‐type plots for comparing confidence intervals, we show that the coverage‐adjusted intervals have satisfying coverage and shorter expected lengths than competing intervals found in the literature.