1965
DOI: 10.1016/0032-3950(65)90209-1
|View full text |Cite
|
Sign up to set email alerts
|

The Monte Carlo method in statistical calculations of macromolecules

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
32
0

Year Published

1970
1970
2011
2011

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 62 publications
(32 citation statements)
references
References 4 publications
0
32
0
Order By: Relevance
“…Although easy to implement, these algorithms suffer a very serious drawback: as shown by Madras and Sokal [6], any local algorithm is not ergodic and simulations span only an exponentially small part of the phase space. A different algorithm was inspired by an attempt to model the true dynamics of the polymer in the solvent: the reptation algorithm [7][8][9][10]. However, it was soon realized [8,9] that it is not ergodic because of the possibility of configurations with trapped endpoints.…”
Section: Introductionmentioning
confidence: 99%
“…Although easy to implement, these algorithms suffer a very serious drawback: as shown by Madras and Sokal [6], any local algorithm is not ergodic and simulations span only an exponentially small part of the phase space. A different algorithm was inspired by an attempt to model the true dynamics of the polymer in the solvent: the reptation algorithm [7][8][9][10]. However, it was soon realized [8,9] that it is not ergodic because of the possibility of configurations with trapped endpoints.…”
Section: Introductionmentioning
confidence: 99%
“…The large system sizes used allow us to suppress finite box-size effects for systems with large chains. Using a mix of local, slithering snake [27,28,29], and double-bridging [17,23,30, 31] MC moves we were able to equilibrate dense systems with chain lengths up to N = 8192.…”
mentioning
confidence: 99%
“…The large system sizes used allow us to suppress finite box-size effects for systems with large chains. Using a mix of local, slithering snake [27,28,29], and double-bridging [17,23,30, 31] MC moves we were able to equilibrate dense systems with chain lengths up to N = 8192.Equilibration and sampling of high-molecular BFM melts. Standard BFM implementations [26,32,33] use local MC jumps to the 6 closest lattice sites to prevent the crossing of chains and conserve therefore the chain topology.…”
mentioning
confidence: 99%
“…The slowing down of the singlechain motion by the combination of interfaces and slip-links increases the ordering time by 30%. Mimicking a tightly entangled copolymer melt via the slithering-snake algorithm [170,171], we observe an increase of the ordering time by a factor of almost 9. Thus, while the sequence of morphologies remains unaltered by the single-chain dynamics in this example, the time scale of ordering is strongly affected.…”
Section: Eo /(N K B T )mentioning
confidence: 97%