Infinite limits of copying models of the web graph. (English) Zbl 1080.05084

Bonato, Anthony; Janssen, Jeanette

Internet Math. 1, No. 2, 193-213 (2004).

Attempts to model the dynamic evolution of the web graph motivate an interest in specific graph evolutionary processes. Processes are defined with deterministic adjacency properties that are more general than so-called existentially closed adjacency. Sequences of undirected graphs on a countable set of nodes and their limits satisfying such adjacency properties are studied. In particular, it is discussed when several nonisomorphic limits are obtained.

Reviewer: Ove Frank (Stockholm)

MSC:

05C80	Random graphs (graph-theoretic aspects)
05C60	Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
68R10	Graph theory (including graph drawing) in computer science

Keywords:

infinite random graphs; adjacency properties; fractal property of a graph