Abstract
A technique is introduced to prove limit theorems for simple linear rank statistics by means of an approximating statistic based on sequential ranks. This approximation is shown to be close enough to prove asymptotic normality of simple linear rank statistics under the null hypothesis and to obtain a bound on the rate of convergence to normality when the score function is unbounded. In addition, a law of the iterated logarithm and an invariance principle are given for simple linear rank statistics.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
