Translator Disclaimer
2007 Growing Protean Graphs
Pawel Prałat, Nicholas Wormald
Internet Math. 4(1): 1-16 (2007).

Abstract

The web may be viewed as a graph each of whose vertices corresponds to a static HTML web page and each of whose edges corresponds to a hyperlink from one web page to another. Recently, there has been considerable interest in using random graphs to model complex real-world networks to gain an insight into their properties. In this paper we propose an extended version of a new random model of the web graph in which the degree of a vertex depends on its age. We use the differential equation method to obtain basic results on the probability of edges being present. From this we are able to characterize the degree sequence of the model and study its behaviour near the connectivity threshold.

Citation

Download Citation

Pawel Prałat. Nicholas Wormald. "Growing Protean Graphs." Internet Math. 4 (1) 1 - 16, 2007.

Information

Published: 2007
First available in Project Euclid: 27 May 2009

zbMATH: 1167.05047
MathSciNet: MR2492172

Rights: Copyright © 2007 A K Peters, Ltd.

JOURNAL ARTICLE
16 PAGES


SHARE
Vol.4 • No. 1 • 2007
Back to Top