SHARP BOUNDS FOR EXPECTATIONS OF kTH RECORD INCREMENTS
โ Scribed by Katarzyna Danielak; Mohammad Z. Raqab
- Book ID
- 110970119
- Publisher
- John Wiley and Sons
- Year
- 2004
- Tongue
- English
- Weight
- 212 KB
- Volume
- 46
- Category
- Article
- ISSN
- 1369-1473
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
The sharp lower bound of the kth largest positive eigenvalue of a tree T with n vertices, and the sharp lower bound of the positive eigenvalues of such a tree Tare worked out in this study. A conjecture on the sharp bound of the kth eigenvalue of such a T is proved.
Asymmetric sharp bounds are obtained for the expected values of order statistics using Moriguti's idea of the greatest convex minorant. It rectifies some results in the literature.
Some lower and upper Ste ensen type bounds for record statistics are improved by the use of the relationship between distributions of the kth record statistics for di erent values of k.