Graph substitutions

Research output: Contribution to journalArticlepeer-review

12 Scopus citations

Abstract

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.

Original languageEnglish (US)
Pages (from-to)661-685
Number of pages25
JournalErgodic Theory and Dynamical Systems
Volume18
Issue number3
DOIs
StatePublished - Jan 1 1998

All Science Journal Classification (ASJC) codes

  • Mathematics(all)
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Graph substitutions'. Together they form a unique fingerprint.

Cite this