Effective Sampling of Random Surfaces by Baby Universe Surgery

Abstract

We propose a new, very efficient algorithm for sampling of random surfaces in the Monte Carlo simulations, based on so-called baby universe surgery, i.e. cutting and pasting of baby universes. It drastically reduces slowing down as compared to the standard local flip algorithm, thereby allowing simulations of large random surfaces coupled to matter fields. As an example we investigate the efficiency of the algorithm for 2d simplicial gravity interacting with a one-component free scalar field. The radius of gyration is the slowest mode in the standard local flip/shift algorithm. The use of baby universe surgery decreases the autocorrelation time by three order of magnitude for a random surface of $0.5\cdot 10^5$ triangles, where it is found to be ${\tau }_{int}=150\pm 31$ sweeps.

16 pages, ps-file

References in corpus (3)

• Baby universes in 2d quantum gravity
• Observing 4D Baby Universes in Quantum Gravity
• Monte Carlo Simulations of 2-Dimensional Quantum Gravity Coupled to $c=1$ Matter

Cited by in corpus (14)

• Reconstructing the Universe
• Nonperturbative Quantum Gravity
• On the fractal structure of two-dimensional quantum gravity
• Focusing on the Fixed Point of 4D Simplicial Gravity
• New critical phenomena in 2d quantum gravity
• Towards a Non-Perturbative Renormalization of Euclidean Quantum Gravity
• Monte Carlo simulations of 4d simplicial quantum gravity
• Search for Scaling Dimensions for Random Surfaces with c=1
• Square Gravity
• Recent progress in the theory of random surfaces and simplicial quantum gravity
• Geometric and Stochastic Clusters of Gravitating Potts Models
• Ageing of complex networks
• The F model on dynamical quadrangulations
• Long-range disassortative correlations in generic random trees