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
Turn a folder of MP4s into an editable publishing CSV with Python
0dev.to Python
Oriko CLI – Create your CV in the terminal with builtin Agent support
0Hacker News New
From 181 bytes: nixpkgs' full-source bootstrap
0Hacker News New
Show HN: Fufu – an opinionated Git client inspired by Jujutsu
0Hacker News New
Show HN: Pbc – a CLI for any PocketBase instance
0Hacker News Show

A Link You Can Just Open
0dev.to