|
This article is cited in 11 scientific papers (total in 11 papers)
Random graphs and grammars on graphs
V. A. Malyshev
Abstract:
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.
Received: 03.03.1998
Citation:
V. A. Malyshev, “Random graphs and grammars on graphs”, Diskr. Mat., 10:2 (1998), 30–44; Discrete Math. Appl., 8:3 (1998), 247–262
Linking options:
https://www.mathnet.ru/eng/dm419https://doi.org/10.4213/dm419 https://www.mathnet.ru/eng/dm/v10/i2/p30
|
Statistics & downloads: |
Abstract page: | 860 | Full-text PDF : | 378 | First page: | 3 |
|