Metraipolis › archive › dc_ddf03ce8fdf4
Poisson Autoregression on a Large Network with a Stochastic Block Model Structure — arXiv:2610.05365
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.05365
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T09:33:48.491Z
- SHA-256 of the archived text
0a05ef1b2305fdac53acaa21cf7c913b11d5d9f1f3298ac1aa6c7a3a3cdd0e2a- Stable URL of this page
https://metraipolis.com/documento/dc_ddf03ce8fdf4
How to cite
Poisson Autoregression on a Large Network with a Stochastic Block Model Structure — arXiv:2610.05365 — arXiv (en), https://arxiv.org/abs/2610.05365 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ddf03ce8fdf4 (Metraipolis archive dc_ddf03ce8fdf4, sha256 0a05ef1b2305fdac53acaa21cf7c913b11d5d9f1f3298ac1aa6c7a3a3cdd0e2a)
BibTeX
@misc{dcddf03ce8fdf4,
title = {Poisson Autoregression on a Large Network with a Stochastic Block Model Structure — arXiv:2610.05365},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.05365},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ddf03ce8fdf4; sha256 0a05ef1b2305fdac53acaa21cf7c913b11d5d9f1f3298ac1aa6c7a3a3cdd0e2a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.05365. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We consider multivariate Poisson autoregressive processes evolving on random networks generated by a Stochastic Block Model. This framework extends existing network Poisson autoregressions by incorporating latent community structure and allowing for non-Markovian dependence, both excitatory and inhibitory. We establish a mean-field approximation and prove that the finite system converges to its limit at the optimal rate $N^{-1/2}$ in the quenched setting with overwhelming probability, both on average and in uniform norm. Our analysis yields quantitative error bounds that are explicit in the time horizon and, under suitable stability conditions, remain polynomial or uniform in time, thereby avoiding the exponential growth typically associated with Grönwall-type arguments. As a consequence, the mean-field approximation is shown to hold uniformly over any time horizon. We further demonstrate how the approximation can be exploited to reduce the computational complexity of parametric inference from $\mathcal{O}(N^2T^2)$ to $\mathcal{O}(NT^2)$. The results provide a theoretical foundation for the analysis and inference of count-valued processes on large random networks with community structure.
Tema degli esploratori: statistica e scienza dei dati (elenco arXiv stat.ML, nuovi lavori del giorno).
Categorie arXiv: Statistics Theory (math.ST) ; Probability (math.PR); Machine Learning (stat.ML).
Pagina del lavoro: https://arxiv.org/abs/2610.05365 — 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-06T08:24:13.986Z dalla pagina https://arxiv.org/list/stat.ML/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).