Markov Sampling

A discrete parameter stochastic process is observed at epochs of visits to a specified state in an independent two-state Markov chain. It is established that the family of finite dimensional distributions of the process derived in this way, referred to as Markov sampling, uniquely determines the stochastic structure of the original process. Using this identifiability, it is shown that if the derived process is Markov, then the original process is also Markov and if the derived process is strictly stationary then so is the original.     

Characterization of probability models by an odds ratio in prospective and retrospective studies

It is shown that, when exposure variables are continuous, the odds ratios are functions of exposure differences if and only if Cox's binary logistic models hold in a prospective framework, and if and only if the underlying distribution belongs to a family of exponential type distributions in a retrospective framework.     

Probability of ties and Markov property in discrete order statistics

It is well known that, in the continuous case, the probability that two consecutive order statistics are equal to zero, whereas it is not true when the distribution is discrete. It is, perhaps, for this reason that order statistics from discrete distributions has not been investigated in the literature as much as from a continuous distribution. The main purpose of this paper, therefore, is to obtain the probability of ties when the distribution is discrete. Also it is shown that, in the discrete case, the Markov property does not hold good. However, the order statistics from a geometric distribution forms a Markov chain.     

How Important Is the Effect of Rounding in Goodness-of-Fit

Abstract

In the area of goodness-of-fit there is a clear distinction between the problem of testing the fit of a continuous distribution and that of testing a discrete distribution. In all continuous problems the data is recorded with a limited number of decimals, so in theory one could say that the problem is always of a discrete nature, but it is a common practice to ignore discretization and proceed as if the data is continuous. It is therefore an interesting question whether in a given problem of test of fit, the “limited resolution” in the observed recorded values may be or may be not of concern, if the analysis done ignores this implied discretization. In this article, we address the problem of testing the fit of a continuous distribution with data recorded with a limited resolution. A measure for the degree of discretization is proposed which involves the size of the rounding interval, the dispersion in the underlying distribution and the sample size. This measure is shown to be a key characteristic which allows comparison, in different problems, of the amount of discretization involved. Some asymptotic results are given for the distribution of the EDF (empirical distribution function) statistics that explicitly depend on the above mentioned measure of degree of discretization. The results obtained are illustrated with some simulations for testing normality when the parameters are known and also when they are unknown. The asymptotic distributions are shown to be an accurate approximation for the true finite n distribution obtained by Monte Carlo. A real example from image analysis is also discussed. The conclusion drawn is that in the cases where the value of the measure for the degree of discretization is not “large”, the practice of ignoring discreteness is of no concern. However, when this value is “large”, the effect of ignoring discreteness leads to an exceded number of rejections of the distribution tested, as compared to what would be the number of rejections if no rounding is taking into account. The error made in the number of rejections might be huge.     

Efficient sequential estimation in a markov branching process with immigration

Sequential estimation of parameters In a continuous time Markov branching process with Immigration with split rate λ₁ Immigration rate λ₂, offspring distribution {p₁j≥O) and Immigration distribution {p₂j≥l} is considered. A sequential version of the Cramér-Rao type information inequality is derived which gives a lower bound on the variances of unbiased estimators for any function of these parameters. Attaining the lower bounds depends on whether the sampling plan or stopping rule S, the estimator f, and the parametric function g = E(f) are efficient. All efficient triples (S,f,g) are characterized; It Is shown that for i = 1,2, only linear combinations of λ_ip_{ij j}'s or their ratios are efficiently estimable. Applications to a Yule process, a linear birth and death process with immigration and an M/M/∞ queue are also considered     

Non-parametric Tests for the Comparison of Point Processes Based on Incomplete Data

We consider the comparison of point processes in a discrete observation situation in which each subject is observed only at discrete time points and no history information between observation times is available. A class of non-parametric test statistics for the comparison of point processes based on this kind of data is presented and their asymptotic distributions are derived. The proposed tests are generalizations of the corresponding tests for continuous observations. Some results from a simulation study for evaluating the proposed tests are presented and an illustrative example from a clinical trial is discussed.     

A semi‐Markov model for binary longitudinal responses subject to misclassification

The authors propose a two‐state continuous‐time semi‐Markov model for an unobservable alternating binary process. Another process is observed at discrete time points that may misclassify the true state of the process of interest. To estimate the model's parameters, the authors propose a minimum Pearson chi‐square type estimating approach based on approximated joint probabilities when the true process is in equilibrium. Three consecutive observations are required to have sufficient degrees of freedom to perform estimation. The methodology is demonstrated on parasitic infection data with exponential and gamma sojourn time distributions.     

