RECURSIVE SAMPLING OF PLANAR GRAPHS AND FRACTAL PROPERTIES OF A TWO-DIMENSIONAL QUANTUM GRAVITY

Abstract

We describe a new approach to the Monte-Carlo simulations of two-dimensional gravity. Standard dynamical triangulation technique was combined with results of direct enumeration of the cubic graphs. As a result we were able to build large (128K vertices) statistically independent random graphs directly. The quantitative correspondence between our results and those obtained by standard methods has been observed. The algorithm proved to be so efficient that we were able to conduct all the simulations, which usually require the most powerful computers, on an Iris workstation. An opportunity to generate large random graphs allowed us to observe that the internal geometry of random surfaces is more complicated than simple fractals. External geometry also proved to be rather peculiar.