K. Chapman

most citedOff-Lattice Random Walks with Excluded Volume: A New Method of Generation, Proof of Ergodicity and Numerical Results

3 citations · 3 across the 1 of their papers we have counts for

collaborators

2 papers

cond-mat.stat-mech2018

Open and closed random walks with fixed edgelengths in $R^{d}$

Jason Cantarella, Kyle Chapman, Philipp Reiter +1

In this paper, we consider fixed edgelength $n$ -step random walks in $R^{d}$ . 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 $R^{3}$ and prove that our meth…

Open and closed random walks with fixed edgelengths in Rd

Off-Lattice Random Walks with Excluded Volume: A New Method of Generation, Proof of Ergodicity and Numerical Results

Open and closed random walks with fixed edgelengths in $R^{d}$