.png){kind=icon}
返回
PROJECTIVE, SPARSE AND LEARNABLE LATENT POSITION NETWORK MODELS
.png){kind=icon}
OA
AI
DOI：10.1214/23-AOS2340.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
When modeling network data using a latent position model, it is typical to assume that the nodes' positions are independently and identically distributed. However, this assumption implies the average node degree grows linearly with the number of nodes, which is inappropriate when the graph is thought to be sparse. We propose an alternative assumption-that the latent positions are generated according to a Poisson point process-and show that it is compatible with various levels of sparsity. Unlike other notions of sparse latent position models in the literature, our framework also defines a projective sequence of probability models, thus ensuring consistency of statistical inference across networks of different sizes. We establish conditions for consistent estimation of the latent positions, and compare our results to existing frameworks for modeling sparse networks.
Keyword:
Network models
latent position network model
latent space model
random geometric graph
projective family
network sparsity
consistent estimation
期刊
IF:
3.7
论文数:
2.8K
被引数:
2.9W
机构
引用论文
分享收藏Synergistic antimicrobial therapy using nanoparticles and antibiotics for the treatment of multidrug-resistant bacterial infection.png)
Nano Futures
Nano FuturesIF0
PREAI
分享收藏PAH dissipation in spiked soil: Impacts of bioavailability, microbial activity, and treesChemosphere
ChemosphereIF0
PREAI
分享收藏
查看更多内容