Hostname: page-component-74656f9884-c52kr Total loading time: 0 Render date: 2026-11-09T12:20:47.741Z Has data issue: false hasContentIssue false

Graph substitutions

Published online by Cambridge University Press:  01 June 1998

JOSEPH P. PREVITE
Affiliation:
School of Science, Penn State Erie, The Behrend College, Erie, PA 16563, USA (e-mail: jpp@vortex.bd.psu.edu)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In 1984, Gromov (see [4] and [6]) introduced the idea of subdividing a ‘branching’ polyhedron into smaller cells and replacing these cells by more complex objects, reminiscent of the growth of multicellular organisms in biology. The simplest situation of this kind is a graph substitution which replaces certain subgraphs in a graph $G$ by bigger finite graphs. The most basic graph substitution is a vertex replacement rule which replaces certain vertices of $G$ with finite graphs. This paper develops a framework for studying vertex replacements and discusses the asymptotic behavior of iterated vertex replacements, the limit objects, and the induced dynamics on the space of infinite graphs from the viewpoint of geometry and dynamical systems.

Information

Type
Research Article
Copyright
© 1998 Cambridge University Press