Next Article in Journal
Closed-Form Heteroclinic Orbits for a Three-Parameter Dynamical System Using a Modified Optimal Parametric Iteration Method
Previous Article in Journal
On Syntactical Simplification of Temporal Operators in Negation-Free Metric Temporal Logic
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Parameter Estimation for the Linear Self-Attracting Diffusion Processes

School of Mathematics, Renmin University of China, Beijing 100872, China
*
Author to whom correspondence should be addressed.
Mathematics 2026, 14(7), 1125; https://doi.org/10.3390/math14071125
Submission received: 22 February 2026 / Revised: 17 March 2026 / Accepted: 23 March 2026 / Published: 27 March 2026
(This article belongs to the Section D: Statistics and Operational Research)

Abstract

In this paper, we investigate parameter estimation for a class of linear self-attracting diffusion processes. Specifically, we consider processes with a drift coefficient given by − θ ∫ 0 t ( X t − X u ) d u . Employing both maximum likelihood estimation and least squares estimation, we show that the resulting estimators coincide. We establish the consistency and asymptotic normality of θ ^ N for high-frequency data, and assess its numerical performance through simulation studies.

1. Introduction

In 1995, Cranston and Le Jan [1] introduced a linear self-attracting diffusion process. This process satisfies a stochastic differential equation (SDE) of the following form:
d X t = d B t − θ ∫ 0 t ( X t − X u ) d u d t , X 0 = 0 .
where the parameter θ > 0 is a constant. The solution to this equation was shown to be unique. As a result, X t converges both in mean square and almost surely to a normally distributed random variable. Equation (1) is a special case of self-interacting diffusion invented by Durrett and Rogers [2] in 1992. The processes have been studied from different aspects for many years. Herrmann and Michael [3] analyze the rate of convergence for certain self-attracting diffusions and establish an estimate specifically for the linear case. Yan et al. [4] introduce a linear fractional self-attracting diffusion. This process is driven by a fractional Brownian motion with Hurst index 1 2 < H < 1 . They study its convergence and the corresponding weighted local time. Jie He and Qian Guo [5] propose an explicit numerical scheme to approximate the linear self-interacting diffusion. They analyze the mean-square convergence of this method and establish that its convergence order is 1. Prior research is predicated on the assumption that the parameter θ is known. Given that θ is inherently unknown in practical applications, its estimation is therefore essential.
As a core branch of statistical inference, parameter estimation plays an irreplaceable role. In the statistical applications of SDEs, parameter estimation has accumulated a substantial body of systematic research findings [6]. These findings include weak consistency [7], strong consistency [8], and asymptotic normality [9], all of which have been extensively studied. Yan et al. [10] investigate the asymptotic properties of the least squares estimators under continuous observation. They establish the strong consistency and asymptotic normality of the estimators. Jørgensen and Sørensen [11] proved the existence of a consistent estimator under the conditions Δ n → 0 and n Δ n → ∞ . They further established the asymptotic normality of the estimator under the additional rate condition n Δ n 3 → 0 . Mazzonetto and Nieto [12] proved the consistency and asymptotic normality of MLE and quasi-maximum likelihood estimators for the drift parameters of ergodic threshold Chan–Karolyi–Longstaff–Sanders processes. Their results apply to both continuous observations and high-frequency discrete observations with an infinite horizon.
Stochastic process observation schemes are divided into continuous and discrete types. Continuous observation of diffusion represents a mathematical idealization, underpinned by a robust theoretical framework. However, as practical measurement equipment cannot realize continuous tracking, real-world observational data are inherently discrete. In light of this, this paper derives the maximum likelihood estimator (MLE) and least squares estimator (LSE) for the parameter θ under continuous and discrete observation scenarios, respectively.
We now clarify the relationship between our approach and the works of Han [13] and Chen et al. [14]. Under the discrete observation framework, both prior works explicitly employ the auxiliary process Z t = ∫ 0 t ( X t − X u ) d u to construct their estimators and derive corresponding theoretical properties. Nevertheless, the process Z t itself is unobservable in practice, as only discrete measurements X t 1 , X t 2 , … , X t N are accessible in real applications. To overcome this critical limitation, we propose a discrete-time approximation Z ^ t i = h ∑ j = 0 i − 1 ( X t i − X t j ) for the unobservable Z t in this paper.
The structure of the paper is as follows. In the next section, we introduce an auxiliary process Z t = ∫ 0 t ( X t − X u ) d u . With this process, we rewrite the SDE (1) as a two-dimensional vector SDE (4). In Section 3, we derive MLE and LSE for both continuous and discrete observations. In Section 4, we focus on the continuous observation framework. As T → ∞ , we prove the almost sure convergence of θ ^ T to θ 0 and establish a central limit theorem. In Section 5, we consider the discrete observation framework. Under the conditions T → ∞ and T 2 / N → 0 , we establish the convergence in probability of θ ^ N to θ 0 . Finally, in Section 6, we examine the finite-sample performance of θ ^ N with simulated data. Numerical results are shown.

2. Preliminaries

In the theory of ordinary differential equations [15], it is a well-established result that higher-order ordinary differential equations can be reformulated as systems of first-order ordinary differential equations. This approach not only greatly reduces the analytical complexity of such equations but also provides a convenient framework for their numerical solution. In a similar spirit, we introduce an auxiliary stochastic process defined by Z t = ∫ 0 t ( X t − X u ) d u . The Itô formula gives
d Z t = d ( t X t ) − X t d t = X t d t + t d X t − X t d t = − θ t Z t d t + t d B t ,
then Z t satisfies a linear SDE. Considering the integrating factor [16] e θ t 2 2 , then
d ( e θ t 2 2 Z t ) = θ t e θ t 2 2 Z t d t + e θ t 2 2 d Z t = t e θ t 2 2 d B t ,
which yields
Z t = e − θ t 2 2 ∫ 0 t s e θ s 2 2 d B s ,
and
X t = ∫ 0 t 1 − θ s e θ s 2 2 ∫ s t e − θ u 2 2 d u d B s .
Building on the formulation d Z t = − θ t Z t d t + t d B t , we define the state components as Y 1 , t = X t and Y 2 , t = Z t . This allows us to rewrite the SDE (1) as a two-dimensional vector SDE.
d Y t = 0 − θ 0 − t θ Y t d t + 1 t d B t , Y 0 = 0 0 .
where
a ( t , Y t ) = 0 − θ 0 − t θ Y t = − θ Y 2 , t − t θ Y 2 , t , b ( t , Y t ) = 1 t .
Note that the linear self-attracting diffusion { X t , t ≥ 0 } does not have the Markov property. However, after introducing the auxiliary stochastic process Z t , the bivariate stochastic process { ( X t , Z t ) , t ≥ 0 } is a two-dimensional Markov process.
Given that the coefficients a ( t , Y t ) and b ( t , Y t ) satisfy the global Lipschitz and linear growth conditions, the well-known Euler–Maruyama method [17] can be used to obtain numerical solutions. For two-dimensional vector SDE (4), the Euler–Maruyama scheme is given:
Y n + 1 = Y n + a ( t n , Y n ) h + b ( t n , Y n ) Δ B n ,
where Δ B n = B t n + 1 − B t n . The discrete time approximation Y n converges strongly to the exact solution Y t n with order γ = 0.5 . In particular, under the additive noise b ( t , Y t ) = 1 t T , it turns out that the Euler–Maruyama scheme has order of strong convergence γ = 1 . Thus,
E X T − Y 1 N ≤ E X T − Y 1 N 2 + Z T − Y 2 N 2 = E Y T − Y N ≤ C · h .
The analytical solution (3) is in integral form. Given the complex dependence with respect to s, the Itô integral requires numerical approximation. Therefore, in Section 6, we employ the Euler–Maruyama method to simulate discrete observations of the linear self-attracting diffusion process { X t , t ≥ 0 } .

