相关论文: Radius of Gyration, Contraction Factors, and Subdi…
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…
It is nontrivial whether the average size of a ring polymer should become smaller or larger under a topological constraint. Making use of some knot invariants, we evaluate numerically the mean square radius of gyration for ring polymers…
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…
Numerical studies of the average size of trivially knotted polymer loops with no excluded volume are undertaken. Topology is identified by Alexander and Vassiliev degree 2 invariants. Probability of a trivial knot, average gyration radius,…
Several nontrivial properties are shown for the mean square radius of gyration $R_K^2$ of ring polymers with a fixed knot type K. Through computer simulation, we discuss both finite-size and asymptotic behaviors of the gyration radius under…
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,…
Suppose we have an embedding of a graph $\mathbf{G}$ created by subdividing the edges of a simpler graph $\mathbf{G'}$. The edges of $\mathbf{G}$ can be divided into subsets which join pairs of ``junction'' vertices in $\mathbf{G'}$. The…
We present computer simulations to examine probability distributions of gyration radius for the no-thickness closed polymers of N straight segments of equal length. We are particularly interested in the conditional distributions when the…
The work in this article is inspired by a classical problem: the statistical physical properties of a closed polymer loop that is wound around a rod. Historically the preserved topology of this system has been addressed through…
The mathematical derivation of the mean square radius of gyration, <s2x>, of branched polymers is reinvestigated from a kinetic-equation-point of view. In particular we derive the corresponding quantity of the A-R-Bf-1 model; the result…
The present research is dedicated to provide deeper understanding of the impact of complex architecture of branched polymers on their behaviour in solvents. The folding dynamics of macromolecules and hydrodynamics of polymer fluids are…
We consider flexible branched polymer, with quenched branch structure, and show that its conformational entropy as a function of its gyration radius $R$, at large $R$, obeys, in the scaling sense, $\Delta S \sim R^2/(a^2L)$, with $a$ bond…
We study knotted polymers in equilibrium with an array of obstacles which models confinement in a gel or immersion in a melt. We find a crossover in both the geometrical and the topological behavior of the polymer. When the polymers' radius…
Simulations of knotting and unknotting in polymers or other filaments rely on random processes to facilitate topological changes. Here we introduce a method of \textit{topological steering} to determine the optimal pathway by which a…
We consider a random graph G(n,p) whose vertex set V has been randomly embedded in the unit square and whose edges are given weight equal to the geometric distance between their end vertices. Then each pair {u,v} of vertices have a distance…
We consider a one-dimensional directed polymer in a random potential which is characterized by the Gaussian statistics with the finite size local correlations. It is shown that the well-known Kardar's solution obtained originally for a…
We consider polymers attached to the tip of a cone, and the resulting force due to entropy loss on approaching a plate (or another cone). At separations shorter than the polymer radius of gyration R_g, the only relevant length scale is the…
An algorithm observes the trajectories of random walks over an unknown graph $G$, starting from the same vertex $x$, as well as the degrees along the trajectories. For all finite connected graphs, one can estimate the number of edges $m$ up…
The conformations of topologically constrained double-folded ring polymers can be described as wrappings of randomly branched primitive trees. We extend previous work on the tree statistics under different (solvent) conditions to explore…
The step-growth polymerisation of a mixture of arbitrary-functional monomers is viewed as a time-continuos random graph process with degree bounds that are not necessarily the same for different vertices. The sequence of degree bounds acts…