Alexandria Digital Research Library

An Ergodic Algorithm for Generating Random Knots with a Thickness Constraint

Author:
Chapman, Kyle
Degree Grantor:
University of California, Santa Barbara. Mathematics
Degree Supervisor:
Kenneth Millett
Place of Publication:
[Santa Barbara, Calif.]
Publisher:
University of California, Santa Barbara
Creation Date:
2015
Issued Date:
2015
Topics:
Mathematics
Keywords:
Polygon
Ergodic
Algorithm
Topology
Knot
Thickness
Genres:
Online resources and Dissertations, Academic
Dissertation:
Ph.D.--University of California, Santa Barbara, 2015
Description:

The first algorithm for sampling the space of thick equilateral knots, as a function of thickness, will be described. This algorithm is based on previous algorithms of applying random reflections.

To prove the usefulness of the algorithm, we create a method for turning any knot into the regular planar polygon using only thickness non-decreasing moves. This ensures that the algorithm has a positive probability of connecting any two knots with the required thickness constraint and so is ergodic. This ergodic sampling allows us to analyze the effects of thickness on properties of the geometric knot such as radius of gyration and knotting.

The data from this algorithm will show that the radius of gyration increases strongly with thickness, in that the growth exponent for radius of gyration increases with thickness. It also shows how knotting is decreased by the addition of a thickness constraint.

Physical Description:
1 online resource (70 pages)
Format:
Text
Collection(s):
UCSB electronic theses and dissertations
ARK:
ark:/48907/f3gh9g3v
ISBN:
9781339083933
Catalog System Number:
990045715470203776
Rights:
Inc.icon only.dark In Copyright
Copyright Holder:
Kyle Chapman
File Description
Access: Public access
Chapman_ucsb_0035D_12620.pdf pdf (Portable Document Format)