Estimation and simulation of conditional hazard function in the quasi-associated framework when the observations are linked via a functional single-index structure

We consider the estimation of the conditional hazard function of a scalar response variable Y given a Hilbertian random variable X when the observations are linked via a single-index structure in the quasi-associated framework. We establish the pointwise almost complete convergence and the uniform almost complete convergence (with the rate) of the estimate of this model. A simulation is given to illustrate the good behavior in the practice of our methodology.     

Conditional Akaike Information Criteria for a Class of Poisson Mixture Models with Random Effects

Focusing on the model selection problems in the family of Poisson mixture models (including the Poisson mixture regression model with random effects and zero‐inflated Poisson regression model with random effects), the current paper derives two conditional Akaike information criteria. The criteria are the unbiased estimators of the conditional Akaike information based on the conditional log‐likelihood and the conditional Akaike information based on the joint log‐likelihood, respectively. The derivation is free from the specific parametric assumptions about the conditional mean of the true data‐generating model and applies to different types of estimation methods. Additionally, the derivation is not based on the asymptotic argument. Simulations show that the proposed criteria have promising estimation accuracy. In addition, it is found that the criterion based on the conditional log‐likelihood demonstrates good model selection performance under different scenarios. Two sets of real data are used to illustrate the proposed method.     

Sum,product and ratio of Pareto and gamma variables

The exact distributions of X+Y, X Y and X/(X+Y) are studied when X and Y are independent Pareto and gamma random variables. Applications are discussed, to real problems in clinical trials, computer networks and economics.     

Simulating random variables using moment-generating functions and the saddlepoint approximation

When we are given only a transform such as the moment-generating function of a distribution, it is rare that we can efficiently simulate random variables. Possible approaches such as the inverse transform using numerical inversion of the transform are computationally very expensive. However, the saddlepoint approximation is known to be exact for the Normal, Gamma, and inverse Gaussian distribution and remarkably accurate for a large number of others. We explore the efficient use of the saddlepoint approximation for simulating distributions and provide three examples of the accuracy of these simulations.     

Decomposition of Variance for Spatial Cox Processes

Abstract. Spatial Cox point processes is a natural framework for quantifying the various sources of variation governing the spatial distribution of rain forest trees. We introduce a general criterion for variance decomposition for spatial Cox processes and apply it to specific Cox process models with additive or log linear random intensity functions. We moreover consider a new and flexible class of pair correlation function models given in terms of normal variance mixture covariance functions. The proposed methodology is applied to point pattern data sets of locations of tropical rain forest trees.     

Cumulants of random sum distributions

Consider a random variable S being the sum of a number N of independent and identically distributed random variables X_j (j = 1, 2, ...) where the number N is itself a non-negative integer-valued random variable independent of the X_j An explicit expression of the r-th cumulant of S is given in terms of the cumulants of N and X_j, Asymptotic properties of the distribution of S are also discussed.     

A class of integral operators generated by random variables

H. Kres Statistisehe Tafeln zur multlvariaten Analysis. Springer-Verlag, Berlin- Heidel-berg-New York 1975, XVIII, 431 S., 26 Tab., DM 48.

D. Rasch: Einführung in die mathematische Statistik - WahrscheinUcllkeitsrechnung und Grundlagen der mathematlsehan Statistlk. VEB Deutscher Verlag delr Wissenschaften, Berlin 1976, 371 S., 37 Abb., 46 'I'ab., 40,– M.

D. Rasch: Einführung in die muthematisehe Statlstik - II .Anweuduugen, VEB Deutscher Verlag der Wissenschaften, Berlin 1976.

Donald L. Snyder: Random Point Processes. -JohnWiley &; Sons, New York 1975,485 S.     

A strong law of large numbers for independent random variables under non-additive probabilities

Abstract

Under non‐additive probabilities, cluster points of the empirical average have been proved to quasi-surely fall into the interval constructed by either the lower and upper expectations or the lower and upper Choquet expectations. In this paper, based on the initiated notion of independence, we obtain a different Marcinkiewicz-Zygmund type strong law of large numbers. Then the Kolmogorov type strong law of large numbers can be derived from it directly, stating that the closed interval between the lower and upper expectations is the smallest one that covers cluster points of the empirical average quasi-surely.     

Throughput and delay analysis of an opportunistic tree algorithm

Tree algorithms are a well-known class of random access algorithms with a provable maximum stable throughput under the infinite population model (as opposed to ALOHA or the binary exponential backoff algorithm). In this article, we propose a tree algorithm for opportunistic spectrum usage in cognitive radio networks. A channel in such a network is shared among so-called primary and secondary users, where the secondary users are allowed to use the channel only if there is no primary user activity. The tree algorithm designed in this article can be used by the secondary users to share the channel capacity left by the primary users.

We analyze the maximum stable throughput and mean packet delay of the secondary users by developing a tree structured Quasi-Birth Death Markov chain under the assumption that the primary user activity can be modeled by means of a finite state Markov chain and that packets lengths follow a discrete phase-type distribution.

Numerical experiments provide insight on the effect of various system parameters and indicate that the proposed algorithm is able to make good use of the bandwidth left by the primary users.