首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 468 毫秒
1.
A new class of type G selfdecomposable distributions on ℝ d is introduced and characterized in terms of stochastic integrals with respect to Lévy processes. This class is a strict subclass of the class of type G and selfdecomposable distributions, and in dimension one, it is strictly bigger than the class of variance mixtures of normal distributions by selfdecomposable distributions. The relation to several other known classes of infinitely divisible distributions is established. Research of J. Rosiński supported, in part, by a grant from the National Science Foundation.  相似文献   

2.
Summary The class of discrete distributions of orderk is defined as the class of the generalized discrete distributions with generalizer a discrete distribution truncated at zero and from the right away fromk+1. The probability function and factorial moments of these distributions are expressed in terms of the (right) truncated Bell (partition) polynomials and several special cases are briefly examined. Finally a Poisson process of orderk, leading in particular to the Poisson distribution of orderk, is discussed.  相似文献   

3.
In this paper, we provide numerical means to compute the quasi-stationary (QS) distributions inM/GI/1/K queues with state-dependent arrivals andGI/M/1/K queues with state-dependent services. These queues are described as finite quasi-birth-death processes by approximating the general distributions in terms of phase-type distributions. Then, we reduce the problem of obtaining the QS distribution to determining the Perron-Frobenius eigenvalue of some Hessenberg matrix. Based on these arguments, we develop a numerical algorithm to compute the QS distributions. The doubly-limiting conditional distribution is also obtained by following this approach. Since the results obtained are free of phase-type representations, they are applicable for general distributions. Finally, numerical examples are given to demonstrate the power of our method.  相似文献   

4.
The total number of successes in success runs of length greater than or equal to k in a sequence of n two-state trials is a statistic that has been broadly used in statistics and probability. For Bernoulli trials with k equal to one, this statistic has been shown to have binomial and normal distributions as exact and limiting distributions, respectively. For the case of Markov-dependent two-state trials with k greater than one, its exact and limiting distributions have never been considered in the literature. In this article, the finite Markov chain imbedding technique and the invariance principle are used to obtain, in general, the exact and limiting distributions of this statistic under Markov dependence, respectively. Numerical examples are given to illustrate the theoretical results.  相似文献   

5.
Summary Suppose thatH is a mixture of distributions for a given familyF A necessary and sufficient condition is obtained under whichH is, in fact, a finite mixture. An estimator of the number of distributions constituting the mixture is proposed assuming that the mixture is finite and its asymptotic properties are investigated.  相似文献   

6.
Abstract

An algorithm is presented that, for a large-dimensional exponential family G, finds a lower dimension exponential sub-family of G which contains distributions best fitting groups of identically distributed observations within a set of data. The data are therefore fitted to a family of distributions that has been adaptively chosen as representative of them. The algorithm is implemented in the special case in which G is a logspline family of distributions. An example data set is analyzed using the method.  相似文献   

7.
8.
In this article, some asymptotic formulas of the finite-time ruin probability for a two-dimensional renewal risk model are obtained. In the model, the distributions of two claim amounts belong to the intersection of the long-tailed distributions class and the dominated varying distributions class and the claim arrival-times are extended negatively dependence structures. Assumption that the claim arrivals of two classes are governed by a common renewal counting process. The asymptotic formulas hold uniformly for t ∈ [f(x), ∞), where f(x) is an infinitely increasing function.  相似文献   

9.
In this paper, we propose approximations to compute the steady-state performance measures of the M/GI/N+GI queue receiving Poisson arrivals with N identical servers, and general service and abandonment-time distributions. The approximations are based on scaling a single server M/GI/1+GI queue. For problems involving deterministic and exponential abandon times distributions, we suggest a practical way to compute the waiting time distributions and their moments using the Laplace transform of the workload density function. Our first contribution is numerically computing the workload density function in the M/GI/1+GI queue when the abandon times follow general distributions different from the deterministic and exponential distributions. Then we compute the waiting time distributions and their moments. Next, we scale-up the M/GI/1+GI queue giving rise to our approximations to capture the behavior of the multi-server system. We conduct extensive numerical experiments to test the speed and performance of the approximations, which prove the accuracy of their predictions.   相似文献   

10.
The paper deals with a method of calculation of distributions for functionals of bridges of a process which is a generalization of a diffusion with jumps. The approach to calculation of distributions for integral functionals of bridges is the same as for the diffusion itself. This approach is based on calculation of the Laplace transform of distributions of the integral functionals. Bibliography: 4 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 341, 2007, pp. 34–47.  相似文献   

11.
Yves Dallery 《Queueing Systems》1994,15(1-4):199-209
Failures of machines have a significant effect on the behavior of manufacturing systems. As a result it is important to model this phenomenon. Many queueing models of manufacturing systems do incorporate the unreliability of the machines. Most models assume that the times to failure and the times to repair of each machine are exponentially distributed (or geometrically distributed in the case of discrete-time models). However, exponential distributions do not always accurately represent actual distributions encountered in real manufacturing systems. In this paper, we propose to model failure and repair time distributions bygeneralized exponential (GE) distributions (orgeneralized geometric distributions in the case of a discretetime model). The GE distribution can be used to approximate distributions with any coefficient of variation greater than one. The main contribution of the paper is to show that queueing models in which failure and repair times are represented by GE distributions can be analyzed with the same complexity as if these distributions were exponential. Indeed, we show that failures and repair times represented by GE distributions can (under certain assumptions) be equivalently represented by exponential distributions.This work was performed while the author was visiting the Laboratory for Manufacturing and Productivity, Massachusetts Institute of Technology, Cambridge, MA 02139, USA.  相似文献   

