On Observation Time for Recovering Latent Hawkes Networks
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911664390012928 |
|---|---|
| author | Linkerhägner, Jonas Bortolasi, Michele Baldassari, Lorenzo de Hoop, Maarten V. Dokmanić, Ivan |
| author_facet | Linkerhägner, Jonas Bortolasi, Michele Baldassari, Lorenzo de Hoop, Maarten V. Dokmanić, Ivan |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_08400 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On Observation Time for Recovering Latent Hawkes Networks Linkerhägner, Jonas Bortolasi, Michele Baldassari, Lorenzo de Hoop, Maarten V. Dokmanić, Ivan Statistics Theory Information Theory Machine Learning 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. |
| title | On Observation Time for Recovering Latent Hawkes Networks |
| topic | Statistics Theory Information Theory Machine Learning |
| url | https://arxiv.org/abs/2605.08400 |