3. Maximum Likelihood Estimator and Least Squares Estimator

Maximum likelihood and least squares are the two most commonly used methods in modern statistical inference. In this section, based on both continuous and discrete observation data, we present MLE and LSE for parameter θ . The final results show that the estimators obtained by the two methods are identical.

3.1. MLE and LSE Under Continuous Observation

Let P θ be the probability measure generated by the process { X t , 0 ≤ t ≤ T } on the space ( C T , B T ) , where C T denotes the set of all continuous functions from [ 0 , T ] → R , and B T is the corresponding Borel σ -algebra under the supremum norm. Let θ 0 be the true value of the parameter, which lies inside the parameter space Θ , where Θ is a compact in R + . From (2), Z t is a zero-mean Gaussian process. Then
E P θ 0 exp ( θ − θ 0 ) 2 2 ∫ 0 T Z t 2 d t < ∞ .
Then, the stochastic exponential process exp − ∫ 0 T ( θ − θ 0 ) Z t d B t − ( θ − θ 0 ) 2 2 ∫ 0 T Z t 2 d t , t > 0 is a martingale. According to the Girsanov theorem [18], the likelihood function can be expressed as
L T ( θ ) : = d P θ d P θ 0 = exp − ∫ 0 T ( θ − θ 0 ) Z t d X t − θ 2 − θ 0 2 2 ∫ 0 T Z t 2 d t .
Let l T ( θ ) : = log L T ( θ ) , MLE is defined as
θ ^ : = arg sup θ ∈ Θ l T ( θ ) .
By differentiating the log-likelihood function, we obtain
d l T ( θ ) d θ = − ∫ 0 T Z t d X t − θ ∫ 0 T Z t 2 d t ,
and
d 2 l T ( θ ) d θ 2 = − ∫ 0 T Z t 2 d t < 0 .
Thus, the MLE of θ is
θ ^ T = − ∫ 0 T Z t d X t ∫ 0 T Z t 2 d t .
It should be noted that the self-attracting diffusion process considered in this paper requires θ > 0 . Strictly speaking, θ ^ T is not the MLE of θ , as it may take negative values. A rigorous definition is provided in Kutoyants [19]. Nevertheless, we retain this terminology for convenience.
In order to obtain LSE under continuous observation data, following the approach of Hu and Nualart [20], we consider the following objective function:
S T ( θ ) = ∫ 0 T X ˙ t − ( − θ Z t ) 2 d t .
The notation X ˙ t is a widely used convention in physics and applied stochastic analysis. As the underlying process { X t , t ≥ 0 } is an Itô process driven by Brownian motion—its sample paths being almost nowhere differentiable—the symbol X ˙ t is not mathematically well-defined in the classical sense. It is instead employed as a formal shorthand, with the intended meaning that X ˙ t d t = d X t . LSE for θ is then defined as
θ ^ : = arg inf θ ∈ Θ S T ( θ ) .
Differentiating the objective function yields
d S T ( θ ) d θ = 2 ∫ 0 T X ˙ t + θ Z t Z t d t = 2 ∫ 0 T Z t d X t + 2 θ ∫ 0 T Z t 2 d t ,
and
d 2 S T ( θ ) d θ 2 = 2 ∫ 0 T Z t 2 d t > 0 .
Thus, LSE of θ is
θ ^ T = − ∫ 0 T Z t d X t ∫ 0 T Z t 2 d t ,
which is identical to MLE. Therefore, the same notation is used.

3.2. MLE and LSE Under Discrete Observation

