相关论文: Characteristic length of random knotting for cylin…
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}$…
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…
The knotting probability is defined by the probability with which an $N$-step self-avoiding polygon (SAP) with a fixed type of knot appears in the configuration space. We evaluate these probabilities for some knot types on a simple cubic…
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…
The probability of a random polygon (or a ring polymer) having a knot type $K$ should depend on the complexity of the knot $K$. Through computer simulation using knot invariants, we show that the knotting probability decreases exponentially…
The size of a zero thickness (no excluded volume) polymer ring is shown to scale with chain length $N$ in the same way as the size of the excluded volume (self-avoiding) linear polymer, as $N^{\nu}$, where $\nu \approx 0.588$. The…
We give two different, statistically consistent definitions of the length l of a prime knot tied into a polymer ring. In the good solvent regime the polymer is modelled by a self avoiding polygon of N steps on cubic lattice and l is the…
Stochastic simulations are used to characterize the knotting distributions of random ring polymers confined in spheres of various radii. The approach is based on the use of multiple Markov chains and reweighting techniques, combined with…
We consider the probability of knotting in equilateral random polygons in Euclidean 3-dimensional space, which model, for instance, random polymers. Results from an extensive Monte Carlo dataset of random polygons indicate a universal…
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…
Let $p_n$ denote the number of self-avoiding polygons of length $n$ on a regular three-dimensional lattice, and let $p_n(K)$ be the number which have knot type $K$. The probability that a random polygon of length $n$ has knot type $K$ is…
In thermally fluctuating long linear polymeric chain in solution, the ends come from time to time into a direct contact or a close vicinity of each other. At such an instance, the chain can be regarded as a closed one and thus will form a…
We present a computer simulation study of the compact self-avoiding loops as regards their length and topological state. We use a Hamiltonian closed path on the cubic-shaped segment of a 3D cubic lattice as a model of a compact polymer. The…
By performing Monte Carlo sampling of $N$-steps self-avoiding polygons embedded on different Bravais lattices we explore the robustness of universality in the entropic, metric and geometrical properties of knotted polymer rings. In…
A physical interpretation of the rope simulated by the SONO algorithm is presented. Properties of the tight polygonal knots delivered by the algorithm are analyzed. An algorithm for bounding the ropelength of a smooth inscribed knot is…
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…
The work addresses the analogy between trivial knotting and excluded volume in looped polymer chains of moderate length, $N<N_0$, where the effects of knotting are small. A simple expression for the swelling seen in trivially knotted loops…
An analysis of extensive simulations of interacting self-avoiding polygons on cubic lattice shows that the frequencies of different knots realized in a random, collapsed polymer ring decrease as a negative power of the ranking order, and…
We study several related models of self-avoiding polygons in a tubular subgraph of the simple cubic lattice, with a particular interest in the asymptotics of the knotting statistics. Polygons in a tube can be characterised by a finite…
An explicit expression is derived for the scattering function of a self-avoiding polymer chain in a $d$-dimensional space. The effect of strength of segment interactions on the shape of the scattering function and the radius of gyration of…