Time Series Analysis of Repeated Surveys: The State–space Approach

Cross sectional estimates from repeated surveys form a time series { y_t }. These estimates can be viewed as the sum y _t = Y _t + e _t of two processes, { Y _t }, the population process and { e _t }, the survey error process. Serial correlations in the latter series are usually present, mainly due to sample overlap. Other sources of data such as censuses, administrative records and demographic population counts are also available. The state–space modelling approach to the analysis of repeated surveys allows combining information from different sources, incorporating benchmarking constraints in a natural way. Results from these methods seem to compare favourably with those from X-11-ARIMA in filtering out survey errors.     

A test for equality of two exponential distributions

Abstract Let X ₁., X _n1 and Y ₁., Y _n1, be two independent random samples from exponential populations. The statistical problem is to test whether or not two exponential populations are the same, based on the order statistics X _[1],. X _[r1] and Y [₁],. Y _[rs] where 1 r₁ n ₁ and 1 r₂ n ₂. A new test is given and an asymptotic optimum property of the test is proved.     

Stratification of Skewed Populations: A Comparison of Optimisation‐based versus Approximate Methods

Survey statisticians use either approximate or optimisation‐based methods to stratify finite populations. Examples of the former are the cumrootf (Dalenius & Hodges, 1957 ) and geometric (Gunning & Horgan, 2004 ) methods, while examples of the latter are Sethi ( 1963 ) and Kozak ( 2004 ) algorithms. The approximate procedures result in inflexible stratum boundaries; this lack of flexibility results in non‐optimal boundaries. On the other hand, optimisation‐based methods provide stratum boundaries that can simultaneously account for (i) a chosen allocation scheme, (ii) overall sample size or required reliability of the estimator of a studied parameter and (iii) presence or absence of a take‐all stratum. Given these additional conditions, optimisation‐based methods will result in optimal boundaries. The only disadvantage of these methods is their complexity. However, in the second decade of 21st century, this complexity does not actually pose a problem. We illustrate how these two groups of methods differ by comparing their efficiency for two artificial populations and a real population. Our final point is that statistical offices should prefer optimisation‐based over approximate stratification methods; such a decision will help them either save much public money or, if funds are already allocated to a survey, result in more precise estimates of national statistics.     

An alternate development of conditioning

