https://github.com/bensheldon/random_knots

Some fortran scripts from my college days
https://github.com/bensheldon/random_knots

Last synced: about 1 month ago
JSON representation

Some fortran scripts from my college days

• Host: GitHub
• URL: https://github.com/bensheldon/random_knots
• Owner: bensheldon
• Created: 2012-03-29T23:07:34.000Z (over 12 years ago)
• Default Branch: master
• Last Pushed: 2012-03-29T23:21:25.000Z (over 12 years ago)
• Last Synced: 2024-05-02T06:08:39.201Z (7 months ago)
• Language: FORTRAN
• Homepage:
• Size: 2.28 MB
• Stars: 1
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: readme.md

Awesome Lists containing this project

README

        
Abstract: A mathematical knot is simply a closed curve in three-space. Classifying open knots, or knots that have not been closed, is a relatively unexplored area of knot theory. In this note, we report on our study of open random walks of varying length, creating a collection of open knots. Following the strategy of Millett, Dobay and Stasiak, an open knot is closed by connecting its two open endpoints to a third point, lying on a large sphere that encloses the random walk deeply within its interior. The resulting polygonal knot can be analyzed and its knot type determined, up to the indetermincy of standard knot invariants, using the HOMFLY polynomial. With many closure points uniformly distributed on the large sphere, a statistical distribution of knot types is created for each open knot. We use this method to continue the exploration of the knottedness of linear random walks...

walker.f - Creates a random walk

knotter.center.f - Closes a set of random walks using the walk's centerpoint (based on radius of gyration), and analyses the resulting closed path using HOMFLY algorithm for classifying mathematical knots.

knotter.f - Closes the path using a random point on an enclosing sphere (I think)