1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
use crate::{Path, SimulatedPath, StochasticProcess};
use nalgebra::Dim;
use rand::distributions::Distribution;
use rand::thread_rng;
use statrs::distribution::Normal;
use statrs::StatsError;
pub struct OrnsteinUhlenbeck {
pub theta: f32,
pub mu: f32,
pub sigma: f32,
}
impl OrnsteinUhlenbeck {
pub fn new(theta: f32, mu: f32, sigma: f32) -> Self {
Self { theta, mu, sigma }
}
}
impl StochasticProcess for OrnsteinUhlenbeck {
#[allow(non_snake_case)]
fn dynamics(&self, x: f32, dt: f32, dW: f32) -> f32 {
self.theta * (self.mu - x) * dt + self.sigma * dW
}
fn simulate(&self, n: usize, dt: f32, x_0: f32) -> SimulatedPath {
let mut path = Path::zeros_generic(Dim::from_usize(1), Dim::from_usize(n + 1));
path[0] = x_0;
let mut rng = thread_rng();
let increments: Vec<f32> = match Normal::new(0.0, 1.0) {
Ok(dist) => dist,
Err(_) => panic!("Bad parameters."),
}
.sample_iter(&mut rng)
.take(n)
.map(|x| x as f32)
.collect();
for i in 1..n + 1 {
path[i] = self.dynamics(path[i - 1], dt, increments[i - 1]);
}
SimulatedPath::new(n, dt, path)
}
}