Limits and power laws of models for the web graph and other networked information spaces

Authors:
Anthony Bonato;Jeannette Janssen
Affiliations:
Department of Mathematics, Wilfrid Laurier University, Waterloo, ON, Canada;Department of Mathematics and Statistics, Dalhousie University, Halifax, NS, Canada
Venue:
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
Year:
2004

Citing 5
Cited 2

The degree sequence of a scale-free random graph process

Random Structures & Algorithms
Random evolution in massive graphs

Handbook of massive data sets
Stochastic models for the Web graph

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Towards Compressing Web Graphs

DCC '01 Proceedings of the Data Compression Conference
Characterizing and Mining the Citation Graph of the Computer Science Literature

Knowledge and Information Systems

Isomorphism and embedding problems for infinite limits of scale-free graphs

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A survey of models of the web graph

CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a new model of the web graph and related networks. The model is motivated by the copying models of the web graph, where new nodes copy the link structure of existing nodes, and a certain number of additional random links are introduced. Our model parametrizes the number of random links, thereby allowing for the analysis of threshold behaviour. We consider infinite limits of graphs generated by our model, and compare properties of these limits with orientations of the infinite random graph. We analyze the power law behaviour of the in-degree distribution of graphs generated by our model.