Metraipolis › archive › dc_a643fa9b8d86

Gated Graph Neural Networks for Learning Hidden Independent Cascade Dynamics — arXiv:2610.04033

Source
arXiv
Original
https://arxiv.org/abs/2610.04033
License (as archived)
CC0-1.0
Archived
2026-10-06T05:29:38.536Z
SHA-256 of the archived text
fdd39ab41e72f1f6f28fc5454af3dae220a5fe284460a46945c42a05f0ad15b7
Stable URL of this page
https://metraipolis.com/documento/dc_a643fa9b8d86

How to cite

Gated Graph Neural Networks for Learning Hidden Independent Cascade Dynamics — arXiv:2610.04033 — arXiv, https://arxiv.org/abs/2610.04033 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a643fa9b8d86 (Metraipolis archive dc_a643fa9b8d86, sha256 fdd39ab41e72f1f6f28fc5454af3dae220a5fe284460a46945c42a05f0ad15b7)
BibTeX
@misc{dca643fa9b8d86,
  title = {Gated Graph Neural Networks for Learning Hidden Independent Cascade Dynamics — arXiv:2610.04033},
  howpublished = {arXiv},
  url = {https://arxiv.org/abs/2610.04033},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a643fa9b8d86; sha256 fdd39ab41e72f1f6f28fc5454af3dae220a5fe284460a46945c42a05f0ad15b7},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv, https://arxiv.org/abs/2610.04033. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Information and infectious diseases spread through social networks, but the spreading probabilities driving them are hard to estimate without per-node activation times. Applications seldom supply these, and inference must instead proceed through indirect and noisy proxies for the terminal infection states. We study this inverse problem on a fixed, known graph under the Hidden Independent Cascade (HIC) model, with one spreading probability per node rather than a single global rate, so the number of unknowns scales with the number of nodes. Seed sets and observation parameters are known, while activation times and terminal infection states are latent, and the observed-data likelihood requires marginalizing over every spreading outcome. We propose a simulation-based amortized estimator that recovers the full node-level parameter vector without reconstructing individual latent cascades. Repeated seed-conditioned symptom observations are summarized as Symptom-Aware Cascade Features (SACF), which combine empirical symptom statistics with neighborhood and structural information. SACF are mapped to parameters by SAGE-HC, a permutation-equivariant gated graph neural network whose learned gates attenuate neighborhood messages corrupted by false positives and false negatives, and training on simulated HIC realizations yields a reusable inverse map. As a benchmark under the same hidden observations, we extend the Dynamic Message Passing learning framework to the HIC emission model. On synthetic and empirical graphs the two methods separate by topology. DMP is highly accurate on trees, whereas SAGE-HC is substantially better on heterogeneous, loopy graphs under noisy terminal symptoms.

Tema degli esploratori: governance digitale e beni comuni (elenco arXiv cs.SI, nuovi lavori del giorno).
Categorie arXiv: Social and Information Networks (cs.SI) ; Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2610.04033 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T05:26:20.289Z dalla pagina https://arxiv.org/list/cs.SI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).