• Aucun résultat trouvé

Harmonic Oscillator model

N/A
N/A
Protected

Academic year: 2022

Partager "Harmonic Oscillator model"

Copied!
2
0
0

Texte intégral

(1)

Université Grenoble Alpes and ENSIMAG

Master of Science in Industrial and Applied Math (MSIAM)

Project "Stochastic modelling of neuronal data"

ENSIMAG students

Harmonic Oscillator model

Consider the harmonic oscillator driven by a white noise forcing:

dVt = Utdt

dUt = (−DVt−γUt)dt+σdBt (1) with γ, D, σ > 0. The process has three unknown parameters (D, γ, σ). The drift function and diffusion coefficient are Lipschitz. This is an ergodic Ornstein-Uhlenbeck process, i.e., a Gaussian process.

Some properties

Define

Xt= Vt

Ut

; M =

0 1

−D −γ

; Σ = 0

σ

Then

dXt=M Xtdt+ ΣdBt

and the conditional distribution is

(Xt+∆|Xt=x)∼ N e∆Mx , Z

0

esMΣΣTesMTds

! . Letd= 12p

γ2−4D, then

E(Xt+∆|Xt=x) =e12γ∆

cosh (d∆) +2dγ sinh (d∆)

x1+ 1dsinh (d∆) x2

Dd sinh (d∆)

x1+ cosh (d∆)−2dγ sinh (d∆) x2

.

Making a Taylor expansion in∆ up to order 2 we obtain

E(Xt+∆|Xt=x) = x1+x2∆−(Dx1+γx2)22

x2−(Dx1+γx2)∆ + (γ(Dx1+γx2)−Dx2)22

!

+O(∆3). (2) Furthermore,

Var(Xt+∆|Xt=x) = σ2 2γD

1 0 0 D

+ (3)

σ2e−γ∆

4d2

" 2

γDd sinh (2d∆)−2Dγ cosh (2d∆) cosh (2d∆)−1

cosh (2d∆)−1 2Dγ +dsinh (2d∆)−γ2cosh (2d∆)

#

1

(2)

with Taylor expansion up to order 3 in∆ Var(Xt+∆|Xt=x) =σ2

1

33 122123γ

1

22123γ ∆−γ∆2+133(2γ2−D)

+O(∆4) (4) The invariant distribution is

X∼ N

0, σ2 2γD

1 0 0 D

.

The solution of this system has thus moments of any order.

Project

In your project, you will study the Harmonic Oscillator (HO) by answering some of the following questions

1. Prove the properties of HO given above 2. Prove that HO is hypoelliptic

3. Simulate some trajectories with an exact scheme or an approximate scheme. Discuss the differ- ence. Typical values areD= 4, γ = 0.5, σ= 1.

4. Study an estimation method of parametersD, γ, σ when both coordinatesV, U are observed at discrete times. The estimation method could be

• Bayesian approach based on Monte Carlo Markov Chain method: Pokern et al 2011

• Minimization of the contrast defined by the Euler discretization: Samson, Thieullen 2012

• Minimization of the contrast defined by the local linearization: Léon et al 2016.

You will first explain the method, give the intuition, resume the principal theoretical results, and try to implement the method on simulated data.

5. Propose a method to filter the unobserved component U when onlyV is observed at discrete times and when parameters are known or not. Filtering can be based on

• Kalman filter: Paninski et al 2010

• Linearization and MCMC: Pokern et al 2011

• Particle filter: Paninski et al 2012, Ditlevsen and Samson 2014

You will first explain the method, give the intuition, resume the principal theoretical results if there exist, and try to implement the method on simulated data.

6. Propose an estimation method of parametersD, γ, σwhen onlyV is observed at discrete times.

The estimation method could be

• EM algorithm coupled with a filter: Paninski et al 2010; Paninski et al 2012; Ditlevsen and Samson 2014

• Bayesian approach based on Monte Carlo Markov Chain method: Pokern et al 2011 You will first explain the method, give the intuition, resume the principal theoretical results if there exist, and try to implement the method on simulated data.

2

Références

Documents relatifs

Keywords Bayesian statistics · Density dependence · Distance sampling · External covariates · Hierarchical modeling · Line transect · Mark-recapture · Random effects · Reversible

Table 3 presents the results for these cases with an a priori spectral index equal to the real value α = 1.1 (case IIIa), and without any a priori value on any parameter (case IIIb)

Comparison between MLE (CATS) and a Bayesian Monte Carlo Markov Chain method, which estimates simultaneously all parameters and their uncertainties.. Noise in GPS Position Time

– MCMC yields Up component velocity uncertainties which are around [1.7,4.6] times larger than from CATS, and within the millimetre per year range

Once we have decided that the particle is “significantly” in the matrix, we have to compute its coordinate at this time by simulating the longitudinal component, and using the

Probabilities of errors for the single decoder: (solid) Probability of false negative, (dashed) Probability of false positive, [Down] Average number of caught colluders for the

Mais, c’est l’édification de la ville qui, deux siècles plus tard, révèle la fragilité du milieu.. En effet, la fin du XVIII e siècle marque une rupture,

Key-words: Markov hain Monte Carlo method, Metropolis-Hastings, interating hains,..