Metraipolis › archive › dc_c67c87ce265e
When Interference Graphs Evolve: Doubly Robust Estimation of Dynamic Peer Effects — arXiv:2608.27187
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.27187
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T15:52:19.067Z
- SHA-256 of the archived text
34aefd623b85db0121d3242ee23d4cceec853649ddaac91235e40b7c9e4a332e- Stable URL of this page
https://metraipolis.com/documento/dc_c67c87ce265e
How to cite
When Interference Graphs Evolve: Doubly Robust Estimation of Dynamic Peer Effects — arXiv:2608.27187 — arXiv (en), https://arxiv.org/abs/2608.27187 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c67c87ce265e (Metraipolis archive dc_c67c87ce265e, sha256 34aefd623b85db0121d3242ee23d4cceec853649ddaac91235e40b7c9e4a332e)
BibTeX
@misc{dcc67c87ce265e,
title = {When Interference Graphs Evolve: Doubly Robust Estimation of Dynamic Peer Effects — arXiv:2608.27187},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.27187},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c67c87ce265e; sha256 34aefd623b85db0121d3242ee23d4cceec853649ddaac91235e40b7c9e4a332e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.27187. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Peer effects are difficult to estimate when interaction graphs evolve because pre-assignment network history, dynamic peer exposure, and post-assignment network change have distinct causal roles. We introduce a controlled contrast framework that indexes potential outcomes by own treatment, temporally aggregated peer exposure, and a post-assignment evolution summary. Differences between the resulting means define own-treatment, peer-exposure, controlled network-evolution, and joint controlled contrasts rather than a mediation decomposition. We develop the Dynamic Network Doubly Robust estimator, DynaNet-DR, which combines a temporally factorized propensity with normalized augmentation. Under consistency, summary sufficiency, sequential exchangeability, positivity, nuisance convergence, and weak dependence, its canonical estimator is consistent when either the outcome regression or the propensity estimator is consistent. The reported implementation adds representative-score prediction, fixed clipping, and finite-sample stabilization. Semi-synthetic benchmarks on fixed real temporal graph sequences show favorable estimation accuracy among methods targeting the full profile. These benchmarks assess summary-indexed contrasts rather than counterfactual edge generation, and the MathOverflow study is an observational illustration under the stated assumptions. Tema degli esploratori: governance digitale e beni comuni (retro-catalogo arXiv: annunci del 2026-08-28 in cs.SI). Categorie arXiv: Machine Learning (cs.LG) ; Social and Information Networks (cs.SI). Pagina del lavoro: https://arxiv.org/abs/2608.27187 — 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-17T15:30:58.252Z dalla pagina https://arxiv.org/catchup/cs.SI/2026-08-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).