ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 0801.2624
115
6

Least squares type estimation of the transition density of a particular hidden Markov chain

17 January 2008
C. Lacour
ArXivPDFHTML
Abstract

In this paper, we study the following model of hidden Markov chain: Yi=Xi+ϵiY_i=X_i+\epsilon_iYi​=Xi​+ϵi​, i=1,...,n+1i=1,...,n+1i=1,...,n+1 with (Xi)(X_i)(Xi​) a real-valued stationary Markov chain and (ϵi)1≤i≤n+1(\epsilon_i)_{1\leq i\leq n+1}(ϵi​)1≤i≤n+1​ a noise having a known distribution and independent of the sequence (Xi)(X_i)(Xi​). We present an estimator of the transition density obtained by minimization of an original contrast that takes advantage of the regressive aspect of the problem. It is selected among a collection of projection estimators with a model selection method. The L2L^2L2-risk and its rate of convergence are evaluated for ordinary smooth noise and some simulations illustrate the method. We obtain uniform risk bounds over classes of Besov balls. In addition our estimation procedure requires no prior knowledge of the regularity of the true transition. Finally, our estimator permits to avoid the drawbacks of quotient estimators.

View on arXiv
Comments on this paper