Predicting optimal lengths of random knots (Q5944753): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 23:44, 4 March 2024
scientific article; zbMATH DE number 1655081
Language | Label | Description | Also known as |
---|---|---|---|
English | Predicting optimal lengths of random knots |
scientific article; zbMATH DE number 1655081 |
Statements
Predicting optimal lengths of random knots (English)
0 references
26 June 2003
0 references
In a thermally fluctuating long linear polymeric chain in a solution, the ends, from time to time, approach each other. At such an instance, the chain can be regarded as closed and thus will form a knot or rather a virtual knot. Several earlier studies of random knotting demonstrated that simpler knots show a higher occurrence for shorter random walks than do more complex knots. However, up to now there have been no rules that could be used to predict the optimal length of a random walk, i.e. the length for which a given knot reaches its highest occurrence. Using numerical simulations, we show here that a power law accurately describes the relation between the optimal lengths of random walks leading to the formation of different knots and the previously characterized lengths of ideal knots of a corresponding type.
0 references
knots
0 references
polymers
0 references
scaling laws
0 references
DNA
0 references
random walks
0 references
biophysics
0 references