The linking number and the writhe of uniform random walks and polygons in confined spaces

From MaRDI portal
Publication:3407871

DOI10.1088/1751-8113/43/4/045208zbMATH Open1187.82052arXiv0907.3805OpenAlexW3105607542MaRDI QIDQ3407871FDOQ3407871


Authors: Eleni Panagiotou, Kenneth C. Millett, Sofia Lambropoulou Edit this on Wikidata


Publication date: 24 February 2010

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

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 n, in a convex confined space, are of the form O(n2). 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 n edges is of the form O(sqrtn). 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 n edges each, is of the form O(n). Equilateral random walks and polygons are used to model polymers in heta-conditions. We use numerical simulations to investigate how the self-linking and linking number of equilateral random walks scale with their length.


Full work available at URL: https://arxiv.org/abs/0907.3805




Recommendations




Cited In (20)





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)