The generalized linear chirp process

The linear chirp process is an important class of time series for which the instantaneous frequency changes linearly in time. Linear chirps have been used extensively to model a variety of physical signals such as radar, sonar, and whale clicks (see 1, 5 and 6). We introduce the stochastic linear chirp model and then define the generalized linear chirp (GLC) process as a special case of the G-stationary process studied by Jiang et al. (2006) to model data with time-varying frequencies. We then define GLC(p,q) processes and show that the relationship between stochastic linear chirp processes and GLC(p,q) processes is analogous to that between harmonic and ARMA models. The new methods are then applied to both simulated and actual data sets.     

Fragility index of block tailed vectors

Financial crises are a recurrent phenomenon with important effects on the real economy. The financial system is inherently fragile and it is therefore of great importance to be able to measure and characterize its systemic stability. Multivariate extreme value theory provide us such a framework through the fragility index ( 11, 7 and 8). Here we generalize this concept and contribute to the modeling of the stability of a stochastic system divided into blocks. We will find several relations with well-known tail dependence measures in the literature, which will provide us immediate estimators. We end with an application to financial data.     

On the E-optimality of complete block designs under a mixed interference model

In experiments in which the response to a treatment can be affected by other treatments, the interference model with neighbor effects is usually used. It is known that circular neighbor balanced designs (CNBDs) are universally optimal under such a model if the neighbor effects are fixed (Druilhet, 1999) or random (4 and 7). However, such designs cannot exist for every combination of design parameters. In the class of block designs with the same number of treatments as experimental units per block, a CNBD cannot exist if the number of blocks, b  , is equal to p(t−1)±1$p(t-1)\pm 1$, where p is a positive integer and t is the number of treatments. Filipiak et al. (2008) gave the structure of the left-neighboring matrix of E-optimal complete block designs with p  =1 under the model with fixed neighbor effects. The purpose of this paper is to generalize E-optimality results for designs with p∈N$p\in \mathbb{N}$ assuming random neighbor effects.     

Extension and necessity of Cheng and Wu conditions

Repeated Measurement Designs, with two treatments, n (experimental) units and p periods are examined. The model examined is with uncorrelated observations following a continuous distribution with constant variance and the parameters of interest are (i) the difference of direct effects and (ii) the difference of residual effects. In this paper (a) the difference of Universal optimality and Φ-optimality is clarified and (b) the sufficient conditions of Cheng and Wu (1980) are extended to include the case n=2 mod 4, p even, (c) also it is shown that these conditions are also necessary for Φ-optimality for estimating direct as well as residual effects, and (d) a method is proposed to construct Φ-optimal designs and examples are given when n even and p=3, n=0 mod 4 and p=4, n=2 mod 4 and p=4. In the last case the estimated parameters in the optimal design are correlated.     

Recurrence relations for moments of progressively censored order statistics from logistic distribution with applications to inference

In this paper, we establish several recurrence relations for the single and product moments of progressively Type-II right censored order statistics from a logistic distribution. The use of these relations in a systematic manner allows us to compute all the means, variances and covariances of progressively Type-II right censored order statistics from the logistic distribution for all sample sizes n, effective sample sizes m, and all progressive censoring schemes (R₁,…,R_m). The results established here generalize the corresponding results for the usual order statistics due to [Shah, 1966] and [Shah, 1970]. These moments are then utilized to derive best linear unbiased estimators of the location and scale parameters of the logistic distribution. A comparison of these estimators with the maximum likelihood estimations is then made. The best linear unbiased predictors of censored failure times are briefly discussed. Finally, an illustrative example is presented.     

Likelihood as an index of fit

Summary In this paper likelihood is characterized as an index which measures how much a model fits a sample. Some properties required to an index of fit are introduced and discussed, while stressing how they describe aspects inner to idea of fit. Finally we prove that, if an index of fit is maximal when the model reaches the distribution of the sample, then such an index is an increasing continuous transform of , where thep _i's are the theoretical relative frequencies provided by the model and theq _i's are the actual relative frequencies of the sample.     

The nonparametric maximum likelihood estimator for middle-censored data

In this note, we consider data subjected to middle censoring where the variable of interest becomes unobservable when it falls within an interval of censorship. We demonstrate that the nonparametric maximum likelihood estimator (NPMLE) of distribution function can be obtained by using Turnbull's (1976) EM algorithm or self-consistent estimating equation (Jammalamadaka and Mangalam, 2003) with an initial estimator which puts mass only on the innermost intervals. The consistency of the NPMLE can be established based on the asymptotic properties of self-consistent estimators (SCE) with mixed interval-censored data ( [Yu et al., 2000] and [Yu et al., 2001]).     

