Abstract

ABSTRACTHsu and Robbins (1947) introduced the concept of complete convergence as a complement to the Kolmogorov strong law in that they proved that provided the mean of the summands is zero and that the variance is finite. Later, Erdős proved the necessity (1949, 1950). Heyde (1975) proved that, under the same conditions, , thereby opening an area of research that has been called precise asymptotics. Both results above have been extended and generalized in various directions. Kao (1978) proved a pointwise version of Heyde’s result, viz. for the counting process , he showed that , where W(⋅) is the standard Wiener process. In this article, we prove an analog for perturbed random walks and illustrate how they enter naturally within the theory of repeated significance tests in exponential families.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.