Metraipolis › archive › dc_f9cc4fe3e409
Popularity Regression-Based Latent Space Model for Large-Scale Sparse Network Analysis — arXiv:2609.37284
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.37284
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T18:00:52.242Z
- SHA-256 of the archived text
d191e074f2e612514f455edc1e109c742e6ac4cc205e8545566f760de505cdd2- Stable URL of this page
https://metraipolis.com/documento/dc_f9cc4fe3e409
How to cite
Popularity Regression-Based Latent Space Model for Large-Scale Sparse Network Analysis — arXiv:2609.37284 — arXiv (en), https://arxiv.org/abs/2609.37284 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f9cc4fe3e409 (Metraipolis archive dc_f9cc4fe3e409, sha256 d191e074f2e612514f455edc1e109c742e6ac4cc205e8545566f760de505cdd2)
BibTeX
@misc{dcf9cc4fe3e409,
title = {Popularity Regression-Based Latent Space Model for Large-Scale Sparse Network Analysis — arXiv:2609.37284},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.37284},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f9cc4fe3e409; sha256 d191e074f2e612514f455edc1e109c742e6ac4cc205e8545566f760de505cdd2},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.37284. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Degree heterogeneity is one of the most important properties of network data. It is widely observed that degree heterogeneity is often related to the nodal features. In this study, we investigate the estimation and statistical inference for a popularity regression-based latent space model with nodal features. Given the complex dependence structure induced by the latent space model, we aim to derive analytically tractable objective functions that effectively account for this structure for sparse networks. Specifically, we propose a total of four estimators. The first two estimators are developed by utilizing only the first-order structure of the network (e.g., the nodal degree), while the last two estimators are developed by leveraging the higher-order network structures (i.e., reciprocity and transitivity). Rigorous asymptotic theory is established based on various non-standard U-statistics. We find that different estimators might have different convergence rates. The extension to higher-order moments-based estimators is also discussed. Extensive numerical experiments and a real data analysis of link prediction for an author citation network are conducted for illustration purposes. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-30 in stat.ME). Categorie arXiv: Methodology (stat.ME). Pagina del lavoro: https://arxiv.org/abs/2609.37284 — 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-07T17:33:58.762Z dalla pagina https://arxiv.org/catchup/stat.ME/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).