Abstract  The "classical" development of conditioning, due to K olmogorov , does not agree with the "practical" (more intuitive, but unrigorous) way in which probabilists and statisticians actually think about conditioning. This paper describes an alternative to the classical development. It is shown that standard concepts and results can be developed, rigorously, along lines, which correspond to the "practical" approach, and so as to include the classical material as a special case. More specifically, let Xand Y be random variables (r.v.'s) from (Ω, f, P) to ( x, f_x ) and (y. f^y.), respectively. In this paper, the fundamental concept is the conditional probability P(AX = x ), a function of xε x which satisfies a "natural" defining condition. This is used to define a conditional distribution P_y/x, as a mapping x × f^y-R such that, as a function of B, P_ylx=x,(B ) is a probability measure on f^y. Then, for a numerical r.v. Y , conditional expectation E(Y/X) is defined as a mapping x → whose value at x isE(Y/X = x) = ydP_Y/x=i(y ). Basic properties of conditional probabilities, distributions, and expectations, are derived and their existence and uniqueness are discussed. Finally, for a sub-o-algebra and a numerical r.v. Y , the classical conditional expectation E(Y) is obtained as E(Y/X) with X = i , the identity mapping from (Ω, f) to (Ω).     

Stratification of Skewed Populations: A review

When Dalenius provided a set of equations for the determination of stratum boundaries of a single auxiliary variable, that minimise the variance of the Horvitz–Thompson estimator of the mean or total under Neyman allocation for a fixed sample size, he pointed out that, though mathematically correct, those equations are troublesome to solve. Since then there has been a proliferation of approximations of an iterative nature, or otherwise cumbersome, tendered for this problem; many of these approximations assume a uniform distribution within strata, and, in the case of skewed populations, that all strata have the same relative variation. What seems to have been missed is that the combination of these two assumptions offers a much simpler and equally effective method of subdivision for skewed populations; take the stratum boundaries in geometric progression.     

Some problems in actuarial finance involving sums of dependent risks

A trend in actuarial finance is to combine technical risk with interest risk. If Y_t , t = 1, 2, denotes the timevalue of money (discount factors at time t ) and X_t the stochastic payments to be made at time t , the random variable of interest is often the scalar product of these two random vectors V = X_t Y_t . The vectors X and Y are supposed to be independent, although in general they have dependent components. The current insurance practice based on the law of large numbers disregards the stochastic financial aspects of insurance. On the other hand, introduction of the variables Y ₁, Y ₂, to describe the financial aspects necessitates estimation or knowledge of their distribution function.
We investigate some statistical models for problems of insurance and finance, including Risk Based Capital/Value at Risk, Asset Liability Management, the distribution of annuities, cash flow evaluations (in the framework of pension funds, embedded value of a portfolio, Asian options) and provisions for claims incurred, but not reported (IBNR).     

Inequalities relating maximal moments to other measures of dispersion

Let X , X ₁, ..., X_k be i.i.d. random variables, and for k ∈ N let D_k ( X ) = E ( X ₁ V ... V X _{k +1}) − EX be the k th centralized maximal moment. A sharp lower bound is given for D ₁( X ) in terms of the Lévy concentration Q_l ( X ) = sup _{x ∈ R} P ( X ∈[ x , x + l ]). This inequality, which is analogous to P. Levy's concentration-variance inequality, illustrates the fact that maximal moments are a gauge of how much spread out the underlying distribution is. It is also shown that the centralized maximal moments are increased under convolution.     

On a crossroad of resampling plans: bootstrapping elementary symmetric polynomials

We investigate the validity of the bootstrap method for the elementary symmetric polynomials S ^{( k )} _n =( ⁿ _k )⁻¹Σ_{1≤ i 1}< ... < i _k ≤ n X _{i 1} ... X _{i k} of i.i.d. random variables X ₁, ..., X _n . For both fixed and increasing order k , as n→∞ the cases where μ=E X ₁[moe2]0, the nondegenerate case, and where μ=E X ₁=0, the degenerate case, are considered.     

Een indelingsprobleem

Summary  A branch and bound algorithm is given to solve the following problem: To each pair of elements (i,j) from a set X ={l,…, n } a number r _ij with r _ij≥ 0, r _ij= r _ij and r _ij= 0 has been assigned. Find a prescribed number of disjoint subsets P ₁…, P _m from X , such that

Experiments indicate that an optimal solution is usually found in a small number of iterations, but the verification may be rather time consuming.
The algorithm may be used to find the minimum value of m for which a partitioning of X with z = 0 exists. The algorithm appears to be efficient for finding this 'chromatic number of a graph'.     

First-Order Integer-Valued Autoregressive (INAR (1)) Process: Distributional and Regression Properties

Some properties of a first-order integer-valued autoregressive process (INAR)) are investigated. The approach begins with discussing the self-decomposability and unimodality of the 1-dimensional marginals of the process {X_n} generated according to the scheme X_n=α° X _n-i +e_n, where α° X _n-1 denotes a sum of X_{n - 1}, independent 0 - 1 random variables Y^(n-1), independent of X _n-1 with Pr -( y ^{(n - 1)}= 1) = 1 - Pr ( y ^(n-i)= 0) =α. The distribution of the innovation process ( e _n) is obtained when the marginal distribution of the process ( X _n) is geometric. Regression behavior of the INAR(1) process shows that the linear regression property in the backward direction is true only for the Poisson INAR(1) process.     

Using nonparametric methods in social surveys: an empirical study

The most common form of data for socio-economic studies comes from survey sampling. Often the designs of such surveys are complex and use stratification as a method for selecting sample units. A parametric regression model is widely employed for the analysis of such survey data. However the use of a parametric model to represent the relationship between the variables can be inappropriate. A natural alternative is to adopt a nonparametric approach. In this article we address the problem of estimating the finite population mean under stratified sampling. A new stratified estimator based on nonparametric regression is proposed for stratification with proportional allocation, optimum allocation and post-stratification. We focus on an educational and labor-related context with natural populations to test the proposed nonparametric method. Simulated populations have also been considered to evaluate the practical performance of the proposed method.     

Generalized densities of order statistics

Let X ₁, ... , X _n be independent identically distributed random variables with distribution F . We derive expressions for generalized joint 'densities' of order statistics of X ₁, ... , X _n , for arbitrary distributions F , in terms of Radon–Nikodym derivatives with respect to product measures based on F . We then give formulae for conditional distributions of order statistics and use them to derive results concerning Markov properties of order statistics, formulae for distributions of trimmed sums, and other useful representations. Our approach leads to simple and natural expressions which appear not to have been given before.     

On divergence and convergence of sums of nonnegative random variables

Abstract  If X ₁, X ₂,… are exponentially distributed random variables thenσ^∞_{k= 1} X_k=∞ with probability 1 iff σ^∞_{k= 1} EX_k=∞. This result, which is basic for a criterion in the theory of Markov jump processes for ruling out explosions (infinitely many transitions within a finite time) is usually proved under the assumption of independence (see FREEDMAN (1971), p. 153–154 or BREI-MAN (1968), p. 337–338), but is shown in this note to hold without any assumption on the joint distribution. More generally, it is investigated when sums of nonnegative random variables with given marginal distributions converge or diverge whatever are their joint distributions.     

Optimal allocation of the sample size to strata under box constraints

