A Geometric Preferential Attachment Model of Networks II

被引：22

作者：

Flaxman, Abraham D. ^{[1
]}

Frieze, Alan M. ^{[2
]}

Vera, Juan ^{[3
]}

机构：

[1] Univ Washington, Inst Hlth Metr & Evaluat, 2301 5th Ave,Suite 600, Seattle, WA 98121 USA

[2] Carnegie Mellon Univ, Dept Math Sci, Pittsburgh, PA 15213 USA

[3] Univ Waterloo, Dept Management Sci, Waterloo, ON N2L 3G1, Canada

来源：

INTERNET MATHEMATICS | 2007年 / 4卷 / 01期

关键词：

D O I：

10.1080/15427951.2007.10129137

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 [计算机软件与理论];

摘要：

We study a random graph Gn 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 Gn are n sequentially generated points, x(1), x(2),..., x(n), chosen uniformly at random from the unit sphere in R-3 After generating xt, we randomly connect it to m points from those points x(1), x(2),..., xt- 1

引用

页码：87 / 111

页数：25

共 41 条

[1]

Aiello W., 2000, Proceedings of the Thirty Second Annual ACM Symposium on Theory of Computing, P171, DOI 10.1145/335305.335326

[2]

Random evolution in massive graphs [J].

Aiello, W ;

Chung, F ;

Lu, LY .

42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2001, :510-519

[3]

Internet -: Diameter of the World-Wide Web [J].

Albert, R ;

Jeong, H ;

Barabási, AL .

NATURE, 1999, 401 (6749) :130-131

[4]

Alon N., 2004, PROBABILISTIC METHOD

[5]

Emergence of scaling in random networks [J].

Barabási, AL ;

Albert, R .

SCIENCE, 1999, 286 (5439) :509-512

[6]

Berger N, 2004, LECT NOTES COMPUT SC, V3142, P208

[7]

Berger N, 2003, LECT NOTES COMPUT SC, V2719, P725

[8]

Blandford DK, 2003, SIAM PROC S, P679

[9]

The diameter of a scale-free random graph [J].

Bollobás, B ;

Riordan, O .

COMBINATORICA, 2004, 24 (01) :5-34

[10]

Bollobas B, 2003, HANDBOOK OF GRAPHS AND NETWORKS: FROM THE GENOME TO THE INTERNET, P1

← 1 2 3 4 5 →