# Infinite limits of copying models of the web graph

Abstract:

Several models were proposed recently to model the dynamic evolution of the web graph. We study the infinite limits of the stochastic processes proposed to model the web graph when time goes to infinity. We prove that deterministic variations of the so-called copying model can lead to several non- isomorphic limits. Some models converge to the infinite random graph R, while the convergence of other models is sensitive to initial conditions or minor changes in the rules of the model. We explain how limits of the copying model of the web graphs share several properties of R that seem to reflect know properties of the web graph.

Tech Report Number:

CS-2003-04

Report Date:

April 30, 2003

Attachment | Size |
---|---|

CS-2003-04.pdf | 338.05 KB |