Metraipolis › archive › dc_52fe72022341

Moment Restrictions for Dyadic Network Formation Models with Nontransferable Utility — arXiv:2609.12545

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.12545
License (as archived)
CC0-1.0
Archived
2026-10-16T04:25:00.343Z
SHA-256 of the archived text
9498f94db2a2d174764e142cfe9e9fc9cb63a2c3b97528be9fa3fe7599913f27
Stable URL of this page
https://metraipolis.com/documento/dc_52fe72022341

How to cite

Moment Restrictions for Dyadic Network Formation Models with Nontransferable Utility — arXiv:2609.12545 — arXiv (en), https://arxiv.org/abs/2609.12545 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_52fe72022341 (Metraipolis archive dc_52fe72022341, sha256 9498f94db2a2d174764e142cfe9e9fc9cb63a2c3b97528be9fa3fe7599913f27)
BibTeX
@misc{dc52fe72022341,
  title = {Moment Restrictions for Dyadic Network Formation Models with Nontransferable Utility — arXiv:2609.12545},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.12545},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_52fe72022341; sha256 9498f94db2a2d174764e142cfe9e9fc9cb63a2c3b97528be9fa3fe7599913f27},
  year = {2026}
}

Archived text

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

This paper investigates the construction of moment restrictions in dyadic network formation models with unobserved individual heterogeneity under nontransferable utility. Using observed links and covariates from five-node pentads, we construct moment restrictions that do not depend on individual fixed effects. For a broad class of covariate specifications, the construction is minimal in the sense that it uses the least possible number of nodes and dyads. Based on these moment restrictions, we propose the pentad-GMM estimator. We establish asymptotic normality of the pentad-GMM estimator in dense, sparse, and ultra-sparse network regimes, with regime-specific convergence rates and asymptotic variances. These results provide a basis for inference across all three regimes. To make our method computationally efficient, we develop an algorithm that reduces the computational cost of the estimator from naïve \(O(N^5)\) to \(O(N^3)\). We apply the proposed method to an academic-discussion network, and find academic homophily and a positive association between link formation and a potential partner's openness to different perspectives.

Tema degli esploratori: economia dei servizi IA (retro-catalogo arXiv: annunci del 2026-09-14 in econ.EM).
Categorie arXiv: Econometrics (econ.EM).
Pagina del lavoro: https://arxiv.org/abs/2609.12545 — 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-16T04:10:30.823Z dalla pagina https://arxiv.org/catchup/econ.EM/2026-09-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).