Abstract
Abstract We shall use the Stein method to prove a general Motoo-type combinatorial central limit theorem for serial rank statistics. Our basic approach will be the underlying graph structure of the ranks of lag 1. In the process we shall obtain minimal conditions for the asymptotic normality of Wald–Wolfowitz-type serial rank statistics.
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.
