Asymptotics for dependent sums of random vectors
โ Scribed by C. Cooper
- Publisher
- John Wiley and Sons
- Year
- 1999
- Tongue
- English
- Weight
- 230 KB
- Volume
- 14
- Category
- Article
- ISSN
- 1042-9832
No coin nor oath required. For personal study only.
โฆ Synopsis
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.
๐ SIMILAR VOLUMES
Let the kp-variate random vector X be partitioned into k subvectors X i of dimension p each, and let the covariance matrix 9 of X be partitioned analogously into submatrices 9 ij . The common principal component (CPC) model for dependent random vectors assumes the existence of an orthogonal p by p m
When studying the approximation of the wave functions of the \(H\)-atom by sums of Gaussians, Klopper and Kutzelnigg [KK] and Kutzelnigg [Ku] found an asymptotic of \(\exp [-\gamma \sqrt{n}]\). The results were obtained from numerical results and justified by some asymptotic expansions in quadrature
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