Related papers: Monte Carlo Results for Projected Self-Avoiding Po…
We study the localisation of lattice polymer models near a permeable interface in two dimensions. Localisation can arise due to an interaction between the polymer and the interface, and can be altered by a preference for the bulk solvent on…
A linear polymer grafted to a hard wall and underneath an AFM tip can be modelled in a lattice as a grafted lattice polymer (or self-avoiding walk) compressed underneath a piston approaching the wall. As the piston approaches the wall the…
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…
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…
Compact polymers are self-avoiding random walks which visit every site on a lattice. This polymer model is used widely for studying statistical problems inspired by protein folding. One difficulty with using compact polymers to perform…
We introduce several bilocal algorithms for lattice self-avoiding walks that provide reasonable models for the physical kinetics of polymers in the absence of hydrodynamic effects. We discuss their ergodicity in different confined…
We study by Monte Carlo simulations a model of knotted polymer ring adsorbing onto an impenetrable, attractive wall. The polymer is described by a self-avoiding polygon (SAP) on the cubic lattice. We find that the adsorption transition…
An implementation of BFACF-style algorithms on knotted polygons in the simple cubic, face centered cubic and body centered cubic lattice is used to estimate the statistics and writhe of minimal length knotted polygons in each of the…
We present computer simulations of a dynamic Monte Carlo algorithm for polymer chains on the FCC lattice which takes explicitly into account the possibility to overcome topological constraints by controlling the rate at which nearby polymer…
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…
We solve a model of self-avoiding walks with up to two monomers per site on the Bethe lattice. This model, inspired on the Domb-Joyce model, was recently proposed to describe the collapse transition observed in interacting polymers [J.…
We investigate polymers pulled away from an interacting surface, where the force is applied to the untethered endpoint and at an angle $\theta$ to the surface. We use the canonical self-avoiding walk model of polymers and obtain the phase…
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…
By large-scale Monte Carlo simulations of semiflexible polymers in $d=2$ dimensions the applicability of the Kratky-Porod model is tested. This model is widely used as "standard model" for describing conformations and force versus extension…
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…
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 use Brownian dynamics simulations and advanced topological profiling methods to characterize the out-of-equilibrium evolution of self-entanglement in linear polymers confined into nano-channels and under periodic compression. We…
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…
We probe the character of knotting in open, confined polymers, assigning knot types to open curves by identifying their projections as virtual knots. In this sense, virtual knots are transitional, lying in between classical knot types,…
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…