scispace - formally typeset
Journal ArticleDOI

Runs and Scans With Applications

Małgorzata Roos
- 01 Dec 2002 - 
- Vol. 97, Iss: 460, pp 1205-1205
TLDR
This text is a revision of the book by Arnold, Costillo, and Sarabia (1992), but with much more depth than the original, and comprises a lively overview of conditionally speciŽ ed models of the conditional distribution.
Abstract
of the conditional distribution speciŽ cations. Chapters 8 and 10 extend these methods from two to more dimensions. Chapter 9 investigates estimation in conditionally speciŽ ed models. Chapter 11 considers models speciŽ ed by conditioning on events speciŽ ed by one variable exceeding a value rather than equaling a value, and Chapter 12 considers models for extreme-value data. Chapter 13 extends conditional speciŽ cation to Bayesian analysis. Chapter 14 describes the related simultaneous-equation models, and Chapter 15 ties in some additional topics. An appendix describes methods of simulation from conditionally speciŽ ed models. Chapters 1–4, plus Chapters 9 and 13, comprise a lively overview of conditionally speciŽ ed models. The remainder of the text constitutes a detailed catalog of results speciŽ c to different conditional distributions. Although this catalog is certainly of value, the reader desiring a briefer and less detailed introduction to the subject might skip the remainder at Ž rst reading. This text is a revision of the book by Arnold, Costillo, and Sarabia (1992). The current version is of similar breadth, but with much more depth than the original. The text is clearly written and accessible with relatively few mathematical prerequisites. I found surprisingly few typographical errors; the authors are to be congratulated for this. In a few cases, regularity conditions for results are not given in full. Generally, this causes little confusion, although something does appear to be missing in the statement of Aczél’s key theorem (Theorem 1.3). Fortunately, most of the results in the sequel are derived from corollaries to this theorem, and the corollaries are stated more precisely. I noted few gaps in the material covered. The only area that I thought was insufŽ ciently represented was application to Markov chain Monte Carlo. Conditional speciŽ cation is particularly important in Gibbs sampling. I believe that many practitioners would beneŽ t from a discussion of the issues involved in these sampling schemes. Each chapter contains numerous exercises. These exercises appear to be at an appropriate level for a graduate course in statistics, and appear to provide appropriate reinforcement for the material in the preceding chapters.

read more

Citations
More filters
Journal ArticleDOI

Runs in coin tossing: a general approach for deriving distributions for functionals

TL;DR: In this article, the authors take a fresh look at the classical problem of runs in a sequence of independent and identically distributed coin tosses and derive a general identity/recursion which can be used to compute (joint) distributions of functionals of run types.
Journal ArticleDOI

An Efficient Algorithm for Exact Distribution of Discrete Scan Statistics

TL;DR: In this paper, exact distribution of discrete scan statistics for the cases of homogeneous two-state Markov dependent trials as well as i.i.d. Bernoulli trials are discussed by utilizing probability generating functions.
Journal ArticleDOI

Waiting time distributions of simple and compound patterns in a sequence of r-th order Markov dependent multi-state trials

TL;DR: In this article, the authors provided a comprehensive theoretical framework for obtaining waiting time distributions under the most general structure where the sequence consists of r-th order (r≥ 1) Markov dependent multi-state trials.
Journal ArticleDOI

A new shock model with a change in shock size distribution

TL;DR: It is shown that the system's lifetime has matrix-exponential distribution when the intershock times follow Erlang distribution.
Journal ArticleDOI

Generalizations of Runs and Patterns Distributions for Sequences of Binary Trials.

TL;DR: The distributions of families of patterns which generalize runs and patterns distributions extensively examined in the literature during the last decades are studied.
References
More filters
Journal ArticleDOI

Nonparametric intensity bounds for the delineation of spatial clusters

TL;DR: A method to measure the plausibility of each area being part of a possible localized anomaly in the map of rates and find intensity bounds for the delineation of spatial clusters in maps of areas with known populations and observed number of cases is proposed.
Journal ArticleDOI

Multivariate normal approximation with Stein's method of exchangeable pairs under a general linearity condition

TL;DR: In this paper, a multivariate exchangeable pairs approach was proposed to assess distributional distances to potentially singular multivariate normal distributions, which allows for a normal approximation even when the corresponding statistics of interest do not lend themselves easily to Stein's exchangeable pair approach.
Journal ArticleDOI

Statistical Process Control using Shewhart Control Charts with Supplementary Runs Rules

TL;DR: In this paper, the authors present the basic principles and recent advances in the area of statistical process control charting with the aid of runs rules, and briefly discuss the Markov chain approach which is the most popular technique for studying the run length distribution of run based control charts.
Journal ArticleDOI

A Nonparametric Shewhart-Type Signed-Rank Control Chart Based on Runs

TL;DR: Shewhart-type distribution-free control charts are considered for the known in-control median of a continuous process distribution based on the Wilcoxon signed-rank statistic and some runs type rules and can have better out-of-control performance than the Shewhart X-bar chart and the basicsigned-rank chart for the normal distribution and for some heavy-tailed distributions.
Journal ArticleDOI

Sensitivity analysis and efficient method for identifying optimal spaced seeds

TL;DR: The computational aspects of calculating the hitting probability of spaced seeds are studied; and an efficient algorithm for identifying optimal spaced seeds is proposed.