Random knotting in very long off-lattice self-avoiding polygons
From MaRDI portal
Cites work
- A faster direct sampling algorithm for equilateral closed polygons and the probability of knotting
- A Statistical Study of Random Knotting Using the Vassiliev Invariants
- Accelerating polymer simulation by means of tree data-structures and a parsimonious Metropolis algorithm
- Asymptotics of knotted lattice polygons
- Branched polymers
- Calculation of the connective constant for self-avoiding walks via the pivot algorithm
- Efficient implementation of the Pivot algorithm for self-avoiding walks
- Entanglement statistics of polymers in a lattice tube and unknotting of 4-plats
- Entropic exponents of lattice polygons with specified knot type
- Further analysis of Kahan's algorithm for the accurate computation of \(2\times 2\) determinants
- scientific article; zbMATH DE number 1218936 (Why is no real title available?)
- scientific article; zbMATH DE number 1877237 (Why is no real title available?)
- Kahan's Algorithm for a Correct Discriminant Computation at Last Formally Proven
- Knot probabilities in equilateral random polygons
- Knots in random walks
- Knots in self-avoiding walks
- On the universality of knot probability ratios
- Practical Markov Chain Monte Carlo
- Statistical mechanics with topological constraints: II
- The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
- Topological sum rules in the knotting probabilities of DNA
- What is the length of a knot in a polymer?
This page was built for publication: Random knotting in very long off-lattice self-avoiding polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241949)