On special linear identities for order statistics

Linear identities for the distribution functions of order statistics from an iid sample are defined. It is shown that such identities are true for all distributions or to some discrete distributions taking a finite number of values.     

Mixed-spectra analysis for stationary random fields

We consider a, discrete time, weakly stationary bidimensional process, for which the spectral measure is the sum of an absolutely continuous measure, a discrete measure of finite order and a finite number of absolutely continuous measures on several lines. In this paper we are interested in estimating the spectral density of the absolutely continuous measure and of the density on the lines. For this aim, by using the double kernel method, we construct consistent estimators of these densities and we study their asymptotic behaviors in term of the mean squared error with rate.     

Maximum likelihood estimation of linear continuous time long memory processes with discrete time data

Summary.  We develop a new class of time continuous autoregressive fractionally integrated moving average (CARFIMA) models which are useful for modelling regularly spaced and irregu-larly spaced discrete time long memory data. We derive the autocovariance function of a stationary CARFIMA model and study maximum likelihood estimation of a regression model with CARFIMA errors, based on discrete time data and via the innovations algorithm. It is shown that the maximum likelihood estimator is asymptotically normal, and its finite sample properties are studied through simulation. The efficacy of the approach proposed is demonstrated with a data set from an environmental study.     

Two concepts of conditionality

Birnbaum's proof that C and M imply L, would lose its force if it is shown that in some situations M is not acceptable. Godambe (1979) has shown that Birnbaum's M is not as obvious or intuitive as the concept that a ‘mere relabelling’ of sample points should make no difference to the interference that can appropriately be drawn from a particular outcome of a given experiment. Akaike (1982) has shown that in certain situations M amounts to the assertion that a relabelling of sample points involving a false reporting of the outcome of an experiment should make no difference to the inference drawn from a particular outcome of a given experiment. It is shown in this paper that in the situation discussed by Akaike, even if M were to be considered acceptable, it is only a modified conditionality principle C? and M which can formally imply L; Birnbaum's conditionality principle C and M do not imply L.     

Asymptotic Likelihood Based Inference for Co-integrated Homogenous Gaussian Diffusions

In this paper we consider inference for a multivariate Gaussian homogenous diffusion which is co-integrated, i.e. admits a representation in terms of stable relations (ergodic diffusions) plus Brownian motions. We show that inference on co-integration rank (the number of stable relations) in continuous time can be based on existing asymptotic distributions from discrete time co-integration analysis. Likewise the asymptotic distributions of the co-integration parameters are shown to be mixed Gaussian. Special attention is given to the parametrization of the drift terms. It is shown that the asymptotic distribution of the co-integration rank test statistic does not depend on the level of the process as a result of the chosen parametrization.     

Discrete Burr and discrete Pareto distributions

In this paper we obtain discrete Burr and Pareto distributions using the general approach of discretizing a continuous distribution and propose them as suitable lifetime models. It may be worth exploring the possibility of developing discrete versions of the Burr and Pareto distributions, so that, the same can be used for modeling discrete data. The equivalence of continuous and discrete Burr distributions has been established. Some important distributional properties and estimation of reliability characteristics are discussed. An application in reliability estimation in series system and a real data example on dentistry using this distribution is also discussed.     

Dependence Estimation for High‐frequency Sampled Multivariate CARMA Models

The paper considers high‐frequency sampled multivariate continuous‐time autoregressive moving average (MCARMA) models and derives the asymptotic behaviour of the sample autocovariance function to a normal random matrix. Moreover, we obtain the asymptotic behaviour of the cross‐covariances between different components of the model. We will see that the limit distribution of the sample autocovariance function has a similar structure in the continuous‐time and in the discrete‐time model. As a special case, we consider a CARMA (one‐dimensional MCARMA) process. For a CARMA process, we prove Bartlett's formula for the sample autocorrelation function. Bartlett's formula has the same form in both models; only the sums in the discrete‐time model are exchanged by integrals in the continuous‐time model. Finally, we present limit results for multivariate MA processes as well, which are not known in this generality in the multivariate setting yet.     

On finite mixtures of geometric and negative binomial distributions

Finite mixtures of distributions have been getting increasing use in the applied literature. In the continuous case, linear combinations of exponentials and gammas have been shown to be well suited for modeling purposes. In the discrete case, the focus has primarily been on continuous mixing, usually of Poisson distributions and typically using gammas to describe the random parameter, But many of these applications are forced, especially when a continuous mixing distribution is used. Instead, it is often prefe-rable to try finite mixtures of geometries or negative binomials, since these are the fundamental building blocks of all discrete random variables. To date, a major stumbling block to their use has been the lack of easy routines for estimating the parameters of such models. This problem has now been alleviated by the adaptation to the discrete case of numerical procedures recently developed for exponential, Weibull, and gamma mixtures. The new methods have been applied to four previously studied data sets, and significant improvements reported in goodness-of-fit, with resultant implications for each affected study.     

