Least squares estimators for reflected Ornstein–Uhlenbeck processes
Abstract
In this paper, we investigate the parameter estimation problem for reflected Ornstein–Uhlenbeck processes. Both the estimates based on continuously observed processes and discretely observed processes are considered. The explicit formulas for the estimators are derived using the least squares method. Under some regular conditions, we obtain the consistency and establish the asymptotic normality for the estimators. Numerical results show that the proposed estimators perform well with moderate sample sizes.
keywords:
Least squares estimator, Reflected Ornstein–Uhlenbeck process , Ergodicity , Continuously observed processes , Discretely observed processes1 Introduction
Consider a filtered probability space where the filtration satisfies the usual conditions. Let be a standard Brownian motion adapted to . The reflected Ornstein–Uhlenbeck (OU) process reflected at is described by the following stochastic differential equation (SDE)
(1.1) |
where is the unknown parameter, is a constant and is the minimal continuous increasing process which ensures that for all . The process increases only when hits the boundary , so that
where is the indicator function.
The reflected OU process behaves like a standard OU process in the interior of its domain . Benefiting from its reflecting barrier, the reflected OU process has been widely used in many areas such as the queueing system (Ward and Glynn, 2005), financial engineering (Bo et al., 2010) and mathematical biology (Ricciardi and Sacerdote, 1987). The reflecting barrier is assumed to be for the physical restriction of the state processes such as queue-length, stock prices and interest rates, which take non-negative values. For more details on reflected OU processes and their broad applications, one can refer to Harrison (1985) and Whitt (2002).
The parameter estimation problem in the reflected OU process has gained much attention in recent years due to its increased applications in broad fields. It is necessary that the parameters which characterize the reflected OU process should be estimated via the data in many real-world applications. As far as we know, the maximum likelihood estimator (MLE) for the drift parameter is studied in Bo et al. (2011). They obtain the strong consistency and asymptotic normality of their estimator, but they don’t get the explicit form of asymptotic variance. The sequential MLE based on the continuously observed processes throughout a random time interval is studied in Lee et al. (2012), where is a stopping time. The main tool used in the above two papers is the Girsanov’s theorem of reflected Brownian motion. On the other hand, an ergodic type of estimator for based on discrete observations is studied in Hu et al. (2015). Recently, the moment estimators for all parameters based on the ergodic theorem is studied in Hu and Xi (2021). However, there is only limited literature on least squares estimator (LSE) for the drift parameter of a reflected OU process.
In this paper, we propose two types of LSEs for the drift parameter based on continuously observed processes and discretely observed processes respectively. The continuous-type LSE is motivated by aiming to minimize
It is a quadratic function of , although we don’t know and . The minimum is achieved when
Assume that and , as . When the processes is observed at the discrete time instants , the discrete-type LSE is motivated by minimizing the following contrast function
where . The minimum is achieved when
The remainder of this paper is organized as follows. In Section 2, we describe some preliminary results related to our context. Section 3 is devoted to obtaining the asymptotic behavior of the two estimators. Section 4 presents some numerical results and Section 5 concludes.
2 Preliminaries
In this section, we first introduce some basic facts. Throughout this paper, we shall use the notation “” to denote “convergence in probability” and the notation “” to denote “convergence in distribution”.
With the previous results (Hu et al., 2015; Linesky, 2005; Ward and Glynn, 2003), we know that the unique invariant density of is
(2.1) |
where is the (standard) Gaussian density function.
Based on the basic stability theories of Markov processes, we have the following ergodic lemma.
Lemma 1
For any and any , we have
-
a.
The continuously observed processes is ergodic,
-
b.
The discretely observed processes is ergodic,
3 Asymptotic behavior of the least squares estimators
In this section, we consider the asymptotic behavior of the LSEs for the drift parameter . By Eq. (1.1), we provide two useful and crucial alternative expressions for and
(3.1) |
and
(3.2) |
The following theorem proves the consistency of the continuous-type LSE.
Theorem 2
The continuous-type LSE of admits the strong consistency, i.e.,
as tends to infinity.
Proof of Theorem 2. From the alternative expression Eq. (3.1), we have
By Lemma 1 and Eq. (2.2), we have
(3.3) |
Taking into account that the process is a martingale and with quadratic variation . Then
and
By Chebyshev’s inequality, we have
(3.4) |
Combining Eq. (3.3) and (3.4), we obtain the desired results.
We establish the asymptotic normality of the continuous-type LSE in the following theorem. The convergence rate is comparable to MLE based approch (Bo et al., 2011), and we obtain the explicit formula of the asymptotic variance.
Theorem 3
The continuous-type LSE of admits the asymptotic normality, i.e.,
as tends to infinity.
Proof of Theorem 3 Note that
From Eq. (2.2), we have that converges to almost surely, as tends to infinity. Then, it is sufficient to show that converges in law to a centered normal distribution as tends to infinity. It follows immediately from is adapted with respect to that is a Gaussian random variable with mean and variance . Based on Eq. (2.2) again, we obtain
(3.5) |
By Slutsky’s theorem and Eq. (3.5), we have
which completes the proof.
The following theorem proves the consistency of the discrete-type LSE.
Theorem 4
The discrete-type LSE admits the consistency, i.e.,
as tends to infinity.
Proof of Theorem 4. From the alternative expression Eq. (3.2), we have
We first consider the estimate of . For , we have
By Gronwall’s inequality, we have
It follows that
By the properties of the process , we have
where . By all paths of Brownian motion are -Hlder continuity, where , we have
where is a constant. Then
(3.6) | ||||
which goes to as .
Let . Then we have
(3.7) |
By some similar arguments as in the proof of Theorem 2, we have
(3.8) |
Combining Eq. (2.2), (3.6) and (3.8), we obtain the desired results.
The following theorem establishes the asymptotic normality of the discrete-type LSE.
Theorem 5
Assume that for , as tends to infinity. The discrete-type LSE of admits the asymptotic normality, i.e.,
as tends to infinity.
Proof of Theorem 5. Note that
By Eq. (3.6), we have
(3.9) |
which goes to as tends to infinity. By some similar arguments as in the proof of Theorem 3, we have
By Eq. (3.7), we have
By Eq. (2.2) and Slutsky’s theorem, we obtain the desired results.
Remark 6
Our method can be applied to the reflected OU processes with two-sided reflecting barriers , where . The two types of LSEs of a two-sided reflected OU process are
and
4 Numerical results
In this section, we present some numerical results. For a Monte Carlo simulation of the reflected OU process, one can refer to Lépingle (1995), which is known to yield the same rate of convergence as the usual Euler–Maruyama scheme.
Denote the time between each discretization step by . We perform Monte Carlo simulations of the sample paths generated by the model with different settings. The overall parameter estimates are evaluated by the bias, standard deviation (Std.dev) and mean squared error (MSE). We also give calculations for the asymptotic variance (Asy.var) . The results are presented in Table 1.
What we need to emphasize is that the asymptotic variance is exactly the approximation of even with different settings of . It is effective to verify the explicit, closed form formula proposed in Theorem 3 and 5.
Table 1 summarizes the main findings over 1000 simulations. We observe that as the sample size increases, the bias decreases and is small, that the empirical and model-based standard errors agree reasonably well. The performance improves with larger sample sizes.
The distribution of the proposed estimator with two different settings are illustrated as a histogram in Figure 1 and 2. In each figure, the standard normal distribution density is overlayed as a solid curve. The histogram asymptotically approximates to the standard normal distribution density. Thus, the LSEs work well whether is big () or small () and whether in a fairly short time () or long () time.
True parameter | ||||
---|---|---|---|---|
, | Bias | 0.2006 | 0.0129 | -0.0076 |
Std.dev | 0.4380 | 0.1040 | 0.0310 | |
Asy.var | 1.9100 | 1.0800 | 0.9620 | |
MSE | 0.2320 | 0.0110 | 0.0010 | |
, | Bias | 0.1890 | 0.0171 | -0.0084 |
Std.dev | 0.4550 | 0.1080 | 0.0315 | |
Asy.var | 2.0700 | 1.1700 | 0.9900 | |
MSE | 0.2430 | 0.0120 | 0.0011 | |
, | Bias | 0.1410 | -0.0124 | -0.0255 |
Std.dev | 0.5030 | 0.1450 | 0.0439 | |
Asy.var | 2.5300 | 2.1200 | 1.9300 | |
MSE | 0.2730 | 0.0213 | 0.0026 |


