arXiv subjects

Erica Uehara

Publications and source records attributed to Erica Uehara.

11 recordsLinked to original sources

arXiv2026

Random knotting in very long off-lattice self-avoiding polygons

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, for each $k$ between $10$ and $27$ we generated $2^{43-k}$ polygons of size $n=2^k$. Using a new knot diagram simplification and invariant-free knot classification code, we were able to determine the precise knot type of each polygon. The results show that the number of prime summands of knot type $K$ in a random $n$-gon is very well described by a Poisson distribution. We estimate the characteristic length of knotting as $656500 \pm 2500$. We use the count of summands for large $n$ to measure knotting rates and amplitude ratios of knot probabilities more accurately than previous experiments. Our calculations agree quite well with previous on-lattice computations, and support both knot localization and the knot entropy conjecture.

cond-mat.stat-mech↗

arXiv2025

Effects of multiple cycles on the resistance distance of a strand in a homogeneous polymer network

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 around it. Here we assume that phantom networks have no fixed points but their centers of mass are located at a point. The resistance distance corresponds to the mean-square deviation of the end-to-end vector along the strand connecting the adjacent vertices. We generate random networks with fixed valency $f$ but different densities of short cycles via a Metropolis method that rewires edges among four vertices chosen randomly. In the process the cycle rank is conserved. However, the densities of short cycles are determined by the rate of randomization $kT$ which appears in the acceptance ratio $\exp(-\Delta U/kT)$ of rewiring. If a strand has few short cycles around itself, the mean squared deviation of the strand is equal to $2/f$. If it is part of a short cycle, i.e., the network has a short loop which consists of a sequence of strands including the given strand itself, its resistance distance is smaller than $2/f$, while if it is not included in a cycle but adjacent to cycles, its resistance distance is larger than $2/f$. We show it via an electrical circuit analogy of the network. Moreover, we numerically show that the effect of multiple cycles on the resistance distance is expressed as a linear combination of the effects of isolated single cycles. It follows that cycles independently have an effect on the fluctuation properties of a strand in a polymer network.

cond-mat.soft↗

arXiv2025

An exact formula for the contraction factor of a subdivided Gaussian topological polymer

We consider the radius of gyration of a Gaussian topological polymer $G$ formed by subdividing a graph $G'$ of arbitrary topology (for instance, branched or multicyclic). We give a new exact formula for the expected radius of gyration and contraction factor of $G$ in terms of the number of subdivisions of each edge of $G'$ and a new weighted Kirchhoff index for $G'$. The formula explains and extends previous results for the contraction factor and Kirchhoff index of subdivided graphs.

cond-mat.stat-mech↗

arXiv2022

Radius of Gyration, Contraction Factors, and Subdivisions of Topological Polymers

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 appropriate multivariate Gaussian which takes into account the constraints imposed by the graph type. We recover the result that the expected radius of gyration can be given exactly in terms of the Kirchhoff index of the graph. We then consider the expected radius of gyration of a topological polymer whose edges are subdivided into $n$ pieces. We prove that the contraction factor of a subdivided polymer approaches a limit as the number of subdivisions increases, and compute the limit exactly in terms of the degree-Kirchhoff index of the original graph. This limit corresponds to the thermodynamic limit in statistical mechanics and is fundamental in the physics of topological polymers. Furthermore, these asymptotic contraction factors are shown to fit well with molecular dynamics simulations.

cond-mat.stat-mech↗

arXiv2022

Random graph embeddings with general edge potentials

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. This includes freely jointed chains, steric effects, Lennard-Jones potentials, bending energies, and other physically realistic models. A configuration of $n$ monomers in $\mathbb{R}^d$ can be written as a collection of $d$ coordinate vectors, each in $\mathbb{R}^n$. Our first main result is that entries from different coordinate vectors are uncorrelated, even when they are different coordinates of the same monomer. We predict that this property holds in realistic simulations and in actual polymer configurations (in the absence of an external field). Our second main contribution is a theorem explaining when and how a probability distribution on embeddings of a complicated graph may be pushed forward to a distribution on embeddings of a simpler graph to aid in computations. This construction is based on the idea of chain maps in homology theory. We use it to give a new formula for edge covariances in phantom network theory and to compute some expectations for a freely-jointed network.

cond-mat.stat-mech↗

arXiv2020

Factoring the Laplacian to understand topological polymers

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 transpose allows us to show that for a more complicated network, the steps must lie in a linear subspace determined by the graph topology. This provides a useful new perspective on the James--Guth theory of phantom elastic networks. In particular, we formulate phantom networks which are free from the constraints of fixed crosslinks. For a given network the solution of the loop constraints makes the partition function finite-valued in the path integral formulation without applying any external forces or fixing any monomer positions. The resulting probability distribution on edge displacements is rotationally invariant, which is practically quite useful for generating unbiased random samples of edge displacements and monomer positions. Furthermore, one can exactly calculate many physical quantities such as correlation functions with respect to this distribution. Finally, this reformulation lends itself well to the case of non-Gaussian distributions. We illustrate this by computing the expected radius of gyration of a ring polymer in a wide variety of models.

cond-mat.stat-mech↗

arXiv2017

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 (RP) 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 $r_{\rm ex}$. 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 $r_{\rm ex}$. 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 relation among the estimates of a fitting parameter for all prime knots, which suggests the local knot picture. Here we remark that the cylindrical SAP gives a model of circular DNA which are negatively charged and semiflexible, where radius $r_{\rm ex}$ corresponds to the screening length.

cond-mat.soft↗

arXiv2017

Scaling behavior of knotted random polygons and self-avoiding polygons: Topological swelling with enhanced exponent

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 of segments is large. We call it topological swelling. We argue an "enhancement" of the scaling exponent for random polygons with a fixed knot. We study them systematically through SAP consisting of hard cylindrical segments with various different values of the radius of segments. Here we mean by the average size the mean-square radius of gyration. Furthermore, we show numerically that the equilibrium length of a composite knot is given by the sum of those of all constituent prime knots. Here we define the equilibrium length of a knot by such a number of segments that topological entropic repulsions are balanced with the knot complexity in the average size. The additivity suggests the local knot picture.

cond-mat.soft↗

arXiv2016

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

For various polymers with different topological structures we numerically evaluate the mean-square radius of gyration and the hydrodynamic radius systematically through simulation. We call polymers with nontrivial topology topological polymers. We evaluate the two quantities both for ideal and real chain models and show that the ratios of the quantities among different topological types 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 topological polymers expressed with complex graphs.

cond-mat.soft↗

arXiv2016

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.

cond-mat.stat-mech↗

arXiv2013

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

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-Avoiding Polygon (SAP) under a topological constraint. We evaluate short-distance exponents $θ(i,j)$ through the probability distribution functions of the distance between the $i$th and $j$th vertices of $N$-step SAW (or SAP with a knot) for all pairs ($1 \le i, j \le 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 interchain 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.

cond-mat.stat-mech↗