Network Model Averaging Prediction for Latent Space Models by K-Fold Edge Cross-Validation
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913863840038912 |
|---|---|
| author | Zhang, Yan Liao, Jun Fan, Xinyan Fang, Kuangnan Yang, Yuhong |
| author_facet | Zhang, Yan Liao, Jun Fan, Xinyan Fang, Kuangnan Yang, Yuhong |
| contents | In complex systems, networks represent connectivity relationships between nodes through edges. Latent space models are crucial in analyzing network data for tasks like community detection and link prediction due to their interpretability and visualization capabilities. However, when the network size is relatively small, and the true latent space dimension is considerable, the parameters in latent space models may not be estimated very well. To address this issue, we propose a Network Model Averaging (NetMA) method tailored for latent space models with varying dimensions, specifically focusing on link prediction in networks. For both single-layer and multi-layer networks, we first establish the asymptotic optimality of the proposed averaging prediction in the sense of achieving the lowest possible prediction loss. Then we show that when the candidate models contain some correct models, our method assigns all weights to the correct models. Furthermore, we demonstrate the consistency of the NetMA-based weight estimator tending to the optimal weight vector. Extensive simulation studies show that NetMA performs better than simple averaging and model selection methods, and even outperforms the "oracle" method when the real latent space dimension is relatively large. Evaluation on collaboration and virtual event networks further emphasizes the competitiveness of NetMA in link prediction performance. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_22289 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Network Model Averaging Prediction for Latent Space Models by K-Fold Edge Cross-Validation Zhang, Yan Liao, Jun Fan, Xinyan Fang, Kuangnan Yang, Yuhong Methodology In complex systems, networks represent connectivity relationships between nodes through edges. Latent space models are crucial in analyzing network data for tasks like community detection and link prediction due to their interpretability and visualization capabilities. However, when the network size is relatively small, and the true latent space dimension is considerable, the parameters in latent space models may not be estimated very well. To address this issue, we propose a Network Model Averaging (NetMA) method tailored for latent space models with varying dimensions, specifically focusing on link prediction in networks. For both single-layer and multi-layer networks, we first establish the asymptotic optimality of the proposed averaging prediction in the sense of achieving the lowest possible prediction loss. Then we show that when the candidate models contain some correct models, our method assigns all weights to the correct models. Furthermore, we demonstrate the consistency of the NetMA-based weight estimator tending to the optimal weight vector. Extensive simulation studies show that NetMA performs better than simple averaging and model selection methods, and even outperforms the "oracle" method when the real latent space dimension is relatively large. Evaluation on collaboration and virtual event networks further emphasizes the competitiveness of NetMA in link prediction performance. |
| title | Network Model Averaging Prediction for Latent Space Models by K-Fold Edge Cross-Validation |
| topic | Methodology |
| url | https://arxiv.org/abs/2505.22289 |