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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
