On Extensions of an Inequality of Kolmogorov

1997 ◽  
Vol 47 (1-2) ◽  
pp. 1-10
Author(s):  
Tapas K. Chandra ◽  
Subhashis Ghosal

The inequality of Kolmogorov (Sankhya, 1963) has been extended to a sequence of independent sub-Gaussian and other random variables. All the earlier results in the literature on this problem concerned only on the very special case of Bernoulli variables. We use martingale inequalities to establish a key result. A similar inequality is also proved for U-statistics based on exchangeable random variables.

1971 ◽  
Vol 20 (4) ◽  
pp. 135-142
Author(s):  
K. C. Chanda

Summary The purpose of this article is to investigate the ‘large sample’ properties of sample quantiles when we assume that the basic random variables are exchangeable (ref. Loève (1960) p. 365). It is shown that under different conditions (to be specified below) on the nature of these exchangeable random variables the distribution of the sample quantile Xr : n where Xr : n is the rth order statistic for the first n exchangeable random variables [Formula: see text] tends, as n → ∞, to different nondegenerate forms. As an example, the special case of random variables with equicor-related multivariate normal distribution is discussed.


1996 ◽  
Vol 33 (01) ◽  
pp. 146-155 ◽  
Author(s):  
K. Borovkov ◽  
D. Pfeifer

In this paper we consider improvements in the rate of approximation for the distribution of sums of independent Bernoulli random variables via convolutions of Poisson measures with signed measures of specific type. As a special case, the distribution of the number of records in an i.i.d. sequence of length n is investigated. For this particular example, it is shown that the usual rate of Poisson approximation of O(1/log n) can be lowered to O(1/n 2). The general case is discussed in terms of operator semigroups.


1976 ◽  
Vol 13 (2) ◽  
pp. 361-364 ◽  
Author(s):  
M. E. Solari ◽  
J. E. A. Dunnage

We give an expression for the expectation of max (0, S1, …, Sn) where Sk is the kth partial sum of a finite sequence of exchangeable random variables X1, …, Xn. When the Xk are also independent, the formula we give has already been obtained by Spitzer; and when the sequence is a finite segment of an infinite sequence of exchangeable random variables, it is a consequence of a theorem of Hewitt.


1980 ◽  
Vol 12 (01) ◽  
pp. 200-221 ◽  
Author(s):  
B. Natvig

In this paper we arrive at a series of bounds for the availability and unavailability in the time interval I = [t A , t B ] ⊂ [0, ∞), for a coherent system of maintained, interdependent components. These generalize the minimal cut lower bound for the availability in [0, t] given in Esary and Proschan (1970) and also most bounds for the reliability at time t given in Bodin (1970) and Barlow and Proschan (1975). In the latter special case also some new improved bounds are given. The bounds arrived at are of great interest when trying to predict the performance process of the system. In particular, Lewis et al. (1978) have revealed the great need for adequate tools to treat the dependence between the random variables of interest when considering the safety of nuclear reactors. Satyanarayana and Prabhakar (1978) give a rapid algorithm for computing exact system reliability at time t. This can also be used in cases where some simpler assumptions on the dependence between the components are made. It seems, however, impossible to extend their approach to obtain exact results for the cases treated in the present paper.


2016 ◽  
Vol 24 (1) ◽  
pp. 29-41 ◽  
Author(s):  
Roman Frič ◽  
Martin Papčo

Abstract The influence of “Grundbegriffe” by A. N. Kolmogorov (published in 1933) on education in the area of probability and its impact on research in stochastics cannot be overestimated. We would like to point out three aspects of the classical probability theory “calling for” an upgrade: (i) classical random events are black-and-white (Boolean); (ii) classical random variables do not model quantum phenomena; (iii) basic maps (probability measures and observables { dual maps to random variables) have very different “mathematical nature”. Accordingly, we propose an upgraded probability theory based on Łukasiewicz operations (multivalued logic) on events, elementary category theory, and covering the classical probability theory as a special case. The upgrade can be compared to replacing calculations with integers by calculations with rational (and real) numbers. Namely, to avoid the three objections, we embed the classical (Boolean) random events (represented by the f0; 1g-valued indicator functions of sets) into upgraded random events (represented by measurable {0; 1}-valued functions), the minimal domain of probability containing “fractions” of classical random events, and we upgrade the notions of probability measure and random variable.


1997 ◽  
Vol 10 (1) ◽  
pp. 3-20 ◽  
Author(s):  
Shan Sun ◽  
Ching-Yuan Chiang

We prove the almost sure representation, a law of the iterated logarithm and an invariance principle for the statistic Fˆn(Un) for a class of strongly mixing sequences of random variables {Xi,i≥1}. Stationarity is not assumed. Here Fˆn is the perturbed empirical distribution function and Un is a U-statistic based on X1,…,Xn.


Sign in / Sign up

Export Citation Format

Share Document