In the preceding subsection, we focused on the setting where the self-attracting diffusion process is observed continuously. In practice, however, it is difficult to obtain fully continuous observations of the sample path, and discrete sampling is far more common. Thus, we consider high-frequency observations of the self-attracting diffusion process { X t , t ≥ 0 } over an infinite time horizon. Specifically, observations are made at equally spaced discrete time points t 0 , t 1 , t 2 , … , t N , i.e., t i = i h , so that N h = T . We assume that T 2 N → 0 as N → ∞ . This condition has two important implications. First, it ensures that the total observation time T = N h tends to infinity, which is necessary for obtaining consistent estimates of parameter θ . Second, it reflects the high-frequency nature of the observations, enabling us to better approximate the continuous-time process by discrete-time data.
Parameter estimation for general diffusion processes follows two common approaches. The first approach constructs the MLE from continuous observations and then approximates it using discrete samples. The second approach directly formulates the MLE or LSE from discrete observations by leveraging a discretized version of the diffusion process. In the context of discrete observations, this paper adopts the first approach to construct the MLE. Following the method of Yoshida [21], we approximate the likelihood function in Equation (5) to derive the approximate log-likelihood function:
l N ( θ ) = ∑ i = 0 N − 1 ( − θ Z ^ t i ) + θ 0 Z ^ t i ( X t i + 1 − X t i ) − 1 2 ∑ i = 0 N − 1 ( − θ Z ^ t i ) 2 − ( − θ 0 Z ^ t i ) 2 ( t i + 1 − t i ) .
It is important to note here that our observation data are X t 0 , X t 1 , … , X t N . The auxiliary stochastic process { Z t , t ≥ 0 } is unobservable, and therefore needs to be estimated using the observable data. Specifically, an estimator for Z t i can be constructed as: Z ^ t i = h ∑ j = 0 i − 1 ( X t i − X t j ) . Differentiating the aforementioned approximate log-likelihood function yields
d l N ( θ ) d θ = − ∑ i = 0 N − 1 Z ^ t i ( X t i + 1 − X t i ) − θ ∑ i = 0 N − 1 Z ^ t i 2 ( t i + 1 − t i ) ,
and
d 2 l N ( θ ) d θ 2 = − ∑ i = 0 N − 1 Z ^ t i 2 ( t i + 1 − t i ) < 0 .
Thus, the approximate MLE of θ is
θ ^ N = − ∑ i = 0 N − 1 Z ^ t i ( X t i + 1 − X t i ) h ∑ i = 0 N − 1 Z ^ t i 2 ,
where Z ^ t i = h ∑ j = 0 i − 1 ( X t i − X t j ) .
To obtain LSE based on discrete observations, we consider the Euler–Maruyama method. This approach is motivated by Florens–Zmirou [22], who studied a minimum contrast estimator based on a first-order Euler–Maruyama type discrete time approximation of the SDE. Therefore, the first step is to construct the Euler–Maruyama scheme for Equation (1). The Euler–Maruyama scheme for Equation (1) is given by
X t i + 1 − X t i = − θ h Z ^ t i + Δ B t i ,
where Δ B t i = B t i + 1 − B t i ∼ N ( 0 , h ) and Z ^ t i = h ∑ j = 0 i − 1 ( X t i − X t j ) . Treating X t i + 1 − X t i as the dependent variable, h Z ^ t i as the independent variable, and Δ B t i + 1 as the random error term, the parameter θ becomes the unknown coefficient in the regression equation. According to the classical least squares method, the objective function in this case is
S N ( θ ) = ∑ i = 0 N − 1 X t i + 1 − X t i − ( − θ h Z ^ t i ) 2 .
Differentiating the objective function yields
d S N ( θ ) d θ = 2 h ∑ i = 0 N − 1 X t i + 1 − X t i + θ h Z ^ t i Z ^ t i ,
and
d 2 S N ( θ ) d θ 2 = 2 h 2 ∑ i = 0 N − 1 Z ^ t i 2 > 0 .
Thus, LSE of θ is
θ ^ N = − ∑ i = 0 N − 1 Z ^ t i ( X t i + 1 − X t i ) h ∑ i = 0 N − 1 Z ^ t i 2 ,
which is identical to the approximate MLE. Therefore, the same notation is used.
The results above indicate that, whether under continuous or discrete observations, the expressions for MLE and LSE are identical. Therefore, hereafter, we will collectively refer to them as the estimator, without further emphasis on which specific estimation method is employed.

4. Asymptotic Properties of the Estimator θ ^ T Under Continuous Observation

The asymptotic properties of a parameter estimator provide an intuitive reflection of the estimator’s effectiveness and the corresponding estimation method, thereby offering solid theoretical support for the rationality and reliability of the method. Without such asymptotic theoretical guarantees, any statistical inference based on finite samples would lack scientific justification. For this reason, this chapter focuses on studying the consistency and asymptotic normality of the proposed estimator.
Consistency is the most fundamental and essential requirement for any reasonable point estimator [23]. The following theorem shows that the estimator θ ^ T is a strongly consistent estimator of θ 0 .
Theorem 1.
There exists a root θ ^ T to l T ′ ( θ ) = 0 , which is strongly consistent, i.e.,
P θ 0 lim T → ∞ θ ^ T = θ 0 = 1 .
Proof. 
Observe that, for ∀ δ > 0 ,
l T ( θ 0 ) − l T ( θ 0 + δ ) = δ ∫ 0 T Z t d X t + 2 δ θ 0 + δ 2 2 ∫ 0 T Z t 2 d t = δ ∫ 0 T Z t d B t − δ θ 0 ∫ 0 T Z t 2 d t + 2 δ θ 0 + δ 2 2 ∫ 0 T Z t 2 d t = δ ∫ 0 T Z t d B t + δ 2 2 ∫ 0 T Z t 2 d t .
Then
l T ( θ 0 ) − l T ( θ 0 + δ ) δ 2 ∫ 0 T Z t 2 d t = 1 δ ∫ 0 T Z t d B t ∫ 0 T Z t 2 d t + 1 2 .
Similarly, we obtain
l T ( θ 0 ) − l T ( θ 0 − δ ) δ 2 ∫ 0 T Z t 2 d t = − 1 δ ∫ 0 T Z t d B t ∫ 0 T Z t 2 d t + 1 2 .
From (2), it follows that for any 0 < T < ∞ ,
P 0 < ∫ 0 T Z t 2 d t < ∞ = 1 ,
and
P ∫ 0 ∞ Z t 2 d t = ∞ = 1 .
Using the strong law of large numbers for Brownian motion [24],
lim T → ∞ ∫ 0 T Z t d B t ∫ 0 T Z t 2 d t = 0 , a . s .
Therefore, for almost every ω ∈ Ω , there exist some T 0 > 0 such that for T ≥ T 0 ,
l T ( θ 0 ) > l T ( θ 0 ± δ ) .
Since l T ( θ ) is continuous in θ on the compact set [ θ 0 − δ , θ 0 + δ ] , it has a local maximum and it is attained at a measurable θ ^ in [ θ 0 − δ , θ 0 + δ ] . Since l T ( θ 0 ) > l T ( θ 0 ± δ ) , for almost every ω ∈ Ω , there exist some T 0 > 0 such that for T ≥ T 0 , θ ^ ∈ ( θ 0 − δ , θ 0 + δ ) . i.e.,
P θ 0 lim T → ∞ θ ^ = θ 0 = 1 .
Since l T ( θ ) is differentiable with respect to θ , it follows that l T ′ ( θ ^ ) = 0 . From the derivation of θ ^ T , we have θ ^ T = θ ^ . Consequently, the estimator θ ^ T is a strongly consistent estimator of the true value θ 0 . □
Theorem 2.
θ ^ T is asymptotically normally distributed. As T → ∞ ,
∫ 0 T Z t 2 d t 1 / 2 ( θ ^ T − θ 0 ) ⟶ D N ( 0 , 1 ) .
Proof. 
θ ^ T = − ∫ 0 T Z t d X t ∫ 0 T Z t 2 d t = − − θ 0 ∫ 0 T Z t 2 d t + ∫ 0 T Z t d B t ∫ 0 T Z t 2 d t = θ 0 − ∫ 0 T Z t d B t ∫ 0 T Z t 2 d t .
Then
θ ^ T − θ 0 = − ∫ 0 T Z t d B t ∫ 0 T Z t 2 d t .
Since (2) holds, the process ∫ 0 t Z s d B s is adapted to the natural filtration F t , t ≥ 0 generated by the Brownian motion { B t , t ≥ 0 } . For any T > 0 , Itô isometry implies that
E ∫ 0 T Z t d B t 2 = E ∫ 0 T Z t 2 d t = ∫ 0 T e − θ t 2 E ∫ 0 t s 2 e θ s 2 d s d t ≤ ∫ 0 T e − θ t 2 e θ t 2 ∫ 0 t s 2 d s d t < ∞ .
Therefore, ∫ 0 T Z t d B t is a square-integrable martingale, with E ∫ 0 T Z t d B t = 0 and its quadratic variation being ∫ 0 T Z t 2 d t . Consequently, by the central limit theorem for square-integrable martingales [25], it follows that as T → ∞ ,
∫ 0 T Z t d B t ∫ 0 T Z t 2 d t ⟶ D N ( 0 , 1 ) .
Then
∫ 0 T Z t 2 d t 1 / 2 ( θ ^ T − θ 0 ) ⟶ D N ( 0 , 1 ) .
The desired conclusion is established. □

