Exact Confidence Bounds When Sampling From Small Finite Universes

There is a very simple and fundamental concept· to much of probability and statistics that can be conveyed using the following problem. PROBLEM. Assume a finite set (universe) of N units where A of the units have a particular attribute. The value of N is known while the value of A is unknown. If a proper subset (sample) of size n is selected randomly and a of the units in the subset are observed to have the particular attribute, what can be said about the unknown value of A? The problem is not new and almost anyone can describe several situations where a particular problem could be presented in this setting. Some recent references with different focuses include Cochran (1977); Williams (1978); Hajek (1981); Stuart (1984); Cassel, Samdal, and Wretman (1977); and Johnson and Kotz (1977). We focus on confidence interval estimation of A. Several methods for exact confidence interval estimation of A exist (Buonaccorsi, 1987, and Peskun, 1990), and this volume presents the theory and an extensive Table for one of them. One of the important contributions in Neyman (1934) is a discussion of the meaning of confidence interval estimation and its relationship with hypothesis testing which we will call the Neyman Approach. In Chapter 3 and following Neyman's Approach for simple random sampling (without replacement), we present an elementary development of exact confidence interval estimation of A as a response to the specific problem cited above.

In many areas of science a basic task is to assess the influence of several factors on a quantity of interest. If this quantity is binary logistic, regression models provide a powerful tool for this purpose. This monograph presents an account of the use of logistic regression in the case where missing values in the variables prevent the use of standard techniques. Such situations occur frequently across a wide range of statistical applications. The emphasis of this book is on methods related to the classical maximum likelihood principle. The author reviews the essentials of logistic regression and discusses the variety of mechanisms which might cause missing values while the rest of the book covers the methods which may be used to deal with missing values and their effectiveness. Researchers across a range of disciplines and graduate students in statistics and biostatistics will find this a readable account of this.

Tessellations are subdivisions of d-dimensional space into non-overlapping "cells". Voronoi tessellations are produced by first considering a set of points (known as nuclei) in d-space, and then defining cells as the set of points which are closest to each nuclei. A random Voronoi tessellation is produced by supposing that the location of each nuclei is determined by some random process. They provide models for many natural phenomena as diverse as the growth of crystals, the territories of animals, the development of regional market areas, and in subjects such as computational geometry and astrophysics. This volume provides an introduction to random Voronoi tessellations by presenting a survey of the main known results and the directions in which research is proceeding. Throughout the volume, mathematical and rigorous proofs are given making this essentially a self-contained account in which no background knowledge of the subject is assumed.

This volume gathers refereed papers presented at the 1994 UCLA conference on "La tent Variable Modeling and Application to Causality. " The meeting was organized by the UCLA Interdivisional Program in Statistics with the purpose of bringing together a group of people who have done recent advanced work in this field. The papers in this volume are representative of a wide variety of disciplines in which the use of latent variable models is rapidly growing. The volume is divided into two broad sections. The first section covers Path Models and Causal Reasoning and the papers are innovations from contributors in disciplines not traditionally associated with behavioural sciences, (e. g. computer science with Judea Pearl and public health with James Robins). Also in this section are contri butions by Rod McDonald and Michael Sobel who have a more traditional approach to causal inference, generating from problems in behavioural sciences. The second section encompasses new approaches to questions of model selection with emphasis on factor analysis and time varying systems. Amemiya uses nonlinear factor analysis which has a higher order of complexity associated with the identifiability condi tions. Muthen studies longitudinal hierarchichal models with latent variables and treats the time vector as a variable rather than a level of hierarchy. Deleeuw extends exploratory factor analysis models by including time as a variable and allowing for discrete and ordi nal latent variables. Arminger looks at autoregressive structures and Bock treats factor analysis models for categorical data.

This book was originally compiled for a course I taught at the University of Rochester in the fall of 1991, and is intended to give advanced graduate students in statistics an introduction to Edgeworth and saddlepoint approximations, and related techniques. Many other authors have also written monographs on this subject, and so this work is narrowly focused on two areas not recently discussed in theoretical text books. These areas are, first, a rigorous consideration of Edgeworth and saddlepoint expansion limit theorems, and second, a survey of the more recent developments in the field. In presenting expansion limit theorems I have drawn heavily 011 notation of McCullagh (1987) and on the theorems presented by Feller (1971) on Edgeworth expansions. For saddlepoint notation and results I relied most heavily on the many papers of Daniels, and a review paper by Reid (1988). Throughout this book I have tried to maintain consistent notation and to present theorems in such a way as to make a few theoretical results useful in as many contexts as possible. This was not only in order to present as many results with as few proofs as possible, but more importantly to show the interconnections between the various facets of asymptotic theory. Special attention is paid to regularity conditions. The reasons they are needed and the parts they play in the proofs are both highlighted.

Mixing is concerned with the analysis of dependence between sigma-fields defined on the same underlying probability space. It provides an important tool of analysis for random fields, Markov processes, central limit theorems as well as being a topic of current research interest in its own right. The aim of this monograph is to provide a study of applications of dependence in probability and statistics. It is divided in two parts, the first covering the definitions and probabilistic properties of mixing theory. The second part describes mixing properties of classical processes and random fields as well as providing a detailed study of linear and Gaussian fields. Consequently, this book will provide statisticians dealing with problems involving weak dependence properties with a powerful tool.

This book consists of three parts: Part One is composed of two introductory chapters. The first chapter provides an instrumental varible interpretation of the state space time series algorithm originally proposed by Aoki (1983), and gives an introductory account for incorporating exogenous signals in state space models. The second chapter, by Havenner, gives practical guidance in apply ing this algorithm by one of the most experienced practitioners of the method. Havenner begins by summarizing six reasons state space methods are advanta geous, and then walks the reader through construction and evaluation of a state space model for four monthly macroeconomic series: industrial production in dex, consumer price index, six month commercial paper rate, and money stock (Ml). To single out one of the several important insights in modeling that he shares with the reader, he discusses in Section 2ii the effects of sampling er rors and model misspecification on successful modeling efforts. He argues that model misspecification is an important amplifier of the effects of sampling error that may cause symplectic matrices to have complex unit roots, a theoretical impossibility. Correct model specifications increase efficiency of estimators and often eliminate this finite sample problem. This is an important insight into the positive realness of covariance matrices; positivity has been emphasized by system engineers to the exclusion of other methods of reducing sampling error and alleviating what is simply a finite sample problem. The second and third parts collect papers that describe specific applications.