Three-dimensional terminally attached self-avoiding walks and bridges

  title={Three-dimensional terminally attached self-avoiding walks and bridges},
  author={Nathan Clisby and Andrew R. Conway and Anthony J. Guttmann},
  journal={arXiv: Statistical Mechanics},
We study terminally attached self-avoiding walks and bridges on the simple cubic lattice, both by series analysis and Monte Carlo methods. We provide strong numerical evidence supporting a scaling relation between self-avoiding walks, bridges, and terminally attached self-avoiding walks, and posit that a corresponding amplitude ratio is a universal quantity. 
Scale-free Monte Carlo method for calculating the critical exponent γ of self-avoiding walks
We implement a scale-free version of the pivot algorithm and use it to sample pairs of three-dimensional self-avoiding walks, for the purpose of efficiently calculating an observable that corresponds
Square lattice self-avoiding walks and biased differential approximants*
The model of self-avoiding lattice walks and the asymptotic analysis of power-series have been two of the major research themes of Tony Guttmann. In this paper we bring the two together and perform a
New scaling laws for self-avoiding walks: bridges and worms
We show how the theory of the critical behaviour of $d$-dimensional polymer networks gives a scaling relation for self-avoiding {\em bridges} that relates the critical exponent for bridges $\gamma_b$
Statistical Mechanics of Confined Polymer Networks
We show how the theory of the critical behaviour of d -dimensional polymer networks of arbitrary topology can be generalized to the case of networks confined by hyperplanes . This in particular
Partition and generating function zeros in adsorbing self-avoiding walks
The Lee-Yang theory of adsorbing self-avoiding walks is presented. It is shown that Lee-Yang zeros of the generating function of this model asymptotically accumulate uniformly on a circle in the
Fractal Dimensions of Self-Avoiding Walks and Ising High-Temperature Graphs in 3D Conformal Bootstrap
The fractal dimensions of polymer chains and high-temperature graphs in the Ising model both in three dimension are determined using the conformal bootstrap applied for the continuation of the O(N)
Winding angles of long lattice walks.
To a good approximation, the square winding angle of a self-avoiding walk on the cubic lattice can be obtained from the summation of the square change in the winding angles of lnN independent segments of the walk, where the ith segment contains 2(i) steps.
Phase transitions in single macromolecules: Loop-stretch transition versus loop adsorption transition in end-grafted polymer chains.
Both the loop-stretch and the loop adsorption transitions provide an exceptional opportunity to construct explicit analytical expressions for the crossover functions which perfectly describe all simulation results on static properties in the finite-size scaling regime.
Neural network learns physical rules for copolymer translocation through amphiphilic barriers
This work demonstrates that massively parallel Rosenbluth sampling for all possible sequences of a polymer allows for meaningful dynamic interpretation in terms of the mean first escape times through the membrane, and investigates how prediction accuracy depends on the distance of unexplored sequences from the training window.


Compressed self-avoiding walks, bridges and polygons
We study various self-avoiding walks (SAWs) which are constrained to lie in the upper half-plane and are subjected to a compressive force. This force is applied to the vertex or vertices of the walk
On the scaling limit of planar self-avoiding walk
A planar self-avoiding walk (SAW) is a nearest neighbor random walk path in the square lattice with no self-intersection. A planar self-avoiding polygon (SAP) is a loop with no self-intersection. In
Conformal invariance of the 3D self-avoiding walk.
It is shown that if the three-dimensional self-avoiding walk (SAW) is conformally invariant, then one can compute the hitting densities for the SAW in a half-space and in a sphere, and by Monte Carlo simulations these predictions are found to be excellent agreement.
Calculation of the connective constant for self-avoiding walks via the pivot algorithm
The connective constant for self-avoiding walks on the simple cubic lattice is estimated to be μ = 4.684 039 931 ± 0.000 000 027, to unprecedented accuracy, using a novel application of the pivot algorithm.
Accurate estimate of the critical exponent nu for self-avoiding walks via a fast implementation of the pivot algorithm.
A fast implementation of the pivot algorithm for self-avoiding walks is introduced, which is used to obtain large samples of walks on the cubic lattice of up to 33x10{6} steps, and the critical exponent nu is determined to great accuracy.
Self-avoiding walk enumeration via the lace expansion
We introduce a new method for the enumeration of self-avoiding walks based on the lace expansion. We also introduce an algorithmic improvement, called the two-step method, for self-avoiding walk
Two-dimensional polymer networks at a mixed boundary: Surface and wedge exponents
Abstract:We provide general formulae for the configurational exponents of an arbitrary polymer network connected to the surface of an arbitrary wedge of the two-dimensional plane, where the surface
Simulations of grafted polymers in a good solvent
We present improved simulations of three-dimensional self-avoiding walks with one end attached to an impenetrable surface on the simple cubic lattice. This surface can either be a-thermal, having
Efficient Implementation of the Pivot Algorithm for Self-avoiding Walks
The pivot algorithm for self-avoiding walks has been implemented in a manner which is dramatically faster than previous implementations, enabling extremely long walks to be efficiently simulated, and promises to be widely useful.