Random graphs and grammars on graphs

Random graph grammars (a multidimensional generalization of random grammars) are defined and studied. One of the basic examples is the Markov evolution of random graphs which is close in spirit to branching processes. We consider asymptotic growth of the number of connected components and independent cycles, local properties, the phase diagram, and the scales of topology.