Abstract
We consider a local random searching method to approximate a root of a specified equation. If such roots, which can be regarded as estimators for the Euclidean parameter of a statistical experiment, have some asymptotic optimality properties, the local random searching method leads to asymptotically optimal estimators in such cases. Application to simple first order autoregressive processes and some simulation results for such models are also included.
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 callMore From: Annals of the Institute of Statistical Mathematics
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.
