A Geometric Preferential Attachment Model of Networks II
A Geometric Preferential Attachment Model of Networks II
复制标题
网络几何优先依恋模型II
作者:
A. Flaxman;A. Frieze;Juan C. Vera
We study a random graph G n that combines certain aspects of geometric random graphs and preferential attachment graphs. This model yields a graph with power law degree distribution where the expansion property depends on a tunable parameter of the model. The vertices of G n are n sequentially generated points, x 1, x 2, . . . , x n , chosen uniformly at random from the unit sphere in R3 After generating x t , we randomly connect it to m points from those points x 1, x 2, . . . , x t−1.