The linking number and the writhe of uniform random walks and polygons in confined spaces
From MaRDI portal
(Redirected from Publication:3407871)
Abstract: Random walks and polygons are used to model polymers. In this paper we consider the extension of writhe, self-linking number and linking number to open chains. We then study the average writhe, self-linking and linking number of random walks and polygons over the space of configurations as a function of their length. We show that the mean squared linking number, the mean squared writhe and the mean squared self-linking number of oriented uniform random walks or polygons of length , in a convex confined space, are of the form . Moreover, for a fixed simple closed curve in a convex confined space, we prove that the mean absolute value of the linking number between this curve and a uniform random walk or polygon of edges is of the form . Our numerical studies confirm those results. They also indicate that the mean absolute linking number between any two oriented uniform random walks or polygons, of edges each, is of the form O(n). Equilateral random walks and polygons are used to model polymers in -conditions. We use numerical simulations to investigate how the self-linking and linking number of equilateral random walks scale with their length.
Recommendations
- Linking of uniform random polygons in confined spaces
- Random linking of lattice polygons
- Linking number and writhe in random linear embeddings of graphs
- The second Vassiliev measure of uniform random walks and polygons in confined space
- The growth of the mean average crossing number of equilateral polygons in confinement
Cited in
(24)- Models of random knots
- The local topological free energy of proteins
- The linking number in systems with periodic boundary conditions
- Curvature of random walks and random polygons in confinement
- Linking number and writhe in random linear embeddings of graphs
- On the mean and variance of the writhe of random polygons
- A topological study of protein folding kinetics
- Linking of uniform random polygons in confined spaces
- The growth of the mean average crossing number of equilateral polygons in confinement
- scientific article; zbMATH DE number 1218937 (Why is no real title available?)
- LINKING OF RANDOM p-SPHERES IN Zd
- Linking matrices in systems with periodic boundary conditions
- The second Vassiliev measure of uniform random walks and polygons in confined space
- Linking and link complexity of geometrically constrained pairs of rings
- Polymers with spatial or topological constraints: theoretical and computational results
- Scaling of linking and writhing numbers for spherically confined and topologically equilibrated flexible polymers
- Folding complexity in a random-walk copolymer model
- The average inter-crossing number of equilateral random walks and polygons
- Linking number of monotonic cycles in random book embeddings of complete graphs
- The mean sum of squared linking numbers of random piecewise-linear embeddings of \(\mathrm{K}_n\)
- Modeling of chromosome intermingling by partially overlapping uniform random polygons
- HOMFLY-PT polynomials of open links
- Construction of weaving and polycatenane motifs from periodic tilings of the plane
- Vassiliev measures of complexity of open and closed curves in 3-space
This page was built for publication: The linking number and the writhe of uniform random walks and polygons in confined spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3407871)