5. Asymptotic Properties of the Estimator θ ^ N Under Discrete Observation

It is well known that the theory of diffusion processes is established on the basis of continuous-time observations, and many of their important properties also rely on the continuity of time. Therefore, when conducting statistical inference for diffusion processes under continuous observation, there are many well-developed tools available, which makes the statistical inference problem relatively tractable in such a scenario. However, in practical situations with discrete observations, many tools suitable for continuous observation are difficult to apply directly, thereby making the statistical inference problem for diffusion processes based on discrete observational data more challenging.
Before formally establishing the weak consistency and asymptotic normality of the estimator θ ^ N , we introduce several key lemmas. For a fixed T, these lemmas establish the convergence rate of the numerator and denominator of θ ^ N to the corresponding terms in θ ^ T . This convergence occurs in mean square and quantifies the information loss induced by discretization.
Lemma 1.
For all s , t ∈ [ 0 , T ] , the solution X t satisfies
E | X t − X s | 2 ≤ C | t − s | .
where here, and in the following, C denotes a universal positive constant, which is independent of T and N, and whose value may change from line to line.
Proof. 
Without loss of generality, assume 0 ≤ s ≤ t ≤ T . First, we determine the range of h ( t , s ) . Since θ > 0 and 0 ≤ s ≤ t , we have h ( t , s ) = 1 − θ s e θ s 2 2 ∫ s t e − θ u 2 2 d u ≤ 1 .
h ( t , s ) ≥ 1 − e θ s 2 2 ∫ s t θ u e − θ u 2 2 d u = 1 + e θ s 2 2 e − θ t 2 2 − e − θ s 2 2 = e − θ ( t 2 − s 2 ) 2 > 0 .
Then, using the independence of the random variables ∫ 0 s h ( t , r ) − h ( s , r ) d B r and ∫ s t h ( t , r ) d B r , along with the Itô isometry, we obtain
E X t − X s 2 = E ∫ 0 s h ( t , r ) − h ( s , r ) d B r + ∫ s t h ( t , r ) d B r 2 = E ∫ 0 s h ( t , r ) − h ( s , r ) d B r 2 + E ∫ s t h ( t , r ) d B r 2 + 2 E ∫ 0 s h ( t , r ) − h ( s , r ) d B r · E ∫ s t h ( t , r ) d B r = E ∫ 0 s h ( t , r ) − h ( s , r ) d B r 2 + E ∫ s t h ( t , r ) d B r 2 = θ 2 ∫ 0 s r 2 e θ r 2 ∫ s t e − θ u 2 2 d u 2 d r + ∫ s t h 2 ( t , r ) d r = θ 2 ∫ s t e − θ u 2 2 d u 2 · ∫ 0 s r 2 e θ r 2 d r + ∫ s t h 2 ( t , r ) d r = θ 2 · 1 2 θ s e θ s 2 − ∫ 0 s e θ r 2 d r · ∫ s t e − θ u 2 2 d u 2 + ∫ s t h 2 ( t , r ) d r ≤ θ 2 s e θ s 2 ∫ s t e − θ u 2 2 d u 2 + ∫ s t h 2 ( t , r ) d r .
Since 0 < h ( t , s ) ≤ 1 , we have the bound ∫ s t h 2 ( t , r ) , d r ≤ t − s for the second term. For the first term, θ 2 s e θ s 2 ∫ s t e − θ u 2 2 d u 2 , we consider three cases in its analysis.
Case 1: s = 0 , θ 2 s e θ s 2 ∫ s t e − θ u 2 2 d u 2 = 0 .
Case 2: t − s ≤ 1 θ s ,
θ 2 s e θ s 2 ∫ s t e − θ u 2 2 d u 2 ≤ θ 2 s e θ s 2 ∫ s t e − θ s 2 2 d u 2 = θ 2 s ( t − s ) 2 ≤ t − s 2 .
Case 3: t − s > 1 θ s , note that when 0 < s ≤ u , we have u 2 ≥ s 2 + 2 s ( u − s ) . Thus,
∫ s t e − θ u 2 2 d u ≤ ∫ s t e − θ s 2 2 · e − θ s ( u − s ) d u = e − θ s 2 2 1 − e − θ s ( t − s ) θ s ≤ e − θ s 2 2 θ s .
Then
θ 2 s e θ s 2 ∫ s t e − θ u 2 2 d u 2 ≤ θ 2 s e θ s 2 e − θ s 2 2 θ s 2 = 1 2 θ s ≤ t − s 2 .
In summary,
E | X t − X s | 2 ≤ C | t − s | .
The proof is completed. □
Lemma 2.
For all t ∈ [ t i , t i + 1 ) , i = 0 , 1 , 2 , … , N − 1 ,
E | Z t − Z ^ t i | 2 ≤ C · T 3 N .
Proof. 
Let j s = max { j = 0 , 1 , … , N : t j ≤ s } , then j s is the largest integer index j such that t j does not exceed s. Consequently, for ∀ t ∈ [ t i , t i + 1 ) , we have ∫ t i t ( X t i − X t j s ) d s = ∫ t i t ( X t i − X t i ) d s = 0 . Then,
Z ^ t i = ∑ j = 0 i − 1 ( X t i − X t j ) ( t j + 1 − t j ) = ∫ 0 t i ( X t i − X t j s ) d s = ∫ 0 t ( X t i − X t j s ) d s .
From Lemma 1 and the Cauchy–Schwarz inequality, we have
E | Z t − Z ^ t i | 2 = E ∫ 0 t ( X t − X s ) d s − ∫ 0 t ( X t i − X t j s ) d s 2 = E ∫ 0 t ( X t − X t i ) d s − ∫ 0 t ( X s − X t j s ) d s 2 ≤ 2 E ∫ 0 t ( X t − X t i ) d s 2 + 2 E ∫ 0 t ( X s − X t j s ) d s 2 ≤ 2 t 2 E X t − X t i 2 + 2 t ∫ 0 t E X s − X t j s 2 d s ≤ 4 t 2 · C T N ≤ C · T 3 N .
Lemma 2 is proved. □
Using the preceding two lemmas, we derive the following L 2 convergence rates for the approximants to their corresponding integrals.
Lemma 3.
E ∑ i = 0 N − 1 Z ^ t i ( B t i + 1 − B t i ) − ∫ 0 T Z t d B t 2 ≤ C · T 4 N .
E h · ∑ i = 0 N − 1 Z ^ t i 2 − ∫ 0 T Z t 2 d t 2 ≤ C · T 5 N .
E ∑ i = 0 N − 1 Z ^ t i ∫ t i t i + 1 Z s d s − ∫ 0 T Z t 2 d t 2 ≤ C · T 6 N .
Proof. 
For any t ∈ [ t i , t i + 1 ) with i = 0 , … , N − 1 , we define Z ^ t = Z ^ t i .
(1) Applying Lemma 2 along with the Itô isometry, we obtain
E ∫ 0 T Z t d B t − ∑ i = 0 N − 1 Z ^ t i ( B t i + 1 − B t i ) 2 = E ∫ 0 T Z t d B t − ∫ 0 T Z ^ t d B t 2 = E ∫ 0 T ( Z t − Z ^ t ) d B t 2 = ∫ 0 T E Z t − Z ^ t 2 d t ≤ C · T 4 N .
This completes the proof of Equation (6).
(2) Using Cauchy–Schwarz inequality, we have
E ∫ 0 T Z t 2 d t − ∑ i = 0 N − 1 Z ^ t i 2 ( t i + 1 − t i ) 2 = E ∫ 0 T Z t 2 d t − ∫ 0 T Z ^ t 2 d t 2 = E ∫ 0 T ( Z t 2 − Z ^ t 2 ) d t 2 = T ∫ 0 T E Z t − Z ^ t 2 d t ≤ C · T 2 N ∫ 0 T t 2 d t = C · T 5 N .
This proves Equation (7).
(3)
E Z t 2 = E e − θ t 2 2 ∫ 0 t s e θ s 2 2 d B s 2 = e − θ t 2 ∫ 0 t s 2 e θ s 2 d s = e − θ t 2 t 2 θ e θ t 2 − ∫ 0 t e θ s 2 2 θ d s ≤ t 2 θ .
Then, using the fourth-moment formula for the normal distribution,
E Z t 4 = 3 E Z t 2 2 ≤ C T 2 .
Similarly,
E | Z t − Z ^ t i | 4 = 3 E | Z t − Z ^ t i | 2 2 ≤ C · T 6 N 2 .
Using Cauchy–Schwarz inequality, we have
E | Z t 2 − Z ^ t i Z t | 2 ≤ E | Z t − Z ^ t i | 4 · E Z t 4 ≤ C · T 4 N .
Then
E ∑ i = 0 N − 1 Z ^ t i ∫ t i t i + 1 Z s d s − ∫ 0 T Z t 2 d t 2 = E ∫ 0 T Z ^ s Z s − Z s 2 d s 2 ≤ T ∫ 0 T E | Z ^ s Z s − Z s 2 | 2 d s ≤ C · T 6 N .
The proof is complete. □
Theorem 3.
Given a fixed T, for any ϵ > 0
lim N → ∞ P | θ ^ N − θ ^ T | > ϵ = 0 .
Proof. 
It follows from Lemma 3 and Chebyshev’s inequality that, as N → ∞ ,
∑ i = 0 N − 1 Z ^ t i ( B t i + 1 − B t i ) ⟶ P ∫ 0 T Z t d B t ,
h · ∑ i = 0 N − 1 Z ^ t i 2 ⟶ P ∫ 0 T Z t 2 d t ,
∑ i = 0 N − 1 Z ^ t i ∫ t i t i + 1 Z s d s ⟶ P ∫ 0 T Z t 2 d t .
Therefore, by applying the arithmetic rules for convergence in probability, as N → ∞ ,
θ ^ N − θ ^ T = θ ∑ i = 0 N − 1 Z ^ t i ∫ t i t i + 1 Z s d s − ∑ i = 0 N − 1 Z ^ t i ( B t i + 1 − B t i ) h ∑ i = 0 N − 1 Z ^ t i 2 − θ ∫ 0 T Z t 2 d t − ∫ 0 T Z t d B t ∫ 0 T Z t 2 d t ⟶ P 0 .
The proof is complete. □
To write down the difference between the estimators, introduce the following notations:
A T = ∫ 0 T Z t 2 d t , B T = ∫ 0 T Z t d B t , S 1 = ∑ i = 0 N − 1 Z ^ t i ∫ t i t i + 1 Z s d s ,
S 2 = ∑ i = 0 N − 1 Z ^ t i ( B t i + 1 − B t i ) , D = h ∑ i = 0 N − 1 Z ^ t i 2 .
Then
θ ^ N − θ ^ T = − ∑ i = 0 N − 1 Z ^ t i ( X t i + 1 − X t i ) h ∑ i = 0 N − 1 Z ^ t i 2 + ∫ 0 T Z t d X t ∫ 0 T Z t 2 d t = θ ∑ i = 0 N − 1 Z ^ t i ∫ t i t i + 1 Z s d s − ∑ i = 0 N − 1 Z ^ t i ( B t i + 1 − B t i ) h ∑ i = 0 N − 1 Z ^ t i 2 − θ ∫ 0 T Z t 2 d t − ∫ 0 T Z t d B t ∫ 0 T Z t 2 d t = θ S 1 D − 1 − S 2 D − B T A T .
Lemma 4.
As T → ∞ ,
A T T 2 ⟶ p 1 4 θ .
Proof. 
Given that Z t = e − θ t 2 2 ∫ 0 t s e θ s 2 2 d B s , the process { Z t , t ≥ 0 } is a zero-mean Gaussian process. By virtue of the Itô isometry, its variance satisfies
Var ( Z t ) = E Z t 2 = e − θ t 2 ∫ 0 t s 2 e θ s 2 d s .
Applying Fubini’s theorem, we obtain
E A T = E ∫ 0 T Z t 2 d t = ∫ 0 T e − θ t 2 ∫ 0 t s 2 e θ s 2 d s d t .
By using L’Hospital rule, we have
lim T → ∞ E A T T 2 = lim T → ∞ e − θ T 2 ∫ 0 T s 2 e θ s 2 d s 2 T = lim T → ∞ T 2 e θ T 2 2 e θ T 2 + 4 θ T 2 e θ T 2 = 1 4 θ .
Then as T → ∞ ,
E A T ∼ T 2 4 θ .
Without loss of generality, assume s ≤ t . Using the covariance formula for Itô integrals, we obtain
E ( Z s · Z t ) = E e − θ s 2 2 · e − θ t 2 2 · ∫ 0 s r e θ r 2 2 d B r · ∫ 0 t r e θ r 2 2 d B r = e − θ ( s 2 + t 2 ) 2 · ∫ 0 s r 2 e θ r 2 d r .
Since { Z t , t ≥ 0 } is a zero-mean Gaussian process, the random vector Z t Z s follows a bivariate normal distribution. Consequently,
Cov ( Z s 2 , Z t 2 ) = 2 E ( Z s · Z t ) 2 = 2 e − θ ( s 2 + t 2 ) ∫ 0 s r 2 e θ r 2 d r 2 .
Hence, by applying Fubini’s theorem, we have
Var A T = E ∫ 0 T Z t 2 d t − E ∫ 0 T Z t 2 d t 2 = E ∫ 0 T Z t 2 − E Z t 2 d t 2 = ∫ 0 T ∫ 0 T E Z t 2 − E Z t 2 · Z s 2 − E Z s 2 d s d t = ∫ 0 T ∫ 0 T Cov ( Z s 2 , Z t 2 ) d s d t = 2 ∫ 0 T ∫ 0 T e − θ t 2 · e − θ s 2 · ∫ 0 s r 2 e θ r 2 d r 2 d s d t = 4 ∫ 0 T ∫ 0 t e − θ t 2 · e − θ s 2 · ∫ 0 s r 2 e θ r 2 d r 2 d s d t .
By using L’Hospital rule, we have
lim T → ∞ ∫ 0 T r 2 e θ r 2 d r T e θ T 2 = lim T → ∞ T 2 e θ T 2 e θ T 2 + 2 θ T 2 e θ T 2 = 1 2 θ .
Then
lim T → ∞ Var A T T 2 = lim T → ∞ 4 e − θ T 2 ∫ 0 T e − θ s 2 ∫ 0 s r 2 e θ r 2 d r 2 d s 2 T = lim T → ∞ 2 e − θ T 2 ∫ 0 T r 2 e θ r 2 d r 2 e θ T 2 + 2 θ T 2 e θ T 2 = lim T → ∞ 2 e − θ T 2 T e θ T 2 2 θ 2 e θ T 2 + 2 θ T 2 e θ T 2 = lim T → ∞ 2 T 2 e θ T 2 4 θ 2 e θ T 2 + 2 θ T 2 e θ T 2 = 1 4 θ 3 .
Thus, as T → ∞ ,
Var A T ∼ T 2 4 θ 3 .
By Chebyshev’s inequality, for every ϵ > 0 , as T → ∞ ,
P A T T 2 − 1 4 θ > ϵ = P A T T 2 − E A T T 2 > ϵ ≤ Var A T T 2 ϵ 2 = Var A T T 4 ϵ 2 → 0 .
Therefore, A T T 2 converges in probability to 1 4 θ . □
Theorem 4.
As N → ∞ , and T 2 N → 0 ,
θ ^ N ⟶ p θ ^ T , θ ^ N ⟶ p θ .
Proof. 
Define the event E = { A T ≥ T 2 8 θ } . Then, by Lemma 4, as T → ∞ ,
P E c = P A T < T 2 8 θ ≤ P A T T 2 − 1 4 θ > 1 8 θ → 0 .
For any δ > 0 , it follows from Equation (7) that as T → ∞ , N → ∞ , and T 2 N → 0 ,
P E ∩ D A T − 1 > δ = P A T ≥ T 2 8 θ ∩ D − A T > δ A T ≤ P A T ≥ T 2 8 θ ∩ D − A T > δ T 2 8 θ ≤ P D − A T > δ T 2 8 θ ≤ E D − A T 2 δ 2 · T 2 8 θ 2 ≤ C T δ 2 N → 0 .
Then
P D A T − 1 > δ ≤ P E c + P E ∩ D A T − 1 > δ → 0 .
Similarly, from Equation (8), we have
P S 1 A T − 1 > δ ≤ P E c + P E ∩ S 1 A T − 1 > δ ≤ P E c + P S 1 − A T > δ T 2 8 θ ≤ P E c + E S 1 − A T 2 δ 2 · T 2 8 θ 2 ≤ P E c + C T 2 δ 2 N → 0 .
From Equation (6), we have
P S 2 − B T A T > δ ≤ P E c + P E ∩ S 2 − B T A T > δ ≤ P E c + P S 2 − B T > δ T 2 8 θ ≤ P E c + E S 2 − B T 2 δ 2 · T 2 8 θ 2 ≤ P E c + C δ 2 N → 0 .
By the continuous mapping theorem and Slutsky’s theorem, we obtain
S 1 D = S 1 A T D A T ⟶ P 1 , S 2 − B T D = S 2 − B T A T D A T ⟶ P 0 , A T − D D = A T D − 1 ⟶ P 0 .
Furthermore, from Theorem 1, we have B T A T ⟶ a . s . 0 . Hence,
S 2 D − B T A T = S 2 − B T D + B T A T · A T − D A T ⟶ P 0 .
Therefore,
θ ^ N − θ ^ T = θ S 1 D − 1 − S 2 D − B T A T ⟶ P 0 .
By Theorem 1, we have θ ^ T ⟶ a . s . θ 0 . Hence, for any ϵ > 0 , as T → ∞ and T 2 N → 0 ,
P θ ^ N − θ 0 > ϵ ≤ P θ ^ N − θ ^ T > ϵ 2 + P θ ^ T − θ 0 > ϵ 2 → 0 .
The proof is complete. □
The condition T 2 / N → 0 guarantees estimator consistency by bounding the first-order discretization error. Asymptotic normality requires control over higher-order biases and accumulated stochastic fluctuations. This demands stricter sampling rate conditions. We now state the conditions and results for the estimator’s convergence in distribution.
Theorem 5.
As N → ∞ , and T 4 N → 0 ,
h ∑ i = 0 N − 1 Z ^ t i 2 θ ^ N − θ 0 ⟶ D N ( 0 , 1 ) .
Proof. 
θ ^ N − θ 0 = − ∑ i = 0 N − 1 Z ^ t i ( X t i + 1 − X t i ) h ∑ i = 0 N − 1 Z ^ t i 2 − θ 0 = θ 0 ∑ i = 0 N − 1 Z ^ t i ∫ t i t i + 1 Z s d s − h ∑ i = 0 N − 1 Z ^ t i 2 h ∑ i = 0 N − 1 Z ^ t i 2 − ∑ i = 0 N − 1 Z ^ t i ( B t i + 1 − B t i ) h ∑ i = 0 N − 1 Z ^ t i 2 .
Then
h ∑ i = 0 N − 1 Z ^ t i 2 θ ^ N − θ 0 = θ 0 ( S 1 − D ) D − S 2 D .
Define the event E = { A T ≥ T 2 8 θ } . Then, by Lemma 4, as T → ∞ ,
P E c = P A T < T 2 8 θ ≤ P A T T 2 − 1 4 θ > 1 8 θ → 0 .
For any δ > 0 , it follows from Equation (7) that as T → ∞ , N → ∞ , and T 4 N → 0 ,
P D − A T A T > δ ≤ P E c + P E ∩ D − A T A T > δ ≤ P E c + P D − A T > δ T 8 θ ≤ P E c + E D − A T 2 δ 2 · T 2 8 θ ≤ P E c + C T 3 δ 2 N → 0 .
Similarly, from Equation (8), we have
P S 1 − A T A T > δ ≤ P E c + P E ∩ S 1 − A T A T > δ ≤ P E c + P S 1 − A T > δ T 8 θ ≤ P E c + E S 1 − A T 2 δ 2 · T 2 8 θ ≤ P E c + C T 4 δ 2 N → 0 .
From Equation (6), we have
P S 2 − B T A T > δ ≤ P E c + P E ∩ S 2 − B T A T > δ ≤ P E c + P S 2 − B T > δ T 8 θ ≤ P E c + E S 2 − B T 2 δ 2 · T 2 8 θ ≤ P E c + C T 2 δ 2 N → 0 .
Thus, D A T ⟶ P 1 , S 1 − A T A T ⟶ P 0 and D − A T A T ⟶ P 0 . By the continuous mapping theorem and Slutsky’s theorem, we obtain
D A T ⟶ P 1 , S 1 − D A T = S 1 − A T A T − D − A T A T ⟶ P 0 .
Then,
S 1 − D D = S 1 − D A T D A T ⟶ P 0 .
Furthermore, from Theorem 2, we have B T A T ⟶ D N ( 0 , 1 ) . Since S 2 − B T A T ⟶ P 0 and by Slutsky’s theorem, we have the following convergence in distribution:
S 2 D = S 2 A T · A T D = B T A T + S 2 − B T A T · A T D ⟶ D N ( 0 , 1 ) .
Then,
h ∑ i = 0 N − 1 Z ^ t i 2 θ ^ N − θ 0 = θ 0 ( S 1 − D ) D − S 2 D ⟶ D N ( 0 , 1 ) .
The proof is complete. □

