Normal approximation for call function via Stein’s method

A Collateralized dept Obligation (CDO) is a cause of the Hamburger crisis in the USA. We use call function for pricing the CDO. In this paper, we first give uniform and non uniform bounds on normal approximation for the call function without correction term. In this part, we assume that the third and fourth moments of random variables exist, respectively. Second, we present uniform and non uniform bounds on normal approximation for the call function with a correction term under the assumption that the sixth moments of random variables is finite. Our techniques are Stein’s method and the zero bias transformation.     

On the Alias Method for Generating Random Variables from a Discrete Distribution

The alias method of Walker is a clever, new, fast method for generating random variables from an arbitrary, specified discrete distribution. A simple probabilistic proof is given, in terms of mixtures, that the method works for any discrete distribution with a finite number of outcomes. A more efficient version of the table-generating portion of the method is described. Finally, a brief discussion on efficiency of the method is given. We believe that the generality, speed, and simplicity of the method make it attractive for use in generating discrete random variables.     

Performance analysis of the retrial queues with finite number of sources and service interruptions

This paper aims at presenting an analytic approach for investigating a single-server retrial queue with finite population of customers where the server is subject to interruptions. A free source may generate a primary call to request service. If the server is free upon arrival, the call starts to be served and the service times are independent, generally distributed random variables. During the service time the source cannot generate a new primary call. After service the source moves into the free state and can generate a new primary call. There is no waiting space in front of the server, and a call who finds the server unavailable upon arrival joins an orbit of unsatisfied customers. The server is subject to interruptions during the service processes. When the server is interrupted, the call being served just before server interruption goes to the retrial orbit and will retry its luck after a random amount of time until it finds the server available. The recovery times of the interrupted server are assumed to be generally distributed. Our analysis extends previous work on this topic and includes the analysis of the arriving customer’s distribution, the busy period, and the waiting time process.     

Robust generalized confidence intervals

Most interval estimates are derived from computable conditional distributions conditional on the data. In this article, we call the random variables having such conditional distributions confidence distribution variables and define their finite-sample breakdown values. Based on this, the definition of breakdown value of confidence intervals is introduced, which covers the breakdowns in both the coverage probability and interval length. High-breakdown confidence intervals are constructed by the structural method in location-scale families. Simulation results are presented to compare the traditional confidence intervals and their robust analogues.     

STRATEGY, NONTRANSITIVE DOMINANCE AND THE EXPONENTIAL DISTRIBUTION

An easily programmed recursive formula for the evaluation of the distribution function of ratios of linear combinations of independent exponential random variables is developed. This formula is shown to yield the probability that one team beats another in a contest we call the special gladiator game. This game generates tournaments which exhibit nontransitive dominance and have some surprising consequences. Similar results are obtained for a recursive formula based on the geometric distribution.     

Generalized additive models for location, scale and shape

Summary.  A general class of statistical models for a univariate response variable is presented which we call the generalized additive model for location, scale and shape (GAMLSS). The model assumes independent observations of the response variable y given the parameters, the explanatory variables and the values of the random effects. The distribution for the response variable in the GAMLSS can be selected from a very general family of distributions including highly skew or kurtotic continuous and discrete distributions. The systematic part of the model is expanded to allow modelling not only of the mean (or location) but also of the other parameters of the distribution of y , as parametric and/or additive nonparametric (smooth) functions of explanatory variables and/or random-effects terms. Maximum (penalized) likelihood estimation is used to fit the (non)parametric models. A Newton–Raphson or Fisher scoring algorithm is used to maximize the (penalized) likelihood. The additive terms in the model are fitted by using a backfitting algorithm. Censored data are easily incorporated into the framework. Five data sets from different fields of application are analysed to emphasize the generality of the GAMLSS class of models.     

Large deviation local limit theorems for ratio statistics

