Scale-free characteristics of random networks: the topology of the world-wide web

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.

MoreLess

Year of publication:	2000
Authors:	Barabási, Albert-László ; Albert, Réka ; Jeong, Hawoong
Published in:	Physica A: Statistical Mechanics and its Applications. - Elsevier, ISSN 0378-4371. - Vol. 281.2000, 1, p. 69-77
Publisher:	Elsevier
Subject:	Disordered systems \| Networks \| Random networks \| Critical phenomena \| Scaling \| World-wide web

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10011057397