4 citations · 7 across the 9 of their papers we have counts for
7 papers · 1 filter
Random knotting in very long off-lattice self-avoiding polygons
Jason Cantarella, Tetsuo Deguchi, Henrik Schumacher +2
We present experimental results on knotting in off-lattice self-avoiding polygons in the bead-chain model. Using Clisby's tree data structure and the scale-free pivot algorithm, fo…
An exact formula for the contraction factor of a subdivided Gaussian topological polymer
Jason Cantarella, Tetsuo Deguchi, Clayton Shonkwiler +1
We consider the radius of gyration of a Gaussian topological polymer formed by subdividing a graph of arbitrary topology (for instance, branched or multicyclic). We give a…
A faster direct sampling algorithm for equilateral closed polygons and the probability of knotting
Jason Cantarella, Henrik Schumacher, Clayton Shonkwiler
We present a faster direct sampling algorithm for random equilateral closed polygons in three-dimensional space. This method improves on the moment polytope sampling algorithm of C…
Random graph embeddings with general edge potentials
Jason Cantarella, Tetsuo Deguchi, Clayton Shonkwiler +1
In this paper, we study random embeddings of polymer networks distributed according to any potential energy which can be expressed in terms of distances between pairs of monomers.…
Radius of Gyration, Contraction Factors, and Subdivisions of Topological Polymers
Jason Cantarella, Tetsuo Deguchi, Clayton Shonkwiler +1
We consider the topologically constrained random walk model for topological polymers. In this model, the polymer forms an arbitrary graph whose edges are selected from an appropria…
Factoring the Laplacian to understand topological polymers
Jason Cantarella, Tetsuo Deguchi, Clayton Shonkwiler +1
A ring polymer is a random walk whose steps obey a single linear condition; their sum vanishes. Factoring the graph Laplacian into the product of the incidence matrix and its trans…