1981
DOI: 10.1016/0370-2693(81)90545-1
|View full text |Cite
|
Sign up to set email alerts
|

Random paths and random surfaces on a digital computer

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

3
127
0

Year Published

1984
1984
2018
2018

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 149 publications
(130 citation statements)
references
References 10 publications
3
127
0
Order By: Relevance
“…Besides the translocation processes, of central importance for biology, the study of topological spectra of DNA extracted from viral capsids is a typical context where the knowledge of spectra for specific models of random polymers is very valuable. 11,12,14 Model calculations like those carried out in the present work Figure 1: Example of a collapsed interacting selfavoiding ring with N = 500 steps on the cubic lattice, and its shortened form after the BFACF 39,40 reduction procedure with a low fugacity per step. The latter reveals that the ring holds a 5 2 knot, whose projection with the minimal crossing number n c = 5 is also shown.…”
Section: Introductionmentioning
confidence: 83%
See 1 more Smart Citation
“…Besides the translocation processes, of central importance for biology, the study of topological spectra of DNA extracted from viral capsids is a typical context where the knowledge of spectra for specific models of random polymers is very valuable. 11,12,14 Model calculations like those carried out in the present work Figure 1: Example of a collapsed interacting selfavoiding ring with N = 500 steps on the cubic lattice, and its shortened form after the BFACF 39,40 reduction procedure with a low fugacity per step. The latter reveals that the ring holds a 5 2 knot, whose projection with the minimal crossing number n c = 5 is also shown.…”
Section: Introductionmentioning
confidence: 83%
“…This simplification is achieved with a grand-canonical algorithm of the BFACF type, 39,40,52 which has the property of preserving the knot type because it lets the configurations evolve only with local and crankshaft deletion/insertion moves. In our case the simplification is achieved with a bias toward deletion that emerges from choosing a low fugacity K per step.…”
Section: Variable Topologymentioning
confidence: 99%
“…This algorithm was implemented using BFACF-style elementary moves [5] (see figure 8) Figure 8. BFACF moves in the square lattice [5].…”
Section: Numerical Results From Monte Carlo Datamentioning
confidence: 99%
“…This algorithm was implemented using BFACF-style elementary moves [5] (see figure 8) Figure 8. BFACF moves in the square lattice [5]. A positive move (or a positive BFACF move) increases the length of a polygon by 2 steps by replacing an edge with three edges.…”
Section: Numerical Results From Monte Carlo Datamentioning
confidence: 99%
“…Several methods proposed recently, like the pseudo-fermion method [1][2][3], stochastic method [4,5] or the microcanonical method [6] are promising, but it is usually difficult to control their accuracy due to some approximations which affect the results only rather indirectly. In a recently proposed method based on high order numerical hopping parameter expansion [7,8] the committed errors are easier to control.…”
mentioning
confidence: 99%