Characteristic length of random knotting for cylindrical self-avoiding polygons
From MaRDI portal
Abstract: We discuss the probability of random knotting for a model of self-avoiding polygons whose segments are given by cylinders of unit length with radius . We show numerically that the characteristic length of random knotting is roughly approximated by an exponential function of the chain thickness .
Recommendations
Cites work
- scientific article; zbMATH DE number 749774 (Why is no real title available?)
- scientific article; zbMATH DE number 3188477 (Why is no real title available?)
- A Statistical Study of Random Knotting Using the Vassiliev Invariants
- Algebraic invariants of knots and disordered Potts model
- Asymptotics of knotted lattice polygons
- The knot probability in lattice polygons
Cited in
(11)- scientific article; zbMATH DE number 1218944 (Why is no real title available?)
- scientific article; zbMATH DE number 1877235 (Why is no real title available?)
- Scaling behavior of random knots
- Knotting statistics for polygons in lattice tubes
- The second Vassiliev measure of uniform random walks and polygons in confined space
- Statistical topology of closed curves: some applications in polymer physics
- Polymers with spatial or topological constraints: theoretical and computational results
- Characteristics of shape and knotting in ideal rings
- Off-lattice random walks with excluded volume: a new method of generation, proof of ergodicity and numerical results
- Anomalous finite-size effects for the mean-squared gyration radius of Gaussian random knots
- Persistence length of semi-flexible polymer chains on Euclidean lattices
This page was built for publication: Characteristic length of random knotting for cylindrical self-avoiding polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1580612)