Fractional interacting particle system: drift parameter estimation via Malliavin calculus
Chiara Amorino, Ivan Nourdin, Radomyra Shevchenko
TL;DR
This work develops a statistical framework for drift-parameter estimation in interacting particle systems driven by additive fractional Brownian motion. By leveraging Malliavin calculus and a propagation of chaos for both particles and their Malliavin derivatives, it proves consistency and asymptotic Gaussianity for a Skorohod-based fake-estimator, and transfers these properties to computable estimators via the divergence–Young link. The study introduces two computable schemes, a ratio-type estimator and a fixed-point/iterative estimator, and shows that the latter can achieve CLTs with quantifiable variance inflation under contraction conditions. Numerical results corroborate the theoretical findings, illustrating strong performance of the proposed estimators in various regimes of $H$ and $N$. The paper also outlines future work to address discrete observations, nonparametric drift, and extensions to multiplicative noise.
Abstract
We address the problem of estimating the drift parameter in a system of $N$ interacting particles driven by additive fractional Brownian motion of Hurst index \( H \geq 1/2 \). Considering continuous observation of the interacting particles over a fixed interval \([0, T]\), we examine the asymptotic regime as \( N \to \infty \). Our main tool is a random variable reminiscent of the least squares estimator but unobservable due to its reliance on the Skorohod integral. We demonstrate that this object is consistent and asymptotically normal by establishing a quantitative propagation of chaos for Malliavin derivatives, which holds for any \( H \in (0,1) \). Leveraging a connection between the divergence integral and the Young integral, we construct computable estimators of the drift parameter. These estimators are shown to be consistent and asymptotically Gaussian. Finally, a numerical study highlights the strong performance of the proposed estimators.
