Scale-free characteristics of random networks:: the topology of the World-Wide Web
Scale-free characteristics of random networks:: the topology of the World-Wide Web
复制标题
DOI：
10.1016/s0378-4371(00)00018-2
复制
发表时间：
2000-06-15
期刊：
影响因子：
3.3
通讯作者：
Jeong, H
中科院分区：
文献类型：
--
作者：
Barabási, AL;Albert, R;Jeong, H
万维网形成了一个大的有向图，其顶点是文档，边是从一个文档指向另一个文档的链接。在这里，我们证明，尽管它明显的随机字符，这个图的拓扑结构具有一些普遍的无标度特性。我们引入了一个模型，导致一个无标度网络，以最小的方式捕获的自组织过程管理万维网。(C)2000 Elsevier Science B.V.保留所有权利。
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.