Metraipolis › archive › dc_87fdce0afcf5
Central Limit Theorems and Network-Free Inference for Heterogeneous Spatial Autoregressions on Sparse Graphons — arXiv:2610.40630
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.40630
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:31:21.293Z
- SHA-256 of the archived text
722432250ea91c1e7ff67c0cbd5f7a9c74e51b94f41481aade15d7626596326d- Stable URL of this page
https://metraipolis.com/documento/dc_87fdce0afcf5
How to cite
Central Limit Theorems and Network-Free Inference for Heterogeneous Spatial Autoregressions on Sparse Graphons — arXiv:2610.40630 — arXiv (en), https://arxiv.org/abs/2610.40630 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_87fdce0afcf5 (Metraipolis archive dc_87fdce0afcf5, sha256 722432250ea91c1e7ff67c0cbd5f7a9c74e51b94f41481aade15d7626596326d)
BibTeX
@misc{dc87fdce0afcf5,
title = {Central Limit Theorems and Network-Free Inference for Heterogeneous Spatial Autoregressions on Sparse Graphons — arXiv:2610.40630},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.40630},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_87fdce0afcf5; sha256 722432250ea91c1e7ff67c0cbd5f7a9c74e51b94f41481aade15d7626596326d},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.40630. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Network dependence is widely regarded as a fundamental obstacle to inference: outcomes linked through a graph are not independent, the graph is rarely observed in full, and models for how dependence propagates are easily misspecified. We show that for a broad class of responses generated through a random network, the obstacle is smaller than it appears. We study a heterogeneous spatial autoregression on a sparse graphon, in which each node's response is a weighted average of its neighbors' responses with a node-specific, nonparametric coefficient plus a node-specific input, and we prove that sample means and smooth functions of vector means are asymptotically Gaussian down to average degree nearly logarithmic in the population size, allowing unbounded graphons with hubs and heavy-tailed inputs. The limiting variance interpolates exactly between two regimes according to the sampling fraction. When the observed nodes are a vanishing fraction of the population, the variance is the marginal variance of the response, the ordinary sample variance is consistent, and the usual $t$-interval is valid with no knowledge of the network. The proof averages over the graph rather than conditioning on it, isolating the behavior of the response through an exact identity for resolvents of Markov kernels and controlling the network noise by an Efron-Stein inequality; neither step requires the walk-by-walk covariance bounds of fixed-network analyses. Consequences for regression with node-level and network-derived covariates are derived. Tema degli esploratori: statistica e scienza dei dati (elenco arXiv stat.ME, nuovi lavori del giorno). Categorie arXiv: Statistics Theory (math.ST) ; Methodology (stat.ME). Pagina del lavoro: https://arxiv.org/abs/2610.40630 — 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-01T02:13:44.004Z dalla pagina https://arxiv.org/list/stat.ME/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).