A computational investigation of conover's kolmogorov-smirnov test for discrete distributions

The tabled significance values of the Kolmogorov-Smirnov goodness-of-fit statistic determined for continuous underlying distributions are conservative for applications involving discrete underlying distributions. Conover (1972) proposed an efficient method for computing the exact significance level of the Kolmogorov-Smirnov test for discrete distributions; however, he warned against its use for large sample sizes because “the calculations become too difficult.”

In this work we explore the relationship between sample size and the computational effectiveness of Conover's formulas, where “computational effectiveness” is taken to mean the accuracy attained with a fixed precision of machine arithmetic. The nature of the difficulties in calculations is pointed out. It is indicated that, despite these difficulties, Conover's method of computing the Kolmogorov-Smirnov significance level for discrete distributions can still be a useful tool for a wide range of sample sizes.     

Modelling Poisson marked point processes using bivariate mixture transition distributions

A class of bivariate continuous-discrete distributions is proposed to fit Poisson dynamic models in a single unified framework via bivariate mixture transition distributions (BMTDs). Potential advantages of this class over the current models include its ability to capture stretches, bursts and nonlinear patterns characterized by Internet network traffic, high-frequency financial data and many others. It models the inter-arrival times and the number of arrivals (marks) in a single unified model which benefits from the dependence structure of the data. The continuous marginal distributions of this class include as special cases the exponential, gamma, Weibull and Rayleigh distributions (for the inter-arrival times), whereas the discrete marginal distributions are geometric and negative binomial. The conditional distributions are Poisson and Erlang. Maximum-likelihood estimation is discussed and parameter estimates are obtained using an expectation–maximization algorithm, while the standard errors are estimated using the missing information principle. It is shown via real data examples that the proposed BMTD models appear to capture data features better than other competing models.     

An alternative approach for compatibility of two discrete conditional distributions

ABSTRACT

Conditional specification of distributions is a developing area with increasing applications. In the finite discrete case, a variety of compatible conditions can be derived. In this paper, we propose an alternative approach to study the compatibility of two conditional probability distributions under the finite discrete setup. A technique based on rank-based criterion is shown to be particularly convenient for identifying compatible distributions corresponding to complete conditional specification including the case with zeros.The proposed methods are illustrated with several examples.     

On the Breakdown Properties of Some Multivariate M‐Functionals*

Abstract. For probability distributions on ? ^q, a detailed study of the breakdown properties of some multivariate M‐functionals related to Tyler's [Ann. Statist. 15 (1987) 234] ‘distribution‐free’ M‐functional of scatter is given. These include a symmetrized version of Tyler's M‐functional of scatter, and the multivariate t M‐functionals of location and scatter. It is shown that for ‘smooth’ distributions, the (contamination) breakdown point of Tyler's M‐functional of scatter and of its symmetrized version are 1/q and , respectively. For the multivariate t M‐functional which arises from the maximum likelihood estimate for the parameters of an elliptical t distribution on ν ≥ 1 degrees of freedom the breakdown point at smooth distributions is 1/( q + ν). Breakdown points are also obtained for general distributions, including empirical distributions. Finally, the sources of breakdown are investigated. It turns out that breakdown can only be caused by contaminating distributions that are concentrated near low‐dimensional subspaces.     

Characterization of generalized markov-polya and generalized polya-eggenberger distributions

A discrete model is considered where the original observation is subjected to partial destruction according to the Generalized Markov-Polya (GMP) damage model. A characterization of the Generalized Polya-Eggenberger distribution (GPED) is given in the context of the Rao-Rubin condition. More specifically, if the probability that an observation n of a non-negative integer valued r.v.X is reduced to an integer k during a damage, process is given by the GMPD, and if the resulting r.v.Y is such thatrit satisfies the RR-conditlon, then X has a GPED. Secondly, if N = A + B, where B is the missing part and A is the recorded part such that the conditional distribution P(A= x|N=n) is the GMPD, then the r.v.'s A and B are independent if, and only if, N has a GPED. Several other characterizations are also given for these two distributions. The results of Rao-Rubin ‘1964’, Patil-Ratnaparkhi (1977) and Consul (1975) follow as special cases.