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.
A basic theory for probabilistic convergence spaces based on filter convergence is introduced. As in Florescu's previous theory of probabilistic convergence structures based on nets, one is able to assign a probability that a given filter converges to a given point. Various concepts and theorems pertaining to convergence spaces are extended to the realm of probabilistic convergence spaces, and illustrated by means of examples based on convergence in probability and convergence almost everywhere. Diagonal axioms due to Kowalsky and Fischer are also studied, first for convergence spaces and then in the setting of probabilistic convergence spaces.
Probabilistic quasi-metric spaces are introduced and used to define ordered probabilistic metric spaces. The latter spaces arise naturally in the study of probability and statistics; they closely resemble the uniform ordered spaces of L. Nachbin. A procedure is described for constructing ordered probabilistic metric spaces from quasi-simple spaces, and a completions theory is developed simultaneously for probabilistic quasi-metric spaces and ordered probabilistic metric spaces.
In this paper we introduce certain Hankel matrices that can be used to study ME (matrix exponential) distributions, in particular to compute their ME orders. The Hankel matrices for a given ME probability distribution can be constructed if one of the following five types of information about the distribution is available: (i) an ME representation, (ii) its moments, (iii) the derivatives of its distribution function, (iv) its Laplace-Stieltjes transform, or (v) its distribution function. Using the Hankel matrices, a necessary and sufficient condition for a probability distribution to be an ME distribution is found and a method of computing the ME order of the ME distribution developed. Implications for the PH (phase-type) order of PH distributions are examined. The relationship between the ME order, the PH order, and a lower bound on the PH order given by Aldous and Shepp (1987) is discussed in numerical examples.
The accountant Nigrini remarked that in tables of data distributed according to Benford's law, the sum of all elements with first digit d (d = 1, 2,· ··, 9) is approximately constant. In this note, a mathematical formulation of Nigrini's observation is given and it is shown that Benford's law is the unique probability distribution such that the expected sum of all elements with first digits d1, · ··, dk is constant for every fixed k.