Let {T_n, n ≥ 1} be an arbitrary sequence of nonlattice random variables and let {S_n, n ≥ 1} be another sequence of positive random variables. Assume that the sequences are independent. In this paper we obtain asymptotic expression for the density function of the ratio statistic R_n = T_n/S_n based on simple conditions on the moment generating functions of T_n and S_n. When S_n = re, our main result reduces to that of Chaganty and Sethura-man[Ann. Probab. 13(1985):97-114]. We also obtain analogous results when T_n and S_n are both lattice random variables. We call our theorems large deviation local limit theorems for R_n, since the conditions of our theorems imply that R_n → c in probability for some constant c. We present some examples to illustrate our theorems.     

Information geodesics for gamma models of communication clustering

Recently, Akyildiz called for further work on non-Poisson models for communication arrivals in distributed networks such as cellular phone systems. The basic ‘random’ model for stochastic events is the Poisson process; for events on a line this resuits in an exponential disiribuuon of intervals between events. Network designers and managers need too monotor and quantify call clustering in order to optimize resaurce usage; the natural reference state from which to measure departures is that arising from a Poisson, process of calls. Here we consider gamma distributions, which contain exponential distributions as a special case. The surface representing gamma models has a natural Riemannian information metric and we obtain some geodesic sprays for this metric. The exponential distributions form a 1-dimensional subspace of the 2-dimensional space of all gamma distributions, so we have an isometric embedding of the random model as a subspace of the gamma models. This geometry may provide an appropriate structure on which to represent clustering as quantifiable departures from randomness and on which to impose dynamic control algorithms to optimize traffic at receiving nodes in distributed communication networks. In practice, we may expect correlation between call arrival times and call duration, reflecting for example peaks of different users of internet services. This would give rise to a twisted product of two surfaces with the twisting controlled by the correlation. Though bivariate gamma models do exist, such as Kibble's, none has tractabie information geometry nor sufficiently general marginal gammas,but a simulation method of approach is suggested.     

Universal methods for generating random variables with a given characteristic function

Universal generators for absolutely-continuous and integer-valued random variables are introduced. The proposal is based on a generalization of the rejection technique proposed by Devroye [The computer generation of random variables with a given characteristic function. Computers and Mathematics with Applications. 1981;7:547–552]. The method involves a dominating function solely requiring the evaluation of integrals which depend on the characteristic function of the underlying random variable. The proposal gives rise to simple algorithms which may be implemented in a few code lines and which may show noticeable performance even if some classical families of distributions are considered.     

Calculating Bivariate Orthonormal Polynomials By Recurrence

Emerson gave recurrence formulae for the calculation of orthonormal polynomials for univariate discrete random variables. He claimed that as these were based on the Christoffel–Darboux recurrence relation they were more efficient than those based on the Gram–Schmidt method. This approach was generalised by Rayner and colleagues to arbitrary univariate random variables. The only constraint was that the expectations needed are well‐defined. Here the approach is extended to arbitrary bivariate random variables for which the expectations needed are well‐defined. The extension to multivariate random variables is clear.     

A characterization of probability distributions similar to the exponential

A concept of the lack-of-memory property at a given time point c > 0 is introduced. It is equivalent to the concept of the almost-lack-of-memory (ALM) property of the random variables. A representation theorem is given for the cumulative distribution function of such random variables as well as for corresponding decompositions in terms of independent random variables. It is shown that a periodic failure rate for a random variable is equivalent to the ALM property. In addition some properties of the service time of an unreliable server are observed.     

Limit theory of bivariate dual generalized order statistics with random index

The class of limit distribution functions of bivariate extreme, intermediate and central dual generalized order statistics from independent and identically distributed random variables with random sample size is fully characterized. Two cases are considered. The first case is when the random sample size is assumed to be independent of all basic random variables. The second case is when the interrelation of the random size and the basic random variables is not restricted.     

The gamma-exponentiated exponential distribution

In this paper, we introduce a new distribution generated by gamma random variables. We show that this distribution includes as a special case the distribution of the lower record value from a sequence of i.i.d. random variables from a population with the exponentiated (generalized) exponential distribution. The properties of this distribution are derived and the estimation of the model parameters is discussed. Some applications to real data sets are finally presented for illustration.     

Complete convergence for weighted sums of extended negatively dependent random variables

