Enumeration study of self-avoiding random surfaces
- 21 August 1985
- journal article
- Published by IOP Publishing in Journal of Physics A: General Physics
- Vol. 18 (12) , L723-L726
- https://doi.org/10.1088/0305-4470/18/12/007
Abstract
Employs exact enumeration methods to study a number of configurational properties of self-avoiding random surfaces embedded in a three-dimensional simple cubic lattice. Self-avoiding surfaces are defined as a connected set of plaquettes in which no more than two plaquettes may meet along a common edge, and in which no plaquette can be occupied more than once. Based on enumerating surfaces containing up to 10 plaquettes, the author finds: (a) the number of n-plaquette surfaces, cn, varies as mu nngamma -1, with mu =13.2+or-0.2 and gamma =0.22+or-0.06, (b) the average number of perimeter edges of n-plaquette surfaces, (pn), varies linearly with n, and (c) the mean-square radius of gyration of n-plaquette surfaces, (Rg2(n)), varies as n2 nu , with 2 nu =1.075+or-0.05.Keywords
This publication has 12 references indexed in Scilit:
- Scaling Behavior of Self-Avoiding Random SurfacesPhysical Review Letters, 1984
- Simulating random surfacesPhysics Letters B, 1984
- The size of random surfacesPhysics Letters B, 1984
- Self-avoiding and planar random surfaces on the latticeNuclear Physics B, 1983
- A FORTRAN program for cluster enumerationJournal of Statistical Physics, 1982
- Planar random surfaces on the latticePhysics Letters B, 1982
- The number of random surfaces on the lattice and the large-N gauge theoryPhysics Letters B, 1982
- Critical Behavior of Branched Polymers and the Lee-Yang Edge SingularityPhysical Review Letters, 1981
- Strong coupling phase in lattice gauge theories at large dimensionNuclear Physics B, 1979
- Hausdorff dimensions and gauge theoriesPhysics Letters B, 1979