On the BLUEs in Two Linear Models via C. R. Rao's Pandora's Box

We consider the estimation of the parameters in two partitioned linear models, denoted by 𝒜 = {y, X ₁ β ₁ + X ₂ β ₂, V _𝒜} and ? = {y, X ₁ β ₁ + X ₂ β ₂, V _?}, which we call full models. Correspondingly, we define submodels 𝒜₁ = {y, X ₁ β ₁, V _𝒜} and ?₁ = {y, X ₁ β ₁, V _?}. Using the so-called Pandora's Box approach introduced by Rao (1971 Rao , C. R. ( 1971 ). Unified theory of linear estimation . Sankhy?, Ser. A 33 : 371 – 394 . [Corrigendum (1972), 34, p. 194, 477.]  [Google Scholar], we give new necessary and sufficient conditions for the equality between the best linear unbiased estimators (BLUEs) of X ₁ β ₁ under 𝒜₁ and ?₁ as well as under 𝒜 and ?. In our considerations we will utilise the Frisch–Waugh–Lovell theorem which provides a connection between the full model 𝒜 and the reduced model 𝒜 _r  = {M ₂ y, M ₂ X ₁ β ₁, M ₂ V _𝒜 M ₂} with M ₂ being an appropriate orthogonal projector. Moreover, we consider the equality of the BLUEs under the full models assuming that they are equal under the submodels.     

Comparing the BLUEs Under Two Linear Models

In this article, we consider two linear models, ?₁ = {y, X β, V ₁} and ?₂ = {y, X β, V ₂}, which differ only in their covariance matrices. Our main focus lies on the difference of the best linear unbiased estimators, BLUEs, of X β under these models. The corresponding problems between the models {y, X β, I _n } and {y, X β, V}, i.e., between the OLSE (ordinary least squares estimator) and BLUE, are pretty well studied. Our purpose is to review the corresponding considerations between the BLUEs of X β under ?₁ and ?₂. This article is an expository one presenting also new results.     

Some Estimates for the Rate of Convergence in the Multidimensional Central Limit Theorem for Homogeneous Markov Chains

This paper obtains some estimates for the rate of convergence in the multi-dimensional central limit theorem for vector-valued functions of a homogeneous Markov chain without assuming the finiteness of their absolute third moment. These estimates have a universal character and generalize the results that hold when the third moments are finite.     

Normal Deviation and Poisson Approximation of a Security Market by the Geometric Markov Renewal Processes

We consider the geometric Markov renewal processes (GMRP) as a model for a security market. Normal deviations of the geometric Markov renewal processes for ergodic averaging and double averaging schemes are derived. We introduce Poisson averaging scheme for the geometric Markov renewal processes. European call option pricing formulas for GMRP are presented.     

A Fixed Point Approach to the Classification of Markov Chains with a Tree Structure

In this paper, we study the classification problem of discrete time and continuous time Markov processes with a tree structure. We first show some useful properties associated with the fixed points of a nondecreasing mapping. Mainly we find the conditions for a fixed point to be the minimal fixed point by using fixed point theory and degree theory. We then use these results to identify conditions for Markov chains of M/G/1 type or GI/M/1 type with a tree structure to be positive recurrent, null recurrent, or transient. The results are generalized to Markov chains of matrix M/G/1 type with a tree structure. For all these cases, a relationship between a certain fixed point, the matrix of partial differentiation (Jacobian) associated with the fixed point, and the classification of the Markov chain with a tree structure is established. More specifically, we show that the Perron-Frobenius eigenvalue of the matrix of partial differentiation associated with a certain fixed point provides information for a complete classification of the Markov chains of interest.     

Statistical analysis of the number of self-overlapping leftmost repeats in an homogeneous stationary Markov chain on finite states

ABSTRACT

This article addresses the problem of repeats detection used in the comparison of significant repeats in sequences. The case of self-overlapping leftmost repeats for large sequences generated by an homogeneous stationary Markov chain has not been treated in the literature. In this work, we are interested by the approximation of the number of self-overlapping leftmost long enough repeats distribution in an homogeneous stationary Markov chain. Using the Chen–Stein method, we show that the number of self-overlapping leftmost long enough repeats distribution is approximated by the Poisson distribution. Moreover, we show that this approximation can be extended to the case where the sequences are generated by a m-order Markov chain.     

Non‐Parametric Estimation of the Conditional Distribution of the Interjumping Times for Piecewise‐Deterministic Markov Processes

