Erica Uehara

A fast direct sampling algorithm for equilateral closed polygons

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 chain algorithms (but have not been able to show that they converge to the correct probability distribution) and complicated direct samplers (which require extended-precision arithmetic to evaluate numerically unstable polynomials). We present a simple direct sampler which is fast and numerically stable, and analyze its runtime using a new formula for the volume of equilateral polygon space as a Dirichlet-type integral.

Statistical and hydrodynamic properties of topological polymers for various graphs showing enhanced short-range correlation

For various polymers with different structures in chemical connectivity expressed by graphs, we numerically evaluate the mean-square radius of gyration and the hydrodynamic radius systematically through simulation. We call polymers with nontrivial structures in chemical connectivity and those of nontrivial topology of spatial graphs as embeddings in three dimensions topological polymers. We evaluate the two quantities both for ideal and real chain models and show that the ratios of the quantities among different structures in chemical connectivity do not depend on the existence of excluded volume if the topological polymers have only up to trivalent vertices, as far as the polymers investigated. We also evaluate the ratio of the gyration radius to the hydrodynamic radius, which we expect to be universal from the viewpoint of renormalization group. Furthermore, we show that the short-distance intrachain correlation is much enhanced for real topological polymers (the Kremer-Grest model) expressed with complex graphs.

Characteristic length of the knotting probability revisited.

We present a self-avoiding polygon (SAP) model for circular DNA in which the radius of impermeable cylindrical segments corresponds to the screening length of double-stranded DNA surrounded by counter ions. For the model we evaluate the probability for a generated SAP with N segments having a given knot K through simulation. We call it the knotting probability of a knot K with N segments for the SAP model. We show that when N is large the most significant factor in the knotting probability is given by the exponentially decaying part exp(-N/NK), where the estimates of parameter NK are consistent with the same value for all the different knots we investigated. We thus call it the characteristic length of the knotting probability. We give formulae expressing the characteristic length as a function of the cylindrical radius rex, i.e. the screening length of double-stranded DNA.

Exponents of intrachain correlation for self-avoiding walks and knotted self-avoiding polygons

We show numerically that critical exponents for two-point intrachain correlation of an infinite chain characterize those of finite chains in self-avoiding walk (SAW) and self-avoiding polygon (SAP) under a topological constraint. We evaluate short-distance exponents ?(i, j) through the probability distribution functions of the distance between the ith and jth vertices of N-step SAW (or SAP with a knot) for all pairs (1 ? i, j ? N). We construct the contour plot of ?(i, j), and express it as a function of i and j. We suggest that it has quite a simple structure. Here exponents ?(i, j) generalize des Cloizeaux?s three critical exponents for short-distance intrachain correlation of SAW, and we show the crossover among them. We also evaluate the diffusion coefficient of knotted SAP for a few knot types, which can be calculated with the probability distribution functions of the distance between two nodes.

Knotting probability of self-avoiding polygons under a topological constraint

We define the knotting probability of a knot K by the probability for a random polygon or self-avoiding polygon (SAP) of N segments having the knot type K. We show fundamental and generic properties of the knotting probability particularly its dependence on the excluded volume. We investigate them for the SAP consisting of hard cylindrical segments of unit length and radius rex. For various prime and composite knots, we numerically show that a compact formula describes the knotting probabilities for the cylindrical SAP as a function of segment number N and radius rex. It connects the small-N to the large-N behavior and even to lattice knots in the case of large values of radius. As the excluded volume increases, the maximum of the knotting probability decreases for prime knots except for the trefoil knot. If it is large, the trefoil knot and its descendants are dominant among the nontrivial knots in the SAP. From the factorization property of the knotting probability, we derive a sum rule among the estimates of a fitting parameter for all prime knots, which suggests the local knot picture and the dominance of the trefoil knot in the case of large excluded volumes. Here we remark that the cylindrical SAP gives a model of circular DNA which is negatively charged and semiflexible, where radius rex corresponds to the screening length.

Statistical and Dynamical Properties of Topological Polymers with Graphs and Ring Polymers with Knots

We review recent theoretical studies on the statistical and dynamical properties of polymers with nontrivial structures in chemical connectivity and those of polymers with a nontrivial topology, such as knotted ring polymers in solution. We call polymers with nontrivial structures in chemical connectivity expressed by graphs “topological polymers”. Graphs with no loop have only trivial topology, while graphs with loops such as multiple-rings may have nontrivial topology of spatial graphs as embeddings in three dimensions, e.g., knots or links in some loops. We thus call also such polymers with nontrivial topology “topological polymers”, for simplicity. For various polymers with different structures in chemical connectivity, we numerically evaluate the mean-square radius of gyration and the hydrodynamic radius systematically through simulation. We evaluate the ratio of the gyration radius to the hydrodynamic radius, which we expect to be universal from the viewpoint of the renormalization group. Furthermore, we show that the short-distance intrachain correlation is much enhanced for real topological polymers (the Kremer–Grest model) expressed with complex graphs. We then address topological properties of ring polymers in solution. We define the knotting probability of a knot K by the probability that a given random polygon or self-avoiding polygon of N vertices has the knot K. We show a formula for expressing it as a function of the number of segments N, which gives good fitted curves to the data of the knotting probability versus N. We show numerically that the average size of self-avoiding polygons with a fixed knot can be much larger than that of no topological constraint if the excluded volume is small. We call it “topological swelling”.

Statistical and hydrodynamic properties of double-ring polymers with a fixed linking number between twin rings

For a double-ring polymer in solution we evaluate the mean-square radius of gyration and the diffusion coefficient through simulation of off-lattice self-avoiding double polygons consisting of cylindrical segments with radius rex of unit length. Here, a self-avoiding double polygon consists of twin self-avoiding polygons which are connected by a cylindrical segment. We show numerically that several statistical and dynamical properties of double-ring polymers in solution depend on the linking number of the constituent twin ring polymers. The ratio of the mean-square radius of gyration of self-avoiding double polygons with zero linking number to that of no topological constraint is larger than 1, in particular, when the radius of cylindrical segments rex is small. However, the ratio is almost constant with respect to the number of vertices, N, and does not depend on N. The large-N behavior of topological swelling is thus quite different from the case of knotted random polygons.