In this article, the complete convergence for weighted sums of extended negatively dependent (END, in short) random variables without identical distribution is investigated. In addition, the complete moment convergence for weighted sums of END random variables is also obtained. As an application, the Baum–Katz type result for END random variables is established. The results obtained in the article extend the corresponding ones for independent random variables and some dependent random variables.     

Computational procedures for deriving sampling distributions of attribute-contaminated random variables

Statistical distributions generated from any J- or U-shaped random variables are cumbersome to derive if not completely indefinable and thus are unavailable analytically because of the singularities at the tails of the basic random variable. This paper presents a computational method for providing a numerical convolution derived from a basic U-shaped random variable composed of a continuous part mixed with (or contaminated by) a discrete part at the tails. The J-shaped sampling distribution case is implied as a special case. Though the computations are based on a background Normal Distribution, it can be generalized on any other distribution.Such distributions will open up an area of sampling distributions of mixed random variables that are not elaborately covered in textbooks dealing with the theory of distributions.     

Optimal Hoeffding-like inequalities under a symmetry assumption

In this paper, we prove a Hoeffding-like inequality for the survival function of a sum of symmetric independent identically distributed random variables, taking values in a segment [?b, b] of the reals. The symmetric case is relevant to the auditing practice and is an important case study for further investigations. The bounds as given by Hoeffding in 1963 cannot be improved upon unless we restrict the class of random variables, for instance, by assuming the law of the random variables to be symmetric with respect to their mean, which we may assume to be zero. The main result in this paper is an improvement of the Hoeffding bound for i.i.d. random variables which are bounded and have a (upper bound for the) variance by further assuming that they have a symmetric law.     

A central limit theorem for correlated variables with limited normal or gamma distributions

Abstract

Non-negative limited normal or gamma distributed random variables are commonly used to model physical phenomenon such as the concentration of compounds within gaseous clouds. This paper demonstrates that when a collection of random variables with limited normal or gamma distributions represents a stationary process for which the underlying variables have exponentially decreasing correlations, then a central limit theorem applies to the correlated random variables.     

Asymptotics for Tail Probability of Random Sums with a Heavy-Tailed Number and Dependent Increments

This article obtains the asymptotics for the tail probability of random sums, where the random number and the increments are all heavy tailed, and the increments follow a certain wide dependence structure. This dependence structure can contain some commonly used negatively dependent random variables as well as some positively dependent random variables.     

Tables of cumulative distribution functions and percentiles of the standardized stable random variables

It is shown that Zolotarev's (1964) integral representation of the cumulative distribution function (c.d.f.) of stable random variables and the IMSL subroutine DCADRE (for numerical integration ) provide a natural and practically simple method for finding the values of c.d.f., the percentiles and the density function of such random variables. For symmetric stable random variables (r.v.'s ) Z_∝, values of P_∝(z) … P(0<Z_∝<z) for z … 0(.02)4.08 and ∝=.1(.2)1.9, as well as percentiles of these r.v.'s for ∝=.5(.1)2 and the percentage points .6, .7(.05).85(.025).9(.01).96(.005).995, are presented. For asymmetric stable r.v.'s we present values of their c.d.f.'s for z … 0(.1)4, ß= ?1(.25)1 and ∝=.1(.2)1.9. These result sare compared with related results of others which were obtained by using different procedure and standardization.     

Phase Type Distributions with Finite Support

This research is motivated by the fact that many random variables of practical interest have a finite support. For fixed a < b, we consider the distribution of a random variable X = (a + Ymod(b ? a)), where Y is a phase type (PH) random variable. We demonstrate that as we traverse for Y the entire set of PH distributions (or even any subset thereof like Coxian that is dense in the class of distributions on [0, ∞)), we obtain a class of matrix exponential distributions dense in (a, b). We call these Finite Support Phase Type Distributions (FSPH) of the first kind. A simple example shows that though dense, this class by itself is not very efficient for modeling; therefore, we introduce (and derive the EM algorithms for) two other classes of finite support phase type distributions (FSPH). The properties of denseness, connection to Markov chains, the EM algorithm, and ability to exploit matrix-based computations should all make these classes of distributions attractive not only for applied probability but also for a much wider variety of fields using statistical methodologies.