3 citations · 6 across the 2 of their papers we have counts for
3 papers
cond-mat.stat-mech2018★ 3 cited
Open and closed random walks with fixed edgelengths in
Jason Cantarella, Kyle Chapman, Philipp Reiter +1
In this paper, we consider fixed edgelength -step random walks in . We give an explicit construction for the closest closed equilateral random walk to almost any o…
math.PR2017★ 3 cited
Off-Lattice Random Walks with Excluded Volume: A New Method of Generation, Proof of Ergodicity and Numerical Results
Laura Plunkett, Kyle Chapman
We describe a new algorithm, the reflection method, to generate off-lattice random walks of specified, though arbitrarily large, thickness in and prove that our meth…
math.GT2016
An ergodic algorithm for generating knots with a prescribed injectivity radius
Kyle Chapman
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 ran…