A Comparison of Survival Function Estimators in the Koziol–Green Model

In this paper, three competing survival function estimators are compared under the assumptions of the so-called Koziol– Green model, which is a simple model of informative random censoring. It is shown that the model specific estimators of Ebrahimi and Abdushukurov, Cheng, and Lin are asymptotically equivalent. Further, exact expressions for the (noncentral) moments of these estimators are given, and their biases are analytically compared with the bias of the familiar Kaplan–Meier estimator. Finally, MSE comparisons of the three estimators are given for some selected rates of censoring.     

Serials Clutter in Online Catalogs

Abstract

Finding and deciphering serials records in online catalogs is a challenge to many library users. To understand and analyze these challenges, the author conducted searches for scientific journal titles in the online catalogs of Committee on Institutional Cooperation (CIC) libraries. The first part of the study measures the difficulty of retrieving serial records from online catalogs comparing one-word versus multiple-word titles. The second part analyzes displays for complexity by measuring the length of the complete record and the length of the holdings statements. These data show the complexity of displays and indicate the potential confusion that these displays may induce in library users.     

The modified permutation entropy-based independence test of time series

Abstract

In time series, it is essential to check the independence of data by means of a proper method or an appropriate statistical test before any further analysis. Therefore, among different independence tests, a powerful and productive test has been introduced by Matilla-García and Marín via m-dimensional vectorial process, in which the value of the process at time t includes m-histories of the primary process. However, this method causes a dependency for the vectors even when the independence assumption of random variables is considered. Considering this dependency, a modified test is obtained in this article through presenting a new asymptotic distribution based on weighted chi-square random variables. Also, some other alterations to the test have been made via bootstrap method and by controlling the overlap. Compared with the primary test, it is obtained that not only the modified test is more accurate but also, it possesses higher power.     

LOG-PERIODOGRAM ESTIMATION OF LONG MEMORY VOLATILITY DEPENDENCIES WITH CONDITIONALLY HEAVY TAILED RETURNS

ABSTRACT

Many recent papers have used semiparametric methods, especially the log-periodogram regression, to detect and estimate long memory in the volatility of asset returns. In these papers, the volatility is proxied by measures such as squared, log-squared, and absolute returns. While the evidence for the existence of long memory is strong using any of these measures, the actual long memory parameter estimates can be sensitive to which measure is used. In Monte-Carlo simulations, I find that if the data is conditionally leptokurtic, the log-periodogram regression estimator using squared returns has a large downward bias, which is avoided by using other volatility measures. In United States stock return data, I find that squared returns give much lower estimates of the long memory parameter than the alternative volatility measures, which is consistent with the simulation results. I conclude that researchers should avoid using the squared returns in the semiparametric estimation of long memory volatility dependencies.     

Approximating M/G/1 Waiting Time Tail Probabilities

Abstract

We propose a new approximation formula for the waiting time tail probability of the M/G/1 queue with FIFO discipline and unlimited waiting space. The aim is to address the difficulty of obtaining good estimates when the tail probability has non-exponential asymptotics. We show that the waiting time tail probability can be expressed in terms of the waiting time tail probability of a notional M/G/1 queue with truncated service time distribution plus the tail probability of an extreme order statistic. The Cramér–Lundberg approximation is applied to approximate the tail probability of the notional queue. In essence, our technique extends the applicability of the Cramér–Lundberg approximation to cases where the standard Lundberg condition does not hold. We propose a simple moment-based technique for estimating the parameters of the approximation; numerical results demonstrate that our approximation can yield very good estimates over the whole range of the argument.     

Workload Process,Waiting Times,and Sojourn Times in a Discrete Time MMAP[K]/SM[K]/1/FCFS Queue

Abstract

In this paper, we study the total workload process and waiting times in a queueing system with multiple types of customers and a first-come-first-served service discipline. An M/G/1 type Markov chain, which is closely related to the total workload in the queueing system, is constructed. A method is developed for computing the steady state distribution of that Markov chain. Using that steady state distribution, the distributions of total workload, batch waiting times, and waiting times of individual types of customers are obtained. Compared to the GI/M/1 and QBD approaches for waiting times and sojourn times in discrete time queues, the dimension of the matrix blocks involved in the M/G/1 approach can be significantly smaller.     

On L 1-consistency of kernel-type density estimator for stationary markov processes

A convergence result for kernel type density estimators, proved by Devroye and Gyrofi (1985), is extended to stationary Markov processess satisfying (G ₂-condition introduced by Rosenblatt (1970).     

Forward irrelevance

We investigate how to combine marginal assessments about the values that random variables assume separately into a model for the values that they assume jointly, when (i) these marginal assessments are modelled by means of coherent lower previsions and (ii) we have the additional assumption that the random variables are forward epistemically irrelevant to each other. We consider and provide arguments for two possible combinations, namely the forward irrelevant natural extension and the forward irrelevant product, and we study the relationships between them. Our treatment also uncovers an interesting connection between the behavioural theory of coherent lower previsions, and Shafer and Vovk's game-theoretic approach to probability theory.     

Characterizations based on order statistics under sampling without replacement

In this paper, we consider finite populations and investigate their characterizations by regressions of order statistics under sampling without replacement. We also investigate some asymptotic results when the size of the population goes to infinity.