2000
DOI: 10.1023/a:1018719226557
|View full text |Cite
|
Sign up to set email alerts
|

Untitled

Abstract: We introduce several bilocal algorithms for lattice self-avoiding walks that provide reasonable models for the physical kinetics of polymers in the absence of hydrodynamic effects. We discuss their ergodicity in different confined geometries, for instance in strips and in slabs. A short discussion of the dynamical properties in the absence of interactions is given.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
16
0

Year Published

2000
2000
2012
2012

Publication Types

Select...
7
2

Relationship

3
6

Authors

Journals

citations
Cited by 15 publications
(18 citation statements)
references
References 40 publications
2
16
0
Order By: Relevance
“…Note that for η the finite-N corrections are very small. In fact, from the η 6 -values near N = 1000, we can extract numerically the 1/N-expansion 26) which agrees reasonably well with the exact expansion…”
Section: Critical Exponents Up To Six Loopssupporting
confidence: 72%
“…Note that for η the finite-N corrections are very small. In fact, from the η 6 -values near N = 1000, we can extract numerically the 1/N-expansion 26) which agrees reasonably well with the exact expansion…”
Section: Critical Exponents Up To Six Loopssupporting
confidence: 72%
“…where x = (2d) 1/2 R/R end , f (x) is a universal function, and ∆ is a correction to scaling exponent. As shown in [29], f (x) is well approximated by a phenomenological representation given first by Mc Kenzie and Moore [27,28]. A comparison with the latter is shown in Fig.…”
Section: The Thermal Correlation Lengthmentioning
confidence: 70%
“…39, without the additional refinements discussed in Ref. 42 To further speed up the dynamics, we simulated several walks simultaneously, performing a multiple Markov chain simulation ͑this technique is also known as parallel tempering or exchange Monte Carlo͒. The algorithm is very efficient as long as the attraction is not too large.…”
Section: Appendix A: Numerical Detailsmentioning
confidence: 99%