Projective, sparse and learnable latent position network models
具有投影一致性、稀疏性与可学习性的潜在位置网络模型
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…