6. Simulation

We simulate the trajectory of { X t , t ≥ 0 } using the Euler–Maruyama scheme over the interval [ 0 , T ] with a total time of T = 50 discretized into N = 5000 steps. The estimator θ ^ N (where T = N h ) is then plotted against T for the true parameters θ 0 = 2 and θ 0 = 5 .
For both subplots in Figure 1, the solid black line represents the estimated parameter θ ^ computed from discrete observations, while the dashed red line indicates the true parameter value θ 0 . We can clearly observe that, regardless of whether the true parameter is set to θ 0 = 2 or θ 0 = 5 , the estimator θ ^ N converges rapidly in the early iterations and quickly stabilizes at the level corresponding to the true parameter value (indicated by the red dashed line in the figures), demonstrating excellent rapid convergence and stability. This confirms the consistency of our proposed estimator.
For a comparison, the following table lists the values of θ ^ ( 10 ) , θ ^ ( 20 ) , … , θ ^ ( 50 ) for different choices of h. These results are based on 100 independent realizations of the process { X t , t ≥ 0 } , each simulated via the Euler–Maruyama method, from which we obtain the average value of the estimator θ ^ N (see Table 1).
It can be observed from the table that as the step size h decreases and the time horizon T increases, the average value of the estimator θ ^ N approaches the true parameter θ 0 . Furthermore, the standard deviation of θ ^ N decreases as T increases, which aligns with our theoretical consistency results.

