Abstract
Consider a regular parametric family of distributions F(·, θ). The classical change point problem deals with observations corresponding to θ = 0 before a point of change, and θ = µ after that. We substitute the latter constant µ by a set of random variables θ i,n called a random environment assuming that E[θ i,n ] = µ n → 0. The random environment can be independent or obtained by random permutations of a given set. We define the rates of convergence and give the conditions under which the classical parametric change point algorithms apply.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.