Metraipolis › archive › dc_18e26e2e91e4

Nonparametric Subgraph Regression — arXiv:2611.07240

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.07240
License (as archived)
CC0-1.0
Archived
2026-11-06T14:58:53.505Z
SHA-256 of the archived text
2597d0f0a3c55bad10f5a90d5f77415be9e74862a95fec8f7ceea00b2525e27c
Stable URL of this page
https://metraipolis.com/documento/dc_18e26e2e91e4

How to cite

Nonparametric Subgraph Regression — arXiv:2611.07240 — arXiv (en), https://arxiv.org/abs/2611.07240 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_18e26e2e91e4 (Metraipolis archive dc_18e26e2e91e4, sha256 2597d0f0a3c55bad10f5a90d5f77415be9e74862a95fec8f7ceea00b2525e27c)
BibTeX
@misc{dc18e26e2e91e4,
  title = {Nonparametric Subgraph Regression — arXiv:2611.07240},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.07240},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_18e26e2e91e4; sha256 2597d0f0a3c55bad10f5a90d5f77415be9e74862a95fec8f7ceea00b2525e27c},
  year = {2026}
}

Archived text

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

Estimation and inference on a single large network are challenging due to dependence among observations. This paper studies nonparametric regression for outcomes defined on groups of $p$ agents, such as the indicator that three agents in a network form a triangle. Outcomes on groups that share an agent may be dependent, while outcomes on disjoint groups are independent. I call this problem subgraph regression; it nests dyadic regression as the special case $p=2$. Its leading application concerns subgraphs of a network, but the methods apply to any outcome defined on groups of agents. I establish a variance bound, uniform convergence rates in probability, and pointwise asymptotic normality for the subgraph analogue of the Nadaraya-Watson kernel regression estimator. The setting differs from regression with i.i.d. data in two ways: (i) the number of observations, of order $N^p$, overstates the effective sample size, which is $N$, and (ii) the rate of convergence depends on the dimension of the covariates of a single agent rather than of all $p$ agents, which mitigates the curse of dimensionality.

Tema degli esploratori: economia dei servizi IA (elenco arXiv econ.EM, nuovi lavori del giorno).
Categorie arXiv: Econometrics (econ.EM).
Pagina del lavoro: https://arxiv.org/abs/2611.07240 — 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-11-06T14:41:06.112Z dalla pagina https://arxiv.org/list/econ.EM/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).