We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
The Luria–Delbrück distribution arises in birth-and-mutation processes in population genetics that have been systematically studied for the last fifty years. The central result reported in this paper is a new recursion relation for computing this distribution which supersedes all past results in simplicity and computational efficiency: p0 = e–m; where m is the expected number of mutations. A new relation for the asymptotic behavior of pn (≈ c/n2) is also derived. This corresponds to the probability of finding a very large number of mutants. A formula for the z-transform of the distribution is also reported.
We give a finite form for the probability mass function of the wrapped Poisson distribution, together with a probabilistic proof. We also describe briefly its connection with existing results.
We present some monotonicity and convexity properties for the sequence of partial sums associated with a sequence of non-negative independent identically distributed random variables. These results are applied to a system of parallel queues with Bernoulli routing, and are useful in establishing a performance comparison between two scheduling strategies in multiprocessor systems.
The class of subexponential distributions S is characterized by F(0) = 0, 1 − F(2)(x) ~ 2(1 − F(x)) as x → ∞. In this paper we consider a subclass of S for which the relation 1 − F(2)(x) − 2(1 − F(x)) + (1 − F(x))2 = o(a(x)) as x → ∞ holds, where α is a positive function satisfying α(X) = 0(1 − F(x)) (x → ∞).
Generalizing known results for special examples, we derive a Khintchine type decomposition of probability measures on symmetric hypergroups. This result is based on a triangular central limit theorem and a discussion of conditions ensuring that the set of all factors of a probability measure is weakly compact. By our main result, a probability measure satisfying certain restrictions can be written as a product of indecomposable factors and a factor in I0(K), the set of all measures having decomposable factors only. Some contributions to the classification of I0(K) are given for general symmetric hypergroups and applied to several families of examples like finite symmetric hypergroups and hypergroup joins. Furthermore, all results are discussed in detail for a class of discrete symmetric hypergroups which are generated by infinitely many joins, for a class of countable compact hypergroups, for Sturm-Liouville hypergroups on [0, ∞[ and, finally, for polynomial hypergroups.
We study negative definite functions on a Hilbert space and use their properties to give a proof of the Lévy-Khinchin formula for an infinitely divisible probability distribution on .
Distribution tails F(t) = F(t, ∞) are considered for which and as t → ∞. A real analytic proof is obtained of a theorem by Chover, Wainger and Ney, namely that .
In doing so, a technique is introduced which provides many other results with a minimum of analysis. One such result strengthens and generalizes the various known results on distribution tails of random sums.
Additionally, the closure and factorization properties for subexponential distributions are investigated further and extended to distributions with exponential tails.
A churning transformation can be defined on probability measures by an infinite sequence of finite permutations of mass. Continuity and absolute continuity of measures are invariants for such transformations but it is shown that certain probability measures whose Fourier-Stieltjes transforms fail to vanish at infinity may be churned into measures whose transforms do vanish in this sense.
A simple technique for obtaining bounds in terms of means and variances for the expectations of certain functions of random variables in a given class is examined. The bounds given are sharp in the sense that they are attainable by at least one random variable in the class. This technique is applied to obtain bounds for moment generating functions, the coefficient of skewness and parameters associated with branching processes. In particular an improved lower bound for the Malthusian parameter in an age-dependent branching process is derived.
Characterisations of the distribution of a non-negative random variable are sought for which the Liapunov moment inequality is extended to give inequalities between inverse powers of moment ratios, which are known as mean sizes in considerations of particle size distributions. A solution is found for continuous distributions, and the conditions applied to a number of well-known distributions. A further class of distributions is considered for which the new inequalities hold but the inequality direction is reversed for some orders of the moments. The study involves examination of the signs of the third central moments of a family of distributions, obtained by a log transformation, from the weighted, or moment, distributions induced by the non-negative random variable.
The aim of this paper is to show that some of the known properties of distributions in the domain of attraction of a stable law have counterparts for distributions which are stochastically compact in the sense of Feller. This enables us to unify the ideas of Feller and Doeblin, who first studied the concept of stochastic compactness, and give new characterizations of stochastic compactness and the domain of attraction of the normal distribution.
For a distribution function F on [0, ∞] we say F ∈ if {1 – F(2)(x)}/{1 – F(x)}→2 as x→∞, and F∈, if for some fixed γ > 0, and for each real , limx→∞ {1 – F(x + y)}/{1 – F(x)} ═ e– n. Sufficient conditions are given for the statement F ∈ F * G ∈ and when both F and G are in y it is proved that F*G∈pF + 1(1 – p) G ∈ for some (all) p ∈(0,1). The related classes ℒt are proved closed under convolutions, which implies the closure of the class of positive random variables with regularly varying tails under multiplication (of random variables). An example is given that shows to be a proper subclass of ℒ 0.
A recent result of Rogozin on the relative stability of a distribution function is extended, by giving equivalences for relative stability in terms of truncated moments of the distribution and in terms of the real and imaginary parts of the characteristic function. As an application, the known results on centering distributions in the domain of attraction of a stable law are extended to the case of stochastically compact distributions.