We consider limit theorems for counting processes generated by Minkowski sums of random fuzzy sets. Using support functions, we prove almost-sure convergence for a renewal process indexed by fuzzy sets in an inner-product vector space. We also get convergence for the associated containment renewal f
Limit Theorems for Logarithmic Averages of Random Vectors
✍ Scribed by István Berkes; Lajos Horváth
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 386 KB
- Volume
- 195
- Category
- Article
- ISSN
- 0025-584X
No coin nor oath required. For personal study only.
✦ Synopsis
We prove the strong law of large numbers for logarithmic averages of random vectors. We also obtain a strong approximation for logarithmic averages.
for a large class of functions a if d = 1. Earlier results are due to [IS] and [12] when a(t) = I { t 5 0). For extensions of (1.3) we refer to [17], 121, [l] and [5].
📜 SIMILAR VOLUMES
## Abstract A general almost sure limit theorem is presented for random fields. It is applied to obtain almost sure versions of some (functional) central limit theorems. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
A mixed distributional limit theorem for a stable random field of index \(0<\alpha<2\) is derived. These random fields are of special interest in pattern analysis, in particular, in pattern synthesis. This paper considers the case when the underlying graph that the random field is defined on is line
The Chung Smirnov law of the iterated logarithm and the Finkelstein functional law of the iterated logarithm for empirical processes are used to establish new results on the central limit theorem, the law of the iterated logarithm, and the strong law of large numbers for L-statistics with certain bo
In this note we prove a functional central limit theorem for LPQD processes, satisfying some assumptions on the covariances and the moment condition \(\sup \_{j \geqslant 1} E\left|X\_{1}\right|^{2+}0\). ' 1943 Academic Press. Inc
We consider sequences of length m of n-tuples each with k nonzero entries chosen randomly from an Abelian group or finite field. For what values of m does there exist a subsequence which is zero-sum or linearly dependent, respectively? We report some results relating to these problems.