7. Conclusions

In this paper, we have studied parameter estimation for a class of linear self-attracting diffusion processes with a drift coefficient of the form − θ ∫ 0 t ( X t − X u ) d u . The estimation problem is investigated under both continuous and discrete observation schemes. Explicit formulas for the MLE and LSE are derived, and it is shown that the two estimators coincide in both continuous and discrete observations. The consistency and asymptotic distribution of the estimators θ ^ T and θ ^ N are established. Furthermore, the performance of θ ^ N is evaluated via Monte Carlo simulations using synthetic data generated from the model. A natural direction for future work is to investigate the properties of the estimators under generalized nonlinear settings. This would further extend our asymptotic results and address the challenges posed by nonlinear self-attracting diffusion processes, which we have identified as a promising research direction in the concluding discussion.

Author Contributions

Conceptualization, X.L. and W.W.; methodology, X.L.; software, X.L.; validation, X.L. and W.W.; formal analysis, X.L. and W.W.; writing—original draft preparation, X.L.; writing—review and editing, W.W. and X.L.; supervision, W.W. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Cranston, M.; Le Jan, Y. Self attracting diffusions: Two case studies. Math. Ann. 1995, 303, 87–93. [Google Scholar] [CrossRef] [Scilit]
  2. Durrett, R.T.; Rogers, L.C.G. Asymptotic behavior of Brownian polymers. Probab. Theory Relat. Fields 1992, 92, 337–349. [Google Scholar] [CrossRef] [Scilit]
  3. Herrmann, S.; Scheutzow, M. Rate of convergence of some self-attracting diffusions. Stoch. Process. Their Appl. 2004, 111, 41–55. [Google Scholar] [CrossRef] [Scilit]
  4. Yan, L.; Sun, Y.; Lu, Y. On the Linear Fractional Self-attracting Diffusion. J. Theor. Probab. 2008, 21, 502–516. [Google Scholar] [CrossRef] [Scilit]
  5. He, J.; Guo, Q. An explicit method for the self-interacting diffusion driven by fractional Brownian motion under global Lipschitz conditions. Appl. Math. Lett. 2022, 134, 108379. [Google Scholar] [CrossRef] [Scilit]
  6. Bishwal, J.P.N. Parameter Estimation in Stochastic Differential Equations; Lecture Notes in Mathematics; Springer: Berlin/Heidelberg, Germany, 2008; Volume 1923. [Google Scholar] [CrossRef] [Scilit]
  7. Aït-Sahalia, Y. Maximum Likelihood Estimation of Discretely Sampled Diffusions: A Closed-form Approximation Approach. Econometrica 2002, 70, 223–262. [Google Scholar] [CrossRef] [Scilit]
  8. Kasonga, R.A. The consistency of a non-linear least squares estimator from diffusion processes. Stoch. Process. Their Appl. 1988, 30, 263–275. [Google Scholar] [CrossRef] [Scilit]
  9. Prakasa Rao, B.L.S. Asymptotic theory for non-linear least squares estimator for diffusion processes. Ser. Stat. 1983, 14, 195–209. [Google Scholar] [CrossRef] [Scilit]
  10. Sun, X.; Yan, L.; Ge, Y. The Laws of Large Numbers Associated with the Linear Self-attracting Diffusion Driven by Fractional Brownian Motion and Applications. J. Theor. Probab. 2022, 35, 1423–1478. [Google Scholar] [CrossRef] [Scilit]
  11. Jørgensen, E.S.; Sørensen, M. Prediction-based estimation for diffusion models with high-frequency data. Jpn. J. Stat. Data Sci. 2021, 4, 483–511. [Google Scholar] [CrossRef] [Scilit]
  12. Mazzonetto, S.; Nieto, B. Parameters estimation of a threshold Chan–Karolyi–Longstaff–Sanders process from continuous and discrete observations. Scand. J. Stat. 2025, 52, 1670–1707. [Google Scholar] [CrossRef] [Scilit]
  13. Han, J. Least Squares Estimation for Self-Attracting Diffusion with Discrete Observations. Adv. Appl. Math. 2019, 8, 1993–2001. [Google Scholar] [CrossRef]
  14. Chen, X.; Lu, Y.; Yan, L. Least Squares Estimation for the Linear Self-Attracting Diffusion Driven by α-Stable Motions. Adv. Appl. Math. 2021, 10, 3969. [Google Scholar] [CrossRef]
  15. Magnus, R. Essential Ordinary Differential Equations; Springer Undergraduate Mathematics Series; Springer International Publishing: Cham, Switzerland, 2023. [Google Scholar] [CrossRef] [Scilit]
  16. Øksendal, B. Stochastic Differential Equations; Universitext; Springer: Berlin/Heidelberg, Germany, 2003. [Google Scholar] [CrossRef] [Scilit]
  17. Kloeden, P.E.; Platen, E. Numerical Solution of Stochastic Differential Equations; Springer: Berlin/Heidelberg, Germany, 1992. [Google Scholar] [CrossRef] [Scilit]
  18. Klebaner, F.C. Introduction to Stochastic Calculus with Applications, 3rd ed.; Imperial College Press: London, UK, 2012. [Google Scholar] [CrossRef] [Scilit]
  19. Kutoyants, Y.; Pohlmann, H. Parameter estimation for Kalman-Bucy filter with small noise. Statistics 1994, 25, 307–323. [Google Scholar] [CrossRef] [Scilit]
  20. Hu, Y.; Nualart, D. Parameter estimation for fractional Ornstein–Uhlenbeck processes. Stat. Probab. Lett. 2010, 80, 1030–1038. [Google Scholar] [CrossRef] [Scilit]
  21. Yoshida, N. Estimation for diffusion processes from discrete observation. J. Multivar. Anal. 1992, 41, 220–242. [Google Scholar] [CrossRef] [Scilit]
  22. Florens-zmirou, D. Approximate discrete-time schemes for statistics of diffusion processes. Statistics 1989, 20, 547–557. [Google Scholar] [CrossRef] [Scilit]
  23. Casella, G.; Berger, R. Statistical Inference, 2nd ed.; Chapman and Hall/CRC: New York, NY, USA, 2024. [Google Scholar] [CrossRef] [Scilit]
  24. Liptser, R.S.; Shiryaev, A.N. Statistics of Random Processes; Stochastic Modelling and Applied Probability; Springer: Berlin/Heidelberg, Germany, 2001; Volume 6. [Google Scholar] [CrossRef] [Scilit]
  25. Rao, B.L.S.P. Semimartingales and Their Statistical Inference; CRC Press: Boca Raton, FL, USA, 2019. [Google Scholar] [CrossRef] [Scilit]
