Wasserstein Bounds in the CLT of the MLE for the Drift Coefficient of a Stochastic Partial Differential Equation

In this paper, we are interested in the rate of convergence for the central limit theorem of the maximum likelihood estimator of the drift coefficient for a stochastic partial differential equation based on continuous time observations of the Fourier coefficients <inline-formula><math xmlns...

Full description

Bibliographic Details
Main Authors: Khalifa Es-Sebaiy, Mishari Al-Foraih, Fares Alazemi
Format: Article
Language:English
Published: MDPI AG 2021-10-01
Series:Fractal and Fractional
Subjects:
Online Access:https://www.mdpi.com/2504-3110/5/4/187
Description
Summary:In this paper, we are interested in the rate of convergence for the central limit theorem of the maximum likelihood estimator of the drift coefficient for a stochastic partial differential equation based on continuous time observations of the Fourier coefficients <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>u</mi><mi>i</mi></msub><mrow><mo>(</mo><mi>t</mi><mo>)</mo></mrow><mo>,</mo><mspace width="4pt"></mspace><mi>i</mi><mo>=</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>N</mi></mrow></semantics></math></inline-formula> of the solution, over some finite interval of time <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mo>[</mo><mn>0</mn><mo>,</mo><mi>T</mi><mo>]</mo></mrow></semantics></math></inline-formula>. We provide explicit upper bounds for the Wasserstein distance for the rate of convergence when <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>N</mi><mo>→</mo><mo>∞</mo></mrow></semantics></math></inline-formula> and/or <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>T</mi><mo>→</mo><mo>∞</mo></mrow></semantics></math></inline-formula>. In the case when <i>T</i> is fixed and <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>N</mi><mo>→</mo><mo>∞</mo></mrow></semantics></math></inline-formula>, the upper bounds obtained in our results are more efficient than those of the Kolmogorov distance given by the relevant papers of Mishra and Prakasa Rao, and Kim and Park.
ISSN:2504-3110