On the calculation of steady-state loss probabilities in the queue.
On the central limit problem for processes of zero entropy
On the central limit theorem for some birth and death processes
Suppose that {Xn, n ≥ 0} is a stationary Markov chain and V is a certain function on a phase space of the chain, called an observable. We say that the observable satisfies the central limit theorem (CLT) if [...] [...] converge in law to a normal random variable, as N → +∞. For a stationary Markov chain with the L2 spectral gap the theorem holds for all V such that V (X0) is centered and square integrable, see Gordin [7]. The purpose of this article is to characterize a family of observables V for...
On the central limit theorem in Hilbert space.
The object of this paper is to prove a central limit theorem in (separable) Hilbert space using a method based on the so called découpage de Lévy, the Lindeberg proof for the Gaussian case and an elementary proof of Poisson convergence for the direct part, and on elementary probabilistic inequalities for the converse. In particular, characteristic functions are only used in unicity questions. Several results of Varadhan (1962) can be obtained either directly as corollaries of the main theorem or...
On the central limit theorem on IFS-events.
A probability theory on IFS-events has been constructed in [3], and axiomatically characterized in [4]. Here using a general system of axioms it is shown that any probability on IFS-events can be decomposed onto two probabilities on a Lukasiewicz tribe, hence some known results from [5], [6] can be used also for IFS-sets. As an application of the approach a variant of Central limit theorem is presented.
On the characteristic function of a sum of m-dependent random variables.
On the characterization of isotropic Gaussian fields on homogeneous spaces of compact groups.
On the Chung-Diaconis-Graham random process.
On the Class of ...Semigroups of Probability Distribution Functions.
On the classification of Markov chains via occupation measures
We consider a Markov chain on a locally compact separable metric space and with a unique invariant probability. We show that such a chain can be classified into two categories according to the type of convergence of the expected occupation measures. Several properties in each category are investigated.
On the comparison of pure jump processes
On the compound α(t)-modified Poisson distribution
In this paper we introduce compound α(t)-modified Poisson distributions. We obtain the compound Delaporte distribution as the special case of the compound α(t)-modified Poisson distribution. The characteristics of α(t)-modified Poisson and some compound distributions with gamma, exponential and Panjer summands are presented.
On the computation of the exact distribution of power divergence test statistics
In this paper we introduce several algorithms to generate all the vectors in the support of a multinomial distribution. Computational studies are carried out to analyze their efficiency with respect to the CPU time and to calculate their efficiency frontiers. The proposed algorithm is used to calculate exact distributions of power divergence test statistics under the hypothesis of uniformity. Finally, several exact power comparisons are done for different divergence statistics and families of alternatives...
On the concept of the asymptotic Rényi distances for random fields
The asymptotic Rényi distances are explicitly defined and rigorously studied for a convenient class of Gibbs random fields, which are introduced as a natural infinite-dimensional generalization of exponential distributions.
On the conditional expectation in a regular ordered space
On the conditional intensity of a random measure
We prove the existence of the conditional intensity of a random measure that is absolutely continuous with respect to its mean; when there exists an L-intensity, , the conditional intensity is obtained at the same time almost surely and in the mean.
On the connection between cherry-tree copulas and truncated R-vine copulas
Vine copulas are a flexible way for modeling dependences using only pair-copulas as building blocks. However if the number of variables grows the problem gets fastly intractable. For dealing with this problem Brechmann at al. proposed the truncated R-vine copulas. The truncated R-vine copula has the very useful property that it can be constructed by using only pair-copulas and a lower number of conditional pair-copulas. In our earlier papers we introduced the concept of cherry-tree copulas. In this...
On the consistency of a least squares identification procedure
On the constant in the nonuniform version of the Berry-Esseen theorem.
On the construction of kernels