Geodesic
Random graphs and grammars on graphs
Diskretnaya Matematika, Tome 10 (1998) no. 2, pp. 30-44.

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{DM_1998_10_2_a1,
     author = {V. A. Malyshev},
     title = {Random graphs and grammars on graphs},
     journal = {Diskretnaya Matematika},
     pages = {30--44},
     publisher = {mathdoc},
     volume = {10},
     number = {2},
     year = {1998},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1998_10_2_a1/}
}
TY  - JOUR
AU  - V. A. Malyshev
TI  - Random graphs and grammars on graphs
JO  - Diskretnaya Matematika
PY  - 1998
SP  - 30
EP  - 44
VL  - 10
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_1998_10_2_a1/
LA  - ru
ID  - DM_1998_10_2_a1
ER  - 
%0 Journal Article
%A V. A. Malyshev
%T Random graphs and grammars on graphs
%J Diskretnaya Matematika
%D 1998
%P 30-44
%V 10
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_1998_10_2_a1/
%G ru
%F DM_1998_10_2_a1
V. A. Malyshev. Random graphs and grammars on graphs. Diskretnaya Matematika, Tome 10 (1998) no. 2, pp. 30-44. http://geodesic.mathdoc.fr/item/DM_1998_10_2_a1/