This paper presents a non‐parametric method for estimating the conditional density associated to the jump rate of a piecewise‐deterministic Markov process. In our framework, the estimation needs only one observation of the process within a long time interval. Our method relies on a generalization of Aalen's multiplicative intensity model. We prove the uniform consistency of our estimator, under some reasonable assumptions related to the primitive characteristics of the process. A simulation study illustrates the behaviour of our estimator.     

The use of simple reparameterizations to improve the efficiency of Markov chain Monte Carlo estimation for multilevel models with applications to discrete time survival models

Summary.  We consider the application of Markov chain Monte Carlo (MCMC) estimation methods to random-effects models and in particular the family of discrete time survival models. Survival models can be used in many situations in the medical and social sciences and we illustrate their use through two examples that differ in terms of both substantive area and data structure. A multilevel discrete time survival analysis involves expanding the data set so that the model can be cast as a standard multilevel binary response model. For such models it has been shown that MCMC methods have advantages in terms of reducing estimate bias. However, the data expansion results in very large data sets for which MCMC estimation is often slow and can produce chains that exhibit poor mixing. Any way of improving the mixing will result in both speeding up the methods and more confidence in the estimates that are produced. The MCMC methodological literature is full of alternative algorithms designed to improve mixing of chains and we describe three reparameterization techniques that are easy to implement in available software. We consider two examples of multilevel survival analysis: incidence of mastitis in dairy cattle and contraceptive use dynamics in Indonesia. For each application we show where the reparameterization techniques can be used and assess their performance.     

Bootstrap test of hypothesis for the multi-state models in survival analysis

Abstract

In the present paper we develop bootstrap tests of hypothesis, based on simulation, for the transition probability matrix arising in the context of a multi-state model. The bootstrap test statistic is based on the paper of Tattar and Vaman (2008 Tattar, P. N., Vaman, H. J. (2008). Testing transition probability matrix of a multi-state model with censored data. Lifetime Data Anal. 14(2):216–230.[Crossref], [PubMed], [Web of Science ®] , [Google Scholar]), which develops a statistic for the testing problems concerning the transition probability matrix of the non homogeneous Markov process.     

An efficient correction to the density-based empirical likelihood ratio goodness-of-fit test for the inverse Gaussian distribution

The inverse Gaussian (IG) distribution is widely used to model positively skewed data. An important issue is to develop a powerful goodness-of-fit test for the IG distribution. We propose and examine novel test statistics for testing the IG goodness of fit based on the density-based empirical likelihood (EL) ratio concept. To construct the test statistics, we use a new approach that employs a method of the minimization of the discrimination information loss estimator to minimize Kullback–Leibler type information. The proposed tests are shown to be consistent against wide classes of alternatives. We show that the density-based EL ratio tests are more powerful than the corresponding classical goodness-of-fit tests. The practical efficiency of the tests is illustrated by using real data examples.     

Moments of nonparametric probability density functions of entropy estimators applied to testing the inverse Gaussian distribution

The inverse Gaussian (IG) distribution is widely used to model data and then it is important to develop efficient goodness of fit tests for this distribution. In this article, we introduce some new test statistics for examining the IG goodness of fit based on correcting moments of nonparametric probability density functions of entropy estimators. These tests are consistent against all alternatives. Critical points and power of the tests are explored by simulation. We show that the proposed tests are more powerful than competitor tests. Finally, the proposed tests are illustrated by real data examples.     

An Influence Function Approach to Describing the Skewness of a Distribution

Skewness, like kurtosis, is a qualitative property of a distribution. A comparison of several measures of skewness of univariate distributions is carried out. Hampel's influence function is used to clarify the differences and similarities among these measures. A general concept of skewness as a location- and scale-free deformation of the probability mass of a symmetric distribution emerges. Positive skewness can be thought of as resulting from movement of mass at the right of the median from the center to the right tail of the distribution together with movement of mass at the left of the median from the left tail to the center of the distribution.     

An improvement of a monte carlo technique using asymptotic moments with an application to the likelihood ratio statistic

The use of asymptotic moments to increase the precision of the control variate technique for Monte Carlo estimation is dis­cussed. An application is made to the estimation of the mean and variance of the likelihood ratio goodness–of–fit statistic with the Pearson statistic used as a control variate. Estimates of the variance reductions are given.     

An application of a minimax Bayes rule and shrinkage estimators to the portofolio selection problem under the Bayesian approach

This paper shows that a minimax Bayes rule and shrinkage estimators can be effectively applied to portfolio selection under the Bayesian approach. Specifically, it is shown that the portfolio selection problem can result in a statistical decision problem in some situations. Following that, we present a method for solving a problem involved in portfolio selection under the Bayesian approach.