Scale-free characteristics of random networks:: the topology of the World-Wide Web

被引：793

作者：

Barabási, AL ^{[1
]}

Albert, R ^{[1
]}

Jeong, H ^{[1
]}

机构：

[1] Univ Notre Dame, Coll Sci, Dept Phys, Notre Dame, IN 46556 USA

来源：

PHYSICA A | 2000年 / 281卷 / 1-4期

基金：

美国国家科学基金会;

关键词：

disordered systems; networks; random networks; critical phenomena; scaling; world-wide web;

D O I：

10.1016/S0378-4371(00)00018-2

中图分类号：

O4 [物理学];

学科分类号：

0702 ;

摘要：

The world-wide web forms a large directed graph, whose vertices are documents and edges are links pointing from one document to another. Here we demonstrate that despite its apparent random character, the topology of this graph has a number of universal scale-free characteristics. We introduce a model that leads to a scale-free network, capturing in a minimal fashion the self-organization processes governing the world-wide web. (C) 2000 Elsevier Science B.V. All rights reserved.

引用

页码：69 / 77

页数：9

共 24 条

[1] ALBERT R, UNPUB
[2] ALBERT R, CONDMAT9907038
[3] Complexity and the economy
Arthur, WB
[J]. SCIENCE, 1999, 284 (5411) : 107 - 109
[4] Size and form in efficient transportation networks
Banavar, JR
Maritan, A
Rinaldo, A
[J]. NATURE, 1999, 399 (6732) : 130 - 132
[5] Mean-field theory for scale-free random networks
Barabási, AL
Albert, R
Jeong, H
[J]. PHYSICA A, 1999, 272 (1-2): : 173 - 187
[6] BARABISI AL, PREPRINT
[7] BARTHELEMY LAN, 1999, AMARAL PHYS REV LETT, V82, P15
[8] BOLLOBIAS B, 1985, RANDOM GRAPHS
[9] Bunde A., 1994, FRACTALS SCI
[10] ERDOS P, 1960, B INT STATIST INST, V38, P343

← 1 2 3 →