Figure 1. Estimated values of θ ^ against time horizon T for (a) θ 0 = 2 and (b) θ 0 = 5 (step size h = 0.01 ). The dashed red line denotes the true parameter value θ 0 .
Figure 1. Estimated values of θ ^ against time horizon T for (a) θ 0 = 2 and (b) θ 0 = 5 (step size h = 0.01 ). The dashed red line denotes the true parameter value θ 0 .
Mathematics 14 01125 g001
Table 1. Average values of the estimator θ ^ N ( θ 0 = 2 ).
Table 1. Average values of the estimator θ ^ N ( θ 0 = 2 ).
hT = 10T = 20T = 30T = 40T = 50
2 − 6 2.0536 (0.2808)2.0179 (0.1265)2.0050 (0.0755)2.0134 (0.0490)1.9931 (0.0335)
2 − 7 2.0767 (0.2403)2.0015 (0.1131)2.0119 (0.0736)1.9886 (0.0577)1.9974 (0.0497)
2 − 8 2.0233 (0.2837)1.9954 (0.1481)2.0044 (0.0922)2.0015 (0.0677)1.9996 (0.0471)
Note. The non-parenthesized entries represent the mean values of the estimator, while the values in parentheses denote the standard deviations of the estimator.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Li, X.; Wang, W. Parameter Estimation for the Linear Self-Attracting Diffusion Processes. Mathematics 2026, 14, 1125. https://doi.org/10.3390/math14071125

AMA Style

Li X, Wang W. Parameter Estimation for the Linear Self-Attracting Diffusion Processes. Mathematics. 2026; 14(7):1125. https://doi.org/10.3390/math14071125

Chicago/Turabian Style

Li, Xuejiao, and Wei Wang. 2026. "Parameter Estimation for the Linear Self-Attracting Diffusion Processes" Mathematics 14, no. 7: 1125. https://doi.org/10.3390/math14071125

APA Style

Li, X., & Wang, W. (2026). Parameter Estimation for the Linear Self-Attracting Diffusion Processes. Mathematics, 14(7), 1125. https://doi.org/10.3390/math14071125

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop