Characterizations based on record values and order statistics

Consider a sequence of independent and identically distributed random variables {_Xi,i?1}$\{X_i,i?1\}$ with a common absolutely continuous distribution function F  . Let _X1:n?_X2:n???_Xn:n$X_{1:n}?X_{2:n}???X_{n:n}$ be the order statistics of {_X1,_X2,…,_Xn}$\{X_1,X_2,\dots ,X_n\}$ and {_Yl,l?1}$\{Y_l,l?1\}$ be the sequence of record values generated by {_Xi,i?1}$\{X_i,i?1\}$. In this work, the conditional distribution of _Yl$Y_l$ given _Xn:n$X_{n:n}$ is established. Some characterizations of F   based on record values and _Xn:n$X_{n:n}$ are then given.     

Estimating the distribution of one-dimensional discrete scan statistics viewed as extremes of 1-dependent stationary sequences

Discrete one-dimensional scan statistics can be viewed as extremes of 1-dependent stationary sequences. A result of Haiman [1999. First passage time for some stationary processes. Stochastic Process. Appl. 80, 231–248] provides approximations of the distributions of extremes of 1-dependent stationary sequences together with sharp bounds for the corresponding errors. We apply this result to scan statistics generated by Bernoulli r.v.'s and to the charge problem.     

Characterizations of distributions through coincidences of semiparametric families

Semiparametric families are families that have both a real parameter and a parameter that is itself a distribution. A number of semiparametric families suitable for lifetime data are introduced: scale, power, frailty (proportional hazards), age, moment, Laplace transform, and convolution parameter families. The coincidence of two families provides a characterization of the underlying distribution. Characterizations of the Weibull, gamma, lognormal, and Gompertz distributions are obtained.     

IG-symmetry and R-symmetry: Interrelations and applications to the inverse Gaussian theory

The two parameter inverse Gaussian (IG) distribution is often more appropriate and convenient for modelling and analysis of nonnegative right skewed data than the better known and now ubiquitous Gaussian distribution. Its convenience stems from its analytic simplicity and the striking similarities of its methodologies with those employed with the normal theory models. These, known as the G–IG analogies, include the concepts and measures of IG-symmetry, IG-skewness and IG-kurtosis, the IG-analogues of the corresponding classical notions and measures. The new IG-associated entities, although well defined and mathematically transparent, are intuitively and conceptually opaque. In this paper, we first elaborate the importance of the IG distribution and of the G–IG analogies. Then we consider the IG-related root-reciprocal IG (RRIG) distribution and introduce a physically transparent, conceptually clear notion of reciprocal symmetry (R-symmetry) and use it to explain the IG-symmetry. We study the moments and mixture properties of the R-symmetric distributions and the relationship of R-symmetry with IG-symmetry and note that RRIG distribution provides a link, in addition to Tweedie's Laplace transform link, between the Gaussian and inverse Gaussian distributions. We also give a structural characterization of the unimodal R-symmetric distributions. This work further expands the long list of G–IG analogies. Several applications including product convolution, monotonicity of power functions, peakedness and monotone limit theorems of R-symmetry are outlined.     

On the normal approximation of an estimate of the mean residual life of a multicomponent system

An estimate of the mean residual life function of a complex system of k independent identically distributed components is proposed and studied with emphasis being on the order of normal approximation.     

Gaussian approximation of signed rank statistics process

We consider the signed linear rank statistics of the form

$\text{S}{}_{\mathrm{\Delta N}}\text{=}\text{∑}\text{i=1}\text{N}\text{c}{}_{\mathrm{Ni}}\text{ø(}\text{R}{}^{\mathrm{\Delta }}{}_{\mathrm{Ni}}\text{(N+1)}\text{)}\text{sgn}\text{Y}{}^{\mathrm{\Delta }}{}_{\mathrm{Ni}}$

where the c_Ni's are known real numbers, Δ∈[0,1] is an unknown real parameter,R^Δ_Ni is the rank of |Y^Δ_Ni| among |Y^Δ_Nj|, 1≤j≤N, ø is a score generating function, sgn y=1 or -1 according as y≥0 or <0, and Y^Δ_Nj, 1≤j ≤N, are independent random variables with continuous cumulative distribution functions F(y?Δd_Nj), 1≤ j≤N, respectively where the d_fNi's are known real numbers. Under suitable assumptions on the c's, d's, φ and F, it is proved that the random process {S_ΔN?S_0N?ES_ΔN, 0≤Δ≤1}, properly normalized, converges weakly to a Gaussian process, and this result is also true if ES_ΔN is replaced by Δb_N, where

$\text{b}{}_{\mathrm{N}}\text{=4}\text{∑}\text{i=1}\text{N}\text{c}{}_{\mathrm{Ni}}\text{d}{}_{\mathrm{Ni}}\text{∫}\text{0}\text{∞}\text{ø′(2F(x)?1)?}{}^2\text{(x)}\text{d}\text{x}\text{and}\text{?=F′}$

. As an application, we derive the asymptotic distribution of the properly normalized length of a confidence interval for Δ.     

Flexible univariate and multivariate models based on hidden truncation

A broad spectrum of flexible univariate and multivariate models can be constructed by using a hidden truncation paradigm. Such models can be viewed as being characterized by a basic marginal density, a family of conditional densities and a specified hidden truncation point, or points. The resulting class of distributions includes the basic marginal density as a special case (or as a limiting case), but also includes an array of models that may unexpectedly include many well known densities. Most of the well known skew-normal models (developed from the seed distribution popularized by Azzalini [(1985). A class of distributions which includes the normal ones. Scand. J. Statist. 12(2), 171–178]) can be viewed as being products of such a hidden truncation construction. However, the many hidden truncation models with non-normal component densities undoubtedly deserve further attention.     

Worst-case behavior of string-searching algorithms

If some conditions hold for the string pattern, then in the worst case every string-searching algorithm has to examine all the characters of the text. These conditions hold for more than half of the patterns consisting of 0's and 1's.     

A tale of two countries: The Craig–Sakamoto–Matusita theorem

This paper has a long history. Junjiro Ogawa and I have been friends and collaborators for many years. We started this joint paper in the early 1990s and prepared a draft in September 1995. However, we were trying to improve and simplify some of the proofs, and we revised the paper in January 1998. But circumstances were such that we did not submit the paper, but planned to find further simplifications. Junjiro's untimely death in 2003 brought it forth again. Junjiro always liked this topic, and I am pleased to submit this joint paper in his memory. This paper contains both an historical summary as well as several new results. (Ingram Olkin)     

Some sufficient conditions for establishing (M,S)-optimality

Two sufficient conditions are given for an incomplete block design to be (M,S- optimal. For binary designs the conditions are (i) that the elements in each row, excluding the diagonal element, of the association matrix differ by at most one, and (ii) that the off-diagonal elements of the block characteristic matrix differ by at most one. It is also shown how the conditions can be utilized for nonbinary designs and that for blocks of size two the sufficient condition in terms of the association matrix can be attained.     

Edgeworth expansion for signed linear rank statistics with regression constants

An Edgeworth expansion with remainder o(N^?1) is obtained for signed linear rank statistics under suitable assumptions. The theorem is proved for a wide class of score generating functions including the Chi-quantile function by adapting van Zwet's methodand Does's conditioning arguments.     

Multivariate Matsumoto–Yor property is rather restrictive

Matsumoto and Yor [2001. An analogue of Pitman's 2M-X$2M-X$ theorem for exponential Wiener functionals. Part II: the role of the GIG laws. Nagoya Math. J. 162, 65–86] discovered an interesting invariance property of a product of the generalized inverse Gaussian (GIG) and the gamma distributions. For univariate random variables or symmetric positive definite random matrices it is a characteristic property for this pair of distributions. It appears that for random vectors the Matsumoto–Yor property characterizes only very special families of multivariate GIG and gamma distributions: components of the respective random vectors are grouped into independent subvectors, each subvector having linearly dependent components. This complements the version of the multivariate Matsumoto–Yor property on trees and related characterization obtained in Massam and Weso?owski [2004. The Matsumoto–Yor property on trees. Bernoulli 10, 685–700].     

Limit theory of generalized order statistics

Generalized order statistics (gos) were introduced by Kamps [1995. A Concept of Generalized Order Statistics. Teubner, Stuttgart] to unify several models of ordered random variables (rv's), e.g., (ordinary) order statistics (oos), records, sequential order statistics (sos). In a wide subclass of gos that includes oos and sos, the possible limit distribution functions (df's) of the maximum gos are obtained in Nasri-Roudsari [1996. Extreme value theory of generalized order statistics. J. Statist. Plann. Inference 55, 281–297]. In this paper, for this subclass, necessary and sufficient conditions of weak convergence, as well as the form of the possible limit df's of extreme, intermediate and central gos are derived. These results are extended to a wider subclass.     

Distribution of the length of the longest common subsequence of two multi-state biological sequences

The length of the longest common subsequence (LCS) among two biological sequences has been used as a measure of similarity, and the application of this statistic is of importance in genomic studies. Even for the simple case of two sequences of equal length and composed of binary elements with equal state probabilities, the exact distribution of the length of the LCS remains an open question. This problem is also known as an NP-hard problem in computer science. Apart from combinatorial analysis, using the finite Markov chain imbedding technique, we derive the exact distribution for the length of the LCS between two multi-state sequences of different lengths. Numerical results are provided to illustrate the theoretical results.     

A generalization of the multivariate slash distribution

In this paper, we propose a generalization of the multivariate slash distribution and investigate some of its properties. We show that the new distribution belongs to the elliptically contoured distributions family, and can have heavier tails than the multivariate slash distribution. Therefore, this generalization of the multivariate slash distribution can be considered as an alternative heavy-tailed distribution for modeling data sets in a variety of settings. We apply the generalized multivariate slash distribution to two real data sets to provide some illustrative examples.     

Riesz inverse Gaussian distributions

The notion of generalized power of a positive definite symmetric matrix and a related notion of generalized Bessel function are used to introduce an extension of the class of matrix generalized inverse Gaussian distributions. The new distributions are shown to arise as conditional distributions of Peirce components of Riesz random matrices. Things are explained in the modern framework of symmetric cones and simple Euclidean Jordan algebra.     

On Vervaat and Vervaat-error-type processes for partial sums and renewals

We study the asymptotic behaviour of stochastic processes that are generated by sums of partial sums of i.i.d. random variables and their renewals. We conclude that these processes cannot converge weakly to any nondegenerate random element of the space D[0,1]$D[0,1]$. On the other hand, we show that their properly normalized integrals as Vervaat-type stochastic processes converge weakly to a squared Wiener process. Moreover, we also deal with the asymptotic behaviour of the deviations of these processes, the so-called Vervaat-error-type processes.     

Asymptotic results in canonical discriminant analysis when the dimension is large compared to the sample size

This paper deals with the distributions of test statistics for the number of useful discriminant functions and the characteristic roots in canonical discriminant analysis. These asymptotic distributions have been extensively studied when the number p   of variables is fixed, the number q+1$q+1$ of groups is fixed, and the sample size N tends to infinity. However, these approximations become increasingly inaccurate as the value of p increases for a fixed value of N. On the other hand, we encounter to analyze high-dimensional data such that p is large compared to n. The purpose of the present paper is to derive asymptotic distributions of these statistics in a high-dimensional framework such that q   is fixed, p→∞$p\to \infty$, m=n-p+q→∞$m=n-p+q\to \infty$, and p/n→c∈(0,1)$p/n\to c\in (0,1)$, where n=N-q-1$n=N-q-1$. Numerical simulation revealed that our new asymptotic approximations are more accurate than the classical asymptotic approximations in a considerably wide range of (n,p,q)$(n,p,q)$.