Let M be a natural number and let y 1 , ..., y M be independent copies of y. We study the question of approximation of the identity operator by finite sums of the tensors y i y i . We prove that for some absolute constant provided that the last expression is smaller than 1. We apply this estimate t
On the Studentisation of Random Vectors
β Scribed by H.T.V. Vu; R.A. Maller; M.J. Klass
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 453 KB
- Volume
- 57
- Category
- Article
- ISSN
- 0047-259X
No coin nor oath required. For personal study only.
β¦ Synopsis
We give general matrix Studentisation results for random vectors converging in distribution to a spherically symmetric random vector, which have wide applicability to the asymptotic properties of estimators obtained from estimating equations, for example. Appropriate matrix ``square roots,'' required for normalisation of the random vectors, are shown to be the Cholesky square root and the symmetric positive definite square root.
π SIMILAR VOLUMES
A random vector is sampled from a general binary probability space and a search goes through the coordinates until a 1-coordinate is found. A search algorithm called ''almost greedy'' is shown to posses some novel characteristics. Its expectation is shown to be sharply bounded by four times the expe
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.