Characteristic length of random knotting for cylindrical self-avoiding polygons
classification
❄️ cond-mat.stat-mech
cond-mat.soft
keywords
knottinglengthrandomcharacteristicpolygonsself-avoidingapproximatedchain
read the original 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 $r$. We show numerically that the characteristic length of random knotting is roughly approximated by an exponential function of the chain thickness $r$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.