A copula-based Markov chain model for the analysis of binary longitudinal data

A fully parametric first-order autoregressive (AR(1)) model is proposed to analyse binary longitudinal data. By using a discretized version of a copula, the modelling approach allows one to construct separate models for the marginal response and for the dependence between adjacent responses. In particular, the transition model that is focused on discretizes the Gaussian copula in such a way that the marginal is a Bernoulli distribution. A probit link is used to take into account concomitant information in the behaviour of the underlying marginal distribution. Fixed and time-varying covariates can be included in the model. The method is simple and is a natural extension of the AR(1) model for Gaussian series. Since the approach put forward is likelihood-based, it allows interpretations and inferences to be made that are not possible with semi-parametric approaches such as those based on generalized estimating equations. Data from a study designed to reduce the exposure of children to the sun are used to illustrate the methods.     

Nonparametric estimation of waiting time distributions in a Markov model based on current status data

We construct nonparametric estimators of state waiting time distribution functions in a Markov multistate model using current status data. This is a particularly difficult problem since neither the entry nor the exit times of a given state are directly observed. These estimators are obtained, using the Markov property, from estimators of counting processes of state entry and exit times, as well as, the size of “at risk” sets of state entry and transitions out of that state. Consistency of our estimators is established. Finite-sample behavior of our estimators is studied by simulation, in which we show that our estimators based on current status data compare well with those based on complete data. We also illustrate our method using a pubertal development data set obtained from the NHANES III [1997. NHANES III Reference Manuals and Reports (CD-ROM). Analytic and Reporting Guidelines: The Third National Health and Nutrition Examination Survey (1988–94). National Center for Health Statistics, Centers for Disease Control and Prevention, Hyattsville, MD] study.     

Two-dimensional generalisations of dynamic programming for image analysis

Dynamic programming (DP) is a fast, elegant method for solving many one-dimensional optimisation problems but, unfortunately, most problems in image analysis, such as restoration and warping, are two-dimensional. We consider three generalisations of DP. The first is iterated dynamic programming (IDP), where DP is used to recursively solve each of a sequence of one-dimensional problems in turn, to find a local optimum. A second algorithm is an empirical, stochastic optimiser, which is implemented by adding progressively less noise to IDP. The final approach replaces DP by a more computationally intensive Forward-Backward Gibbs Sampler, and uses a simulated annealing cooling schedule. Results are compared with existing pixel-by-pixel methods of iterated conditional modes (ICM) and simulated annealing in two applications: to restore a synthetic aperture radar (SAR) image, and to warp a pulsed-field electrophoresis gel into alignment with a reference image. We find that IDP and its stochastic variant outperform the remaining algorithms.     

A framework for the comparison of maximum pseudo-likelihood and maximum likelihood estimation of exponential family random graph models

The statistical modeling of social network data is difficult due to the complex dependence structure of the tie variables. Statistical exponential families of distributions provide a flexible way to model such dependence. They enable the statistical characteristics of the network to be encapsulated within an exponential family random graph (ERG) model. For a long time, however, likelihood-based estimation was only feasible for ERG models assuming dyad independence. For more realistic and complex models inference has been based on the pseudo-likelihood. Recent advances in computational methods have made likelihood-based inference practical, and comparison of the different estimators possible.     

On the use of quasi-likelihood for estimation in hidden-Markov random fields

This paper illustrates the use of quasi-likelihood methods of inference for hidden Markov random fields. These are simple to use and can be employed under circumstances where only the model form and its covariance structure are specified. In particular they can be used to derive the same estimating equations as the E-M algorithm or change of measure methods, which make full distributional assumptions.     

Role of stylized features in constructing better estimators

This article discusses the role played by stylized features of financial time series in constructing better estimators for the model parameters. We study in detail one such estimator for the transition probabilities of a simple regime switching model. The estimator is based on the squared autocovariances of the time series, which has been discussed in several empirical studies of economic and financial time series. The effectiveness of this estimator in improving the estimation accuracy is investigated, using both finite sample and asymptotic computations. We also report simulation results to confirm our findings and to extend our conclusions over a bigger region of the parameter space.     

Complete moment convergence of widely orthant dependent random variables

It is known that the dependence structure of widely orthant dependent (WOD) random variables is weaker than those of negatively associated (NA) random variables, negatively superadditive dependent (NSD) random variables, negatively orthant dependent (NOD) random variables, and extended negatively dependent (END) random variables. In this article, the results of complete moment convergence and complete convergence are presented for WOD sequence under the same moment conditions as independent sequence in classical result (Chow 1988 Chow, Y. (1988). On the rate of moment convergence of sample sums and extremes. Bull. Inst. Math. Acad. Sin. 16(3):177–201. [Google Scholar]).     

Identification-robust moment-based tests for Markov switching in autoregressive models

ABSTRACT

This paper develops tests of the null hypothesis of linearity in the context of autoregressive models with Markov-switching means and variances. These tests are robust to the identification failures that plague conventional likelihood-based inference methods. The approach exploits the moments of normal mixtures implied by the regime-switching process and uses Monte Carlo test techniques to deal with the presence of an autoregressive component in the model specification. The proposed tests have very respectable power in comparison with the optimal tests for Markov-switching parameters of Carrasco et al. (2014 Carrasco, M., Hu, L., Ploberger, W. (2014). Optimal test for Markov switching parameters. Econometrica 82(2):765–784.[Crossref], [Web of Science ®] , [Google Scholar]), and they are also quite attractive owing to their computational simplicity. The new tests are illustrated with an empirical application to an autoregressive model of USA output growth.