Mixed Graphical Model Selection Using Holm's Procedure

The problem of selecting a graphical model is considered as a performing simultaneously multiple tests. The control of the overall Type I error on the selected graph is done using the so famous Holm's procedure. We prove that when we use a consistent edge exclusion test the selected graph is asymptotically equal to the true graph with probability at least equal to a fixed level 1 ? α. This method is then used for the selection of mixed concentration graph models by performing the χ²-edge exclusion test. We also apply the method to two classical examples and to simulated data. We compare the overall error of the selected model with the one obtained using the stepwise method. We establish that the control is better when we use the Holm's procedure.     

A prior-valued estimator applied to multinomial classification

A multinomial classification rule is proposed based on a prior-valued smoothing for the state probabilities. Asymptotically, the proposed rule has an error rate that converges uniformly and strongly to that of the Bayes rule. For a fixed sample size the prior-valued smoothing is effective in obtaining reason¬able classifications to the situations such as missing data. Empirically, the proposed rule is compared favorably with other commonly used multinomial classification rules via Monte Carlo sampling experiments     

Bathtub distributions: a review

Bathtub distributions are characterized by bathtub failure rate functions . These are possibly more realisitic models than the monotone failure rate models . A systematic account of such distributions is not available and this review aims to give such an account . We give some easily verifiable conditions to check the bathtub property of a distribution along with methods to construct such distributions . We also discuss some stochastic and reliablity mechanisms which lead to bathtub distributions. These include mixtures ( stochastic failure rate models ) , series system , stochastic differential equation models and so on. We also review inference on bathtub distributions. The paper concludes with a rather exhaustive list of bathtub distributions.     

Order statistics from the linear-exponential distribution,part I: increasing hazard rate case

For the linear-exponential distribution with increasing hazard rate, exact and explicit expressions for means, product moments and percentage points of order statistics are obtained. Some recurrence relations for both single and product moments of order statistics are also derived. These recurrence relations would enable one to obtain all the higher order moments of order statistics for all sample sizes from those of the lower order     

HAZARD RATE ESTIMATION FOR CENSORED DATA BY WAVELET METHODS

ABSTRACT

We study the estimation of a hazard rate function based on censored data by non-linear wavelet method. We provide an asymptotic formula for the mean integrated squared error (MISE) of nonlinear wavelet-based hazard rate estimators under randomly censored data. We show this MISE formula, when the underlying hazard rate function and censoring distribution function are only piecewise smooth, has the same expansion as analogous kernel estimators, a feature not available for the kernel estimators. In addition, we establish an asymptotic normality of the nonlinear wavelet estimator.     

LIMIT THEOREMS FOR ASYMPTOTICALLY MINIMAX ESTIMATION OF A DISTRIBUTION WITH INCREASING FAILURE RATE UNDER A RANDOM MIXED CENSORSHIP/TRUNCATION MODEL

ABSTRACT

The search for optimal non-parametric estimates of the cumulative distribution and hazard functions under order constraints inspired at least two earlier classic papers in mathematical statistics: those of Kiefer and Wolfowitz[1] Kiefer, J. and Wolfowitz, J. 1976. Asymptotically Minimax Estimation of Concave and Convex Distribution Functions. Z. Wahrsch. Verw. Gebiete, 34: 73–85. [Crossref], [Web of Science ®] , [Google Scholar] and Grenander[2] Grenander, U. 1956. On the Theory of Mortality Measurement. Part II. Scand. Aktuarietidskrift J., 39: 125–153.  [Google Scholar] respectively. In both cases, either the greatest convex minorant or the least concave majorant played a fundamental role. Based on Kiefer and Wolfowitz's work, Wang3-4 Wang, J.L. 1986. Asymptotically Minimax Estimators for Distributions with Increasing Failure Rate. Ann. Statist., 14: 1113–1131. Wang, J.L. 1987. Estimators of a Distribution Function with Increasing Failure Rate Average. J. Statist. Plann. Inference, 16: 415–427.   found asymptotically minimax estimates of the distribution function F and its cumulative hazard function Λ in the class of all increasing failure rate (IFR) and all increasing failure rate average (IFRA) distributions. In this paper, we will prove limit theorems which extend Wang's asymptotic results to the mixed censorship/truncation model as well as provide some other relevant results. The methods are illustrated on the Channing House data, originally analysed by Hyde.5-6 Hyde, J. 1977. Testing Survival Under Right Censoring and Left Truncation. Biometrika, 64: 225–230. Hyde, J. 1980. “Survival Analysis with Incomplete Observations”. In Biostatistics Casebook 31–46. New York: Wiley Series in Probability and Mathematical Statistics: Applied Probability and Statistics.       

BAYES EMPIRICAL BAYES APPROACH TO ESTIMATION OF THE FAILURE RATE IN EXPONENTIAL DISTRIBUTION

ABSTRACT

In the empirical Bayes (EB) decision problem consisting of squared error estimation of the failure rate in exponential distribution, a prior Λ is placed on the gamma family of prior distributions to produce Bayes EB estimators which are admissible. A subclass of such estimators is shown to be asymptotically optimal (a.o.). The results of a Monte Carlo study are presented to demonstrate the a.o. property of the Bayes EB estimators.     

SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING

We study sojourn times of customers in a processor sharing queue with a service rate that varies over time, depending on the number of customers and on the state of a random environment. An explicit expression is derived for the Laplace–Stieltjes transform of the sojourn time conditional on the state upon arrival and the amount of work brought into the system. Particular attention is paid to the conditional mean sojourn time of a customer as a function of his required amount of work, and we establish the existence of an asymptote as the amount of work tends to infinity. The method of random time change is then extended to include the possibility of a varying service rate. By means of this method, we explain the well-established proportionality between the conditional mean sojourn time and required amount of work in processor sharing queues without random environment. Based on numerical experiments, we propose an approximation for the conditional mean sojourn time. Although first presented for exponentially distributed service requirements, the analysis is shown to extend to phase-type services. The service discipline of discriminatory processor sharing is also shown to fall within the framework.     

A Retrial Queue with a Constant Retrial Rate,Server Downs and Impatient Customers

ABSTRACT

In this paper, we consider a retrial queueing system consisting of a waiting line of infinite capacity in front of a single server subject to breakdowns. A customer upon arrival may join the queue (waiting line) or go to the retrial orbit (another queue) to retry for service after a random time. Only the customer at the head of the retrial orbit is allowed to retry for service. Upon retrial, the customer enters the service if the server is idle; otherwise, it may go back to the retrial orbit or leave the system (become impatient). All the interarrival times, service times, server up times, server down times and retrial times are exponential, and all the necessary independence conditions in these variables are assumed. For this system, we provide sufficient conditions under which, for any given number of customers in the orbit, the stationary probability of the number of customers in the waiting line decays geometrically. We also provide explicitly an expression for the decay parameter.