Open Source
On Minimal Observation Time for Recovering Latent Hawkes Networks
arXiv stat.ML0 views
arXiv:2605.08400v2 Announce Type: replace-cross Abstract: Dynamics of interacting systems in engineering, society, and nature often evolve over latent networks that govern which entities can interact. We study the problem of inferring these networks from event-based observations, which arise naturally in finance, seismology, and neuroscience. While there is substantial algorithmic work addressing this important problem, theoretical results are scarce. In this paper we ask the following fundamental question: what is the minimum time that one must observe the dynamics in order to exactly recover the underlying network, as a function of the number $d$ of interacting entities? For a class of stationary Hawkes processes with sparse, weak interactions, we prove that an observation time of order $\log d$ is sufficient and necessary. For the upper bound we construct a two-stage estimator that uses clipped and binned event data for screening, followed by a least-squares refinement, and apply concentration bounds derived from the Poisson cluster representation. For the lower bound we combine Fano's inequality with Jacod's Girsanov formula for point processes on a suitable subclass of networks.
Source:https://arxiv.org/abs/2605.08400PreviousOn the use of case estimate and transactional payment data in neural networks for individual loss reservingNextSemi-Supervised Learning with Noisy Proxy Covariates: Generalization Bounds and Distribution Regression
Related posts
.NET Security Check scans your published ASP.NET Web.config
0dev.to
My analytics undercounted my audience by an order of magnitude
0dev.to
When Free Software Isn't Free Enough
0Hacker News
45,530 stars and the model that vanished — why I made the 60-second walkthrough
0dev.to

Instagram now lets you edit your stories after you post them
0The Verge
Show HN: Mastra Factory, the open-source software factory we use to build Mastra
0Hacker News