Mean-field inference of Hawkes point processes
Not on the map. Why?
Abstract (arXiv)
We propose a fast and efficient estimation method that is able to accurately recover the parameters of a d-dimensional Hawkes point-process from a set of observations. We exploit a mean-field approximation that is valid when the fluctuations of the stochastic intensity are small. We show that this is notably the case in situations when interactions are sufficiently weak, when the dimension of the system is high or when the fluctuations are self-averaging due to the large number of past events they involve. In such a regime the estimation of a Hawkes process can be mapped on a least-squares problem for which we provide an analytic solution. Though this estimator is biased, we show that its precision can be comparable to the one of the Maximum Likelihood Estimator while its computation speed is shown to be improved considerably. We give a theoretical control on the accuracy of our new approach and illustrate its efficiency using synthetic datasets, in order to assess the statistical estimation error of the parameters.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 4 Nov 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 0; 2025: 1; 2026: 1.
3 papers.
- 2021Surfacing Estimation Uncertainty in the Decay Parameters of Hawkes Processes with Exponential Kernelscited by 2
- 2025A Representer Theorem for Hawkes Processes via Penalized Least Squares Minimizationcited by 0
- 2026Poisson Autoregression on a Large Network with a Stochastic Block Model Structurecited by 0
- 2026Poisson Autoregression on a Large Network with a Stochastic Block Model Structure4 Oct 2026
- 2025A Representer Theorem for Hawkes Processes via Penalized Least Squares Minimization10 Oct 2025
- 2021Surfacing Estimation Uncertainty in the Decay Parameters of Hawkes Processes with Exponential Kernels2 Apr 2021