Sequential estimation of the sum of sinusoidal model parameters

Estimating the parameters of the sum of a sinusoidal model in presence of additive noise is a classical problem. It is well known to be a difficult problem when the two adjacent frequencies are not well separated or when the number of components is very large. In this paper we propose a simple sequential procedure to estimate the unknown frequencies and amplitudes of the sinusoidal signals. It is observed that if there are p components in the signal then at the k  th (k?p)$(k?p)$ stage our procedure produces strongly consistent estimators of the k   dominant sinusoids. For k>p$k>p$, the amplitude estimators converge to zero almost surely. Asymptotic distribution of the proposed estimators is also established and it is observed that it coincides with the asymptotic distribution of the least squares estimators. Numerical simulations are performed to observe the performance of the proposed estimators for different sample sizes and for different models. One ECG data and one synthesized data are analyzed for illustrative purpose.     

Construction of some classes of balanced cross-over designs from terraces

5 and 6 have recently introduced power-sequence terraces. In this paper we have used these terraces for the construction of some new families of balanced cross-over designs of first and second order which are variance-balanced. We have also used them for the construction of some new families of balanced ternary cross-over designs.     

Maximum term of a particular autoregressivesequence with discrete margins

In this paper we consider a stationary sequence of discrete random variables with marginal distribution H(x), obtained by a simple transformation from the max-AR(1) sequence considered by Alpuim (1989). Because discrete distributions impose severe restrictions on the convergence of the normalized maxima to an extreme value distribution, it is seen that in this particular case, whenever H(x) belongs to the domain of attraction of any max-stable distribution, the sequence possesses an extremal index 0 = 0. Nevertheless, it, is possible to obtain a nondegenerate limiting distribution for the linearized maxima by choosing other sets of normalizing constants. Whenever H(x) does not belong to the domain of attraction of any max-stable distribution, but, satisfies adequate conditions, the maxima nearly possess an asymptotic stability with the presence of an extremal index 0 <θ<1.

Motivated by the behaviour of these sequences we obtained a more general result extending the results of Anderson (1970) and Me (Jon nick and Park (1992) over the mixing conditionsD ^(k)(u_n), defined by Chermck et al (1991).

Several examples, obtained after simulation, are presented in order to illustrate the different situations that may occur.     

CARMA(p,q) generalized random processes

There is now a vast literature on the theory and applications of generalized random processes, pioneered by Itô (1953), Gel’fand (1955) and Yaglom (1957). In this note we make use of the theory of generalized random processes as defined in the book of Gel’fand and Vilenkin (1964) to extend the definition of continuous-time ARMA(p,q  ) processes to allow q≥p$q\ge p$, in which case the processes do not exist in the classical sense. The resulting CARMA generalized random processes provide a framework within which it is possible to study derivatives of CARMA processes of arbitrarily high order.     

Rates of convergence of Lp-estimators for a density with an infinity cusp

We study the asymptotics of L_p-estimators, p>0, as estimates of a parameter of location for data coming for a symmetric density with an infinity cusp at the center of symmetry of the distribution. In this situation, the data are more concentrated around the parameter of location than in usual cases. The maximum-likelihood estimator is not defined. The rates of convergence of the L_p-estimators in this situation depend on p and on the shape of the density. For some densities and small values of p, the L_p-estimator converges with a fast rate of convergence.     

Asymptotic properties of the EPMC for modified linear discriminant analysis when sample size and dimension are both large

We deal with the problem of classifying a new observation vector into one of two known multivariate normal distributions when the dimension p and training sample size N   are both large with p<N$p<N$. Modified linear discriminant analysis (MLDA) was suggested by Xu et al. [10]. Error rate of MLDA is smaller than the one of LDA. However, if p and N   are moderately large, error rate of MLDA is close to the one of LDA. These results are conditional ones, so we should investigate whether they hold unconditionally. In this paper, we give two types of asymptotic approximations of expected probability of misclassification (EPMC) for MLDA as n→∞$n\to \infty$ with p=O(n^δ)$p=O(n^{\delta })$, 0<δ<1$0<\delta <1$. The one of two is the same as the asymptotic approximation of LDA, and the other is corrected version of the approximation. Simulation reveals that the modified version of approximation has good accuracy for the case in which p and N are moderately large.     

Randomized p-values for multiple testing of composite null hypotheses

We are considered with the problem of m simultaneous statistical test problems with composite null hypotheses. Usually, marginal p-values are computed under least favorable parameter configurations (LFCs), thus being over-conservative under non-LFCs. Our proposed randomized p-value leads to a tighter exhaustion of the marginal (local) significance level. In turn, it is stochastically larger than the LFC-based p-value under alternatives. While these distributional properties are typically nonsensical for m  =1, the exhaustion of the local significance level is extremely helpful for cases with m>1$m>1$ in connection with data-adaptive multiple tests as we will demonstrate by considering multiple one-sided tests for Gaussian means.     

Consistency of Bayesian linear model selection with a growing number of parameters

Linear models with a growing number of parameters have been widely used in modern statistics. One important problem about this kind of model is the variable selection issue. Bayesian approaches, which provide a stochastic search of informative variables, have gained popularity. In this paper, we will study the asymptotic properties related to Bayesian model selection when the model dimension p is growing with the sample size n. We consider p≤n and provide sufficient conditions under which: (1) with large probability, the posterior probability of the true model (from which samples are drawn) uniformly dominates the posterior probability of any incorrect models; and (2) the posterior probability of the true model converges to one in probability. Both (1) and (2) guarantee that the true model will be selected under a Bayesian framework. We also demonstrate several situations when (1) holds but (2) fails, which illustrates the difference between these two properties. Finally, we generalize our results to include g-priors, and provide simulation examples to illustrate the main results.     

The minimum coverage probability of confidence intervals in regression after a preliminary F test

Consider a linear regression model with regression parameter β=(β₁,…,β_p) and independent normal errors. Suppose the parameter of interest is θ=a^Tβ, where a is specified. Define the s-dimensional parameter vector τ=C^Tβ−t, where C and t are specified. Suppose that we carry out a preliminary F test of the null hypothesis H₀:τ=0 against the alternative hypothesis H₁:τ≠0. It is common statistical practice to then construct a confidence interval for θ with nominal coverage 1−α, using the same data, based on the assumption that the selected model had been given to us a priori (as the true model). We call this the naive 1−α confidence interval for θ. This assumption is false and it may lead to this confidence interval having minimum coverage probability far below 1−α, making it completely inadequate. We provide a new elegant method for computing the minimum coverage probability of this naive confidence interval, that works well irrespective of how large s is. A very important practical application of this method is to the analysis of covariance. In this context, τ can be defined so that H₀ expresses the hypothesis of “parallelism”. Applied statisticians commonly recommend carrying out a preliminary F test of this hypothesis. We illustrate the application of our method with a real-life analysis of covariance data set and a preliminary F test for “parallelism”. We show that the naive 0.95 confidence interval has minimum coverage probability 0.0846, showing that it is completely inadequate.     

Explicit formulas for generalized family-wise error rates and unimprovable step-down multiple testing procedures

Many multiple testing procedures (MTPs) are available today, and their number is growing. Also available are many type I error rates: the family-wise error rate (FWER), the false discovery rate, the proportion of false positives, and others. Most MTPs are designed to control a specific type I error rate, and it is hard to compare different procedures. We approach the problem by studying the exact level at which threshold step-down (TSD) procedures (an important class of MTPs exemplified by the classic Holm procedure) control the generalized FWER   defined as the probability of k$k$ or more false rejections. We find that level explicitly for any TSD procedure and any k$k$. No assumptions are made about the dependency structure of the p$p$-values of the individual tests. We derive from our formula a criterion for unimprovability   of a procedure in the class of TSD procedures controlling the generalized FWER at a given level. In turn, this criterion implies that for each k$k$ the number of such unimprovable procedures is finite and is greater than one if k>1$k>1$. Consequently, in this case the most rejective procedure in the above class does not exist.     

Modelling extremes of time-dependent data by Markov-switching structures

We investigate the extremal clustering behaviour of stationary time series that possess two regimes, where the switch is governed by a hidden two-state Markov chain. We also suppose that the process is conditionally Markovian in each latent regime. We prove under general assumptions that above high thresholds these models behave approximately as a random walk in one (called dominant) regime and as a stationary autoregression in the other (dominated) regime. Based on this observation, we propose an estimation and simulation scheme to analyse the extremal dependence structure of such models, taking into account only observations above high thresholds. The properties of the estimation method are also investigated. Finally, as an application, we fit a model to high-level exceedances of water discharge data, simulate extremal events from the fitted model, and show that the (model-based) flood peak, flood duration and flood volume distributions match their observed counterparts.