12.
Summary This paper gives some results on calculation of probabilities and moments of the discrete distributions of orderk. Further, a new distribution of orderk, which is called the logarithmic series distribution of orderk, is investigated. Finally, we discuss the meaning of theorder of the distributions. The Institute of Statistical Mathematics  相似文献   

13.
An estimator of the number of components of a finite mixture ofk-dimensional distributions is given on the basis of a one-dimensional independent random sample obtained by a transformation of ak-dimensional independent random sample. A consistency of the estimator is shown. Some simulation results are given in a case of finite mixtures of two-dimensional normal distributions.  相似文献   

14.
The existence of sparse pseudorandom distributions is proved. These are probability distributions concentrated in a very small set of strings, yet it is infeasible for any polynomial-time algorithm to distinguish between truly random coins and coins selected according to these distributions. It is shown that such distributions can be generated by (nonpolynomial) probabilistic algorithms, while probabilistic polynomial-time algorithms cannot even approximate all the pseudorandom distributions. Moreover, we show the existence of evasive pseudorandom distributions which are not only sparse, but also have the property that no polynomial-time algorithm may find an element in their support, except for a negligible probability. All these results are proved independently of any intractability assumption.  相似文献   

15.
Characterization of a Marshall-Olkin type class of distributions   总被引:1,自引:0,他引:1  
Summary A class of bivariate distributions that generalize Marshall-Olkin's one is characterized through a functional equation which involves two associative operations. The obtained distributions concentrate positive mass on the linex=y when the two associative operations coincide; otherwise a positive mass is concentrated on a continuous monotone function. Work performed while the authors were members of CNR-GNAFA.  相似文献   

16.
For two equivalent Gaussian weak distributions, we study the problem of existence of a Hilbert support with continuous likelihood ratio for these distributions. Bibliography: 2 titles.__________Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 298, 2003, pp. 155–160.  相似文献   

17.
The purpose of this paper is to study geometric infinite divisibility and geometric stability of distributions with support in Z + and R +. Several new characterizations are obtained. We prove in particular that compound-geometric (resp. compound-exponential) distributions form the class of geometrically infinitely divisible distributions on Z + (resp. R +). These distributions are shown to arise as the only solutions to a stability equation. We also establish that the Mittag-Leffler distributions characterize geometric stability. Related stationary autoregressive processes of order one (AR(1)) are constructed. Importantly, we will use Poisson mixtures to deduce results for distributions on R + from those for their Z +-counterparts.  相似文献   

18.
In this paper we first obtain, in a unified way, closed-form analytic expressions in terms of roots of the so-called characteristic equation (c.e.), and then discuss the exact numerical solutions of steady-state distributions of (i) actual queueing time, (ii) virtual queueing time, (iii) actual idle time, and (iv) interdeparture time for the queueGI/R/1, whereR denotes the class of distributions whose Laplace-Stieltjes transforms (LSTs) are rational functions (ratios of a polynomial of degree at mostn to a polynomial of degreen). For the purpose of numerical discussions of idle- and interdeparture-time distributions, the interarrival-time distribution is also taken to belong to the classR. It is also shown that numerical computations of the idle-time distribution ofR/G/1 queues can be done even ifG is not taken asR. Throughout the discussions it is assumed that the queue discipline is first-come-first-served (FCFS). For the tail of the actual queueing-time distribution ofGI/R/1, approximations in terms of one or more roots of the c.e. are also discussed. If more than one root is used, they are taken in ascending order of magnitude. Numerical aspects have been tested for a variety of complex interarrival- and service-time distributions. The analysis is not restricted to generalized distributions with phases such as Coxian-n (C n ), but also covers nonphase type distributions such as uniform (U) and deterministic (D). Some numerical results are also presented in the form of tables and figures. It is expected that the results obtained from the present study should prove to be useful not only to practitioners, but also to queueing theorists who would like to test the accuracies of inequalities, bounds or approximations.  相似文献   

19.
Summary The Bayes method is seldom applied to nonparametric statistical problems, for the reason that it is hard to find mathematically tractable prior distributions on a set of probability measures. However, it is found that the Dirichlet process generates randomly a family of probability distributions which can be taken as a family of prior distributions for an application of the Bayes method to such problems. This paper presents a Bayesian analysis of a nonparametric problem of selecting a distribution with the largestpth quantile value, fromk≧2 given distributions. It is assumed a priori that the given distributions have been generated from a Dirichlet process. This work was supported by the U.S. Office of Naval Research under Contract No. 00014-75-C-0451.  相似文献   

20.
A general theorem on the limiting distribution of the generalizedt-distribution is obtained, many applications of this theorem to some subclasses of elliptically contoured distributions including multivariate normal and multivariatet distributions are discussed. Further, their limiting distributions by density function are derived.This project is supported by the National Natural Science Foundation of China and by Grant DA01070 from U.S. Public Health Service.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号