Computer simulation study of the θ‐point in three dimensions. I. Self‐avoiding walks on a simple cubic lattice

1990 ◽  
Vol 92 (8) ◽  
pp. 5144-5154 ◽  
Author(s):  
Hagai Meirovitch ◽  
H. A. Lim
Keyword(s):  
Computer Simulation ◽  
Simulation Study ◽  
Three Dimensions ◽  
Computer Simulation Study ◽  
Cubic Lattice ◽  
Simple Cubic ◽  
Simple Cubic Lattice ◽  
Self Avoiding Walks ◽  
Θ Point

Upper Bounds for the Connective Constant of Self-Avoiding Walks

1993 ◽  
Vol 2 (2) ◽  
pp. 115-136 ◽  
Author(s):  
Sven Erick Alm
Keyword(s):  
Large Class ◽  
Triangular Lattice ◽  
Upper Bounds ◽  
Square Lattice ◽  
Numerical Application ◽  
Cubic Lattice ◽  
Simple Cubic ◽  
Simple Cubic Lattice ◽  
Connective Constant ◽  
Self Avoiding Walks

We present a method for obtaining upper bounds for the connective constant of self-avoiding walks. The method works for a large class of lattices, including all that have been studied in connection with self-avoiding walks. The bound is obtained as the largest eigenvalue of a certain matrix. Numerical application of the method has given improved bounds for all lattices studied, e.g. μ < 2.696 for the square lattice, μ < 4.278 for the triangular lattice and μ < 4.756 for the simple cubic lattice.

Self‐avoiding walks on a simple cubic lattice

1993 ◽  
Vol 99 (5) ◽  
pp. 3976-3982 ◽  
Author(s):  
N. Eizenberg ◽  
J. Klafter
Keyword(s):  
Cubic Lattice ◽  
Simple Cubic ◽  
Simple Cubic Lattice ◽  
Self Avoiding Walks

Self-avoiding walks on the simple cubic lattice

2000 ◽  
Vol 33 (34) ◽  
pp. 5973-5983 ◽  
Author(s):  
D MacDonald ◽  
S Joseph ◽  
D L Hunter ◽  
L L Moseley ◽  
N Jan ◽  
...  
Keyword(s):  
Cubic Lattice ◽  
Simple Cubic ◽  
Simple Cubic Lattice ◽  
Self Avoiding Walks
Sign in / Sign up

Export Citation Format

Share Document