S Redner 1985 J. Phys. A: Math. Gen. 18 L723 doi:10.1088/0305-4470/18/12/007
S Redner
Show affiliationsEmploys 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.
82B41 Random walks, random surfaces, lattice animals, etc. (See also 60G50, 82C41)
82B20 Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs
Issue 12 (21 August 1985)
A Corrigendum for this article has been published in 1986 J. Phys. A: Math. Gen. 19 3199
S Redner 1985 J. Phys. A: Math. Gen. 18 L723
Sun Yan et al 1988 J. Phys. D: Appl. Phys. 21 1706
Erik Schnetter 2003 Class. Quantum Grav. 20 4719
E. P. Mercer et al. 2007 ApJ 656 242
K Feitosa et al 2005 J. Phys.: Condens. Matter 17 6301
H S Domingos 2004 J. Phys.: Condens. Matter 16 9083
Yukiyasu Ozeki 2003 J. Phys. A: Math. Gen. 36 2673
J Fernando Barbero G et al 2007 Class. Quantum Grav. 24 5945
Ivor Robinson 1997 Class. Quantum Grav. 14 A331
M M El-Zaidia et al 1981 J. Phys. D: Appl. Phys. 14 2275