Abstract
Several variations of the Shiryaev--Roberts detection procedure in the context of the simple changepoint problem are considered: starting the procedure at $R_0=0$ (the original Shiryaev--Roberts procedure), at $R_0=r$ for fixed $r>0$, and at $R_0$ that has the quasi-stationary distribution. Comparisons of operating characteristics are made. The differences fade as the average run length to false alarm tends to infinity. It is shown that the Shiryaev--Roberts procedures that start either from a specially designed point $r$ or from the random “quasi-stationary” point are third-order asymptotically optimal.
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.