In stratified random sampling without replacement boundary conditions, such as the sample sizes within strata shall not exceed the population sizes in the respective strata, have to be considered. Stenger and Gabler (Metrika, 61:137–156, 2005) have shown a solution that satisfies upper boundaries of sample fractions within the strata. However, in modern applications one may wish to guarantee also minimal sampling fractions within strata in order to allow for reasonable separate estimations. Within this paper, an optimal allocation in the Neyman-Tschuprov sense is developed which satisfies upper and lower bounds of the sample sizes within strata. Further, a stable algorithm is given which ensures optimality. The resulting sample allocation enables users to bound design weights within stratified random sampling while considering optimality in allocation.     

Diversification for general copula dependence

We generalize the extreme value analysis for Archimedean copulas (see Alink , Löwe and Wüthrich , 2003) to the non-Archimedean case: Assume we have d ≥2 exchangeable and continuously distributed risks X ₁,…, X _d . Under appropriate assumptions there is a constant q _d such that, for all large u , we have . The constant q _d describes the asymptotic dependence structure. Typically, q _d will depend on more aspects of this dependence structure than the well-known tail dependence coefficient.     

Stability and self-decomposability of semi-group valued random variables

A random variable X on IR₊ is said to be self-decomposable, dif for all c∈ (0, 1) there exists a random variable X_c on IR₊ such that X=^dcX+X_c . It is said to be stable if it is self-decomposable and X_c=^d (1 - c)X' , where X and X' are identically and independently distributed. The notions of stability and self-decomposability for infinitely divisible random variables are generalised to abelian semi-groups ( S, + ) with S having an identical involution, by using characteristic functions. The generalised definitions involve semi-groups of scaling operators T . There operators can be interpreted in a slightly different context as generalised continuous-time branching processes (with immigration). The underlying importance of the generator of the semi-groups T in the characterisation of stability and self-decomposability is stressed.     

Generalized two-sample U-statistics for clustered data

In this paper we investigate two-sample U -statistics in the case of clusters of repeated measurements observed on individuals from independent populations. The observations on the i -th individual in the first population are denoted by     , 1 ≤  i  ≤  m , and those on the k -th individual in the second population are denoted by     , 1 ≤  k  ≤  n . Given the kernel φ ( x ,  y ), we define the generalized two-sample U -statistic by
We derive the asymptotic distribution of U _{m , n} for large sample sizes. As an application we study the generalized Mann–Whitney–Wilcoxon rank sum test for clustered data.     

On Bayesian selection of the best normal population using theKullback–Leibler divergence measure

In this paper, we use the Bayesian approach to study the problem of selecting the best population among k different populations π₁, ..., π_k (k≥2) relative to some standard (or control) population π₀. Here, π₀ is considered to be the population with the desired characteristics. The best population is defined to be the one which is closest to the ideal population π₀ . The procedure uses the idea of minimizing the posterior expected value of the Kullback–Leibler (KL) divergence measure of π _i from π₀. The populations under consideration are assumed to be multivariate normal. An application to regression problems is also presented. Finally, a numerical example using real data set is provided to illustrate the implementation of the selection procedure.     

On certain type of Queues in series

Summary This paper studies the steady-state behaviour of a queueing system consisting of three servers S₁, S₂ and S₃ . Two types of units each requiring two phases of service arrive and form two queues Q₁ and Q₂ in-front of the two servers S₁ and S₂, respectively, which attend to their first phase of service in order of arrival. On completion of the first phase the units discharged from these servers from a single queue Q₃ in-front of S₃ for the phase 2 service. The various stochastic processes namely, the interrarrival times and the service times, have been assumed to be distributed exponentially. We derive for this queueing process an expression for the mean queue length and some particular cases thereof.     

Het verdelen van steekproeven over subpopulaties bij accountantscontroles

Summary  "Stratificationprocedures for a typical auditing problem".
During the past ten years, much experience was gained in The Netherlands in using random sampling methods for typical auditing problems. Especially, a method suggested by VAN. HEERDEN [2] turned out to be very fruitful. In this method a register of entries is considered to be a population of T guilders, if all entries total up to T guilders. The sample size n ₀ is determined in such a way that the probability β not to find any mistake in the sample, if a fraction p ₀ or more of T is incorrect, is smaller than a preassigned value β₀. So n ₀ should satisfy (l- p )ⁿ⁰≤β₀ for p ≥ p ₀. A complication arises if it is not possible to postpone sampling until the whole population T is available. One then wants to take samples from a population which is growing up to T . Suppose one is going to take samples n _i from e.g. r subpopulations

Using the minimax procedure, it is shown, that in this case one should choose the sizes n _i equal to ( T _i/ T ) n ₀. The minimax-value of the probability not to find any incorrect guilder in the r samples, taken together is equal to β₀.