Monte Carlo precise determination of the end‐to‐end distribution function of self‐avoiding walks on the simple‐cubic lattice

1991 ◽  
Vol 95 (8) ◽  
pp. 6088-6099 ◽  
Author(s):  
Jean Dayantis ◽  
Jean‐François Palierne
Keyword(s):  
Monte Carlo ◽  
Distribution Function ◽  
Precise Determination ◽  
Cubic Lattice ◽  
Simple Cubic ◽  
Simple Cubic Lattice ◽  
End To End ◽  
Self Avoiding Walks

scholarly journals 3D ISING NONUNIVERSALITY: A MONTE CARLO STUDY

2005 ◽  
Vol 16 (08) ◽  
pp. 1217-1224 ◽  
Author(s):  
MELANIE SCHULTE ◽  
CAROLINE DROPE
Keyword(s):  
Monte Carlo ◽  
Ising Model ◽  
External Field ◽  
Nearest Neighbor ◽  
Monte Carlo Study ◽  
Universality Class ◽  
Cubic Lattice ◽  
Simple Cubic ◽  
Simple Cubic Lattice ◽  
Binder Cumulant

We investigate as a member of the Ising universality class the Next-Nearest Neighbor Ising model without external field on a simple cubic lattice by using the Monte Carlo Metropolis Algorithm. The Binder cumulant and the susceptibility ratio, which should be universal quantities at the critical point, were shown to vary for small negative next-nearest neighbor interactions.

ALGORITHMS FOR MONTE CARLO SIMULATIONS OF THE ISING MODELS ON A SIMPLE CUBIC LATTICE

1993 ◽  
Vol 04 (03) ◽  
pp. 525-537 ◽  
Author(s):  
NAOKI KAWASHIMA ◽  
NOBUYASU ITO ◽  
YASUMASA KANADA
Keyword(s):  
Monte Carlo ◽  
Heat Bath ◽  
Monte Carlo Algorithm ◽  
Cubic Lattice ◽  
Ising Spin ◽  
Metropolis Method ◽  
Simple Cubic ◽  
Simple Cubic Lattice ◽  
Special Cases ◽  
Glass Model

The vectorized Monte Carlo algorithm by multi-spin coding is extended to the ±J Ising spin glass model on a simple cubic lattice in a magnetic field. Explicit logical expression is given for this algorithm. In addition, shorter logical expressions are found in some special cases. They are given for the heat-bath method under the general condition and for the Metropolis method under the condition, H = 0.

A Monte Carlo method applied to the Heisenberg ferromagnet

1964 ◽  
Vol 60 (1) ◽  
pp. 115-122 ◽  
Author(s):  
D. C. Handscomb
Keyword(s):  
Monte Carlo ◽  
Monte Carlo Method ◽  
Order Parameters ◽  
Heisenberg Ferromagnet ◽  
Cubic Lattice ◽  
Simple Cubic ◽  
Simple Cubic Lattice ◽  
Conventional Methods

AbstractFollowing on from a previous paper (5), we apply the new Monte Carlo method described there to the estimation of order parameters of a simple Heisenberg ferromagnet. By way of illustration, we include some results on the simple cubic lattice, comparing them with results obtained by conventional methods.

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