A general model of web graphs

被引：186

作者：

Cooper, C

Frieze, A ^{[1
]}

机构：

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

[2] Kings Coll London, Dept Comp Sci, London WC2R 2LS, England

来源：

RANDOM STRUCTURES & ALGORITHMS | 2003年 / 22卷 / 03期

关键词：

D O I：

10.1002/rsa.10084

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

We describe a very general model of a random graph process whose proportional degree sequence obeys a power law. Such laws have recently been observed in graphs associated with the world wide web. (C) 2003 Wiley Periodicals, Inc.

引用

页码：311 / 335

页数：25

共 26 条

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

Albert, R ;

Jeong, H ;

Barabási, AL .

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

[2] Emergence of scaling in random networks [J].

Barabási, AL ;

Albert, R .

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

[3] Reconstructing a three-dimensional model with arbitrary errors [J].

Berger, B ;

Kleinberg, J ;

Leighton, T .

JOURNAL OF THE ACM, 1999, 46 (02) :212-235

[4] The degree sequence of a scale-free random graph process [J].

Bollobás, B ;

Riordan, O ;

Spencer, J ;

Tusnády, G .

RANDOM STRUCTURES & ALGORITHMS, 2001, 18 (03) :279-290

[5]

BOLLOBAS B, IN PRESS COMBINATORI

[6]

BOLLOBAS R, 2002, HDB GRAPHS NETWORKS

[7] The anatomy of a large-scale hypertextual Web search engine [J].

Brin, S ;

Page, L .

COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (1-7) :107-117

[8] Graph structure in the Web [J].

Broder, A ;

Kumar, R ;

Maghoul, F ;

Raghavan, P ;

Rajagopalan, S ;

Stata, R ;

Tomkins, A ;

Wiener, J .

COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING, 2000, 33 (1-6) :309-320

[9]

BUCKLEY PG, POPULARITY BASED RAN

[10]

COOPER C, 2002, UNPUB DISTRIBUTION V

← 1 2 3 →