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 条

[11]

Cooper Colin, 2002, P 34 ANN ACM S THEOR, P419

[12] Structure of growing networks with preferential linking [J].

Dorogovtsev, SN ;

Mendes, JFF ;

Samukhin, AN .

PHYSICAL REVIEW LETTERS, 2000, 85 (21) :4633-4636

[13]

DRINEA E, 2001, VARIATIONS RANDOM GR

[14]

ERDOS P, 1960, B INT STATIST INST, V38, P343

[15]

Erdos P., 1959, Publicationes Mathematicae Debrecen, V6, P290

[16]

Faloutsos M, 1999, COMP COMM R, V29, P251, DOI 10.1145/316194.316229

[17] Graph theory in practice: part II [J].

Hayes, B .

AMERICAN SCIENTIST, 2000, 88 (02) :104-109

[18]

HOEFFDING W, 1913, J AM STAT ASSOC, V58, P30

[19]

KUMAR P, 2000, P 19 ACM S PRINC DAT, P1

[20] Stochastic models for the web graph [J].

Kumar, R ;

Raghavan, P ;

Rajagopalan, S ;

Sivakumar, D ;

Tomkins, A ;

Upfal, E .

41ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2000, :57-65

← 1 2 3 →