1990
DOI: 10.1088/0305-4470/23/9/021
|View full text |Cite
|
Sign up to set email alerts
|

The pivot algorithm and polygons: results on the FCC lattice

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

1990
1990
2017
2017

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 31 publications
(8 citation statements)
references
References 33 publications
0
8
0
Order By: Relevance
“…16,27 The pivot algorithm has been used on this lattice before. 28 In that case, the lattice was termed the fcc lattice, using the more common name for this lattice, and was used to study polygons or cyclic polymers.…”
Section: Methodsmentioning
confidence: 99%
“…16,27 The pivot algorithm has been used on this lattice before. 28 In that case, the lattice was termed the fcc lattice, using the more common name for this lattice, and was used to study polygons or cyclic polymers.…”
Section: Methodsmentioning
confidence: 99%
“…On the other hand, the pivot algorithm [37][38][39] , where one part of an (already existing) chain is moved around a randomly selected bond, has proved most valuable not only for studying very long (linear) chains 49,81) due to large acceptance fractions and small (integral) autocorrelation times of global properties, but also for polygons 82) . A linear chain may be regarded as a star molecule having two arms.…”
Section: Motivation For the Present Investigationmentioning
confidence: 99%
“…The algorithm for the Monte Carlo simulation of the discrete model consists of two basic moves [21,22]: a single particle flip and a global flip. In the single particle flip, a particle is picked at random and reflected about the straight line joining its two neighbours (see Fig.…”
Section: A Monte Carlo Simulationsmentioning
confidence: 99%