2000 character limit reached
Polynomials under Ornstein-Uhlenbeck noise and an application to inference in stochastic Hodgkin-Huxley systems
Published 30 Mar 2020 in math.PR, math.ST, and stat.TH | (2003.13531v1)
Abstract: We discuss estimation problems where a polynomial is observed under Ornstein Uhlenbeck noise over a long time interval. We prove local asymptotic normality (LAN) and specify asymptotically efficient estimators. We apply this to the following problem: feeding noise into the classical (deterministic) Hodgkin Huxley model of neuroscience, we are interested in asymptotically efficient estimation of the parameters of the noise process.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.