5 Conclusion
In this paper, we present two types of least squares estimators for the reflected Ornstein–Uhlenbeck process based on continuously observed processes and discretely observed processes respectively. The consistency and the asymptotic normality have been studied. Moreover, we derive the explicit formula of the asymptotic variance, which is . Numerical results show that the least squares estimators work well with different settings. Some further research may include investigating the statistical inference for the other reflected diffusions.
References
- Bo et al. (2010) Bo, L., Wang, Y., Yang, X., 2010. Some integral functionals of reflected SDEs and their applications in finance. Quant. Financ. 11, 343–348.
- Bo et al. (2011) Bo, L., Wang, Y., Yang, X., Zhang, G., 2011. Maximum likelihood estimation for reflected Ornstein–Uhlenbeck processes. J. Stat. Plan. Infer. 141, 588–596.
- Harrison (1985) Harrison, J.M., 1985. Brownian motion and stochastic flow systems. Wiley, New York.
- Hu et al. (2015) Hu, Y., Lee, C., Lee, M. H., Song, J., 2015. Parameter estimation for reflected Ornstein-Uhlenbeck processes with discrete observations. Stat. Infer. Stoch. Proc. 18, 279–291.
- Han et al. (2016) Han, Z, Hu, Y., Lee, C., 2016. Optimal pricing barriers in a regulated market using reflected diffusion processes. Quant. Financ. 16, 639-647.
- Hu and Xi (2021) Hu, Y., Xi, Y., 2021. Estimation of all parameters in the reflected Ornstein–Uhlenbeck process from discrete observations. Stat. Probab. Lett. 174.
- Lépingle (1995) Lépingle, D., 1995. Euler scheme for reflected stochastic differential equations. Math. Comput. Simul. 38, 119–126.
- Linesky (2005) Linetsky, V., 2005. On the transition densities for reflected diffusions. Adv. Appl. Probab. 37, 435–460.
- Lee et al. (2012) Lee, C., Bishwal, J. P. N., Lee, M. H., 2012. Sequential maximum likelihood estimation for reflected Ornstein–Uhlenbeck processes. J. Stat. Plan. Infer. 142, 1234–1242.
- Ricciardi and Sacerdote (1987) Ricciardi, L.M., Sacerdote, L., 1987. On the probability densities of an Ornstein–Uhlenbeck process with a reflecting boundary. J. Appl. Probab. 24, 355–369.
- Whitt (2002) Whitt, W., (2002). Stochastic-process limits. Springer, New York.
- Ward and Glynn (2003) Ward, A.R., Glynn, P.W., 2003. Properties of the reflected Ornstein–Uhlenbeck process. Queueing Syst. 44, 109–123.
- Ward and Glynn (2005) Ward, A. R., Glynn, P. W., 2005. A diffusion approximation for a GI=GI=1 queue with balking or reneging. Queueing Syst. 50, 371–400.