33 citations · 106 across the 10 of their papers we have counts for
11 papers
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…
Effects of multiple cycles on the resistance distance of a strand in a homogeneous polymer network
Erica Uehara, Tetsuo Deguchi
We show that the resistance distance between a pair of adjacent vertices in a phantom network generated randomly by a Monte-Carlo method depends on the existence of short cycles ar…
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…
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…
Scaling behavior of knotted random polygons and self-avoiding polygons: Topological swelling with enhanced exponent
Erica Uehara, Tetsuo Deguchi
We show that the average size of self-avoiding polygons (SAP) with a fixed knot is much larger than that of no topological constraint if the excluded volume is small and the number…
Knotting probability of self-avoiding polygons under a topological constraint
Erica Uehara, Tetsuo Deguchi
We define the knotting probability of a knot by the probability for a random polygon (RP) or self-avoiding polygon (SAP) of segments having the knot type . We show funda…
Statistical and hydrodynamic properties of topological polymers for various graphs showing enhanced short-range correlation
Erica Uehara, Tetsuo Deguchi
For various polymers with different topological structures we numerically evaluate the mean-square radius of gyration and the hydrodynamic radius systematically through simulation.…
A Fast Direct Sampling Algorithm for Equilateral Closed Polygons
Jason Cantarella, Bertrand Duplantier, Clayton Shonkwiler +1
Sampling equilateral closed polygons is of interest in the statistical study of ring polymers. Over the past 30 years, previous authors have proposed a variety of simple Markov cha…
Exponents of interchain correlation for self-avoiding walks and knotted self-avoiding polygons
Erica Uehara, Tetsuo Deguchi
We show numerically that critical exponents for two-point interchain correlation of an infinite chain characterize those of finite chains in Self-Avoiding Walk (SAW) and Self-Avoid…