相关论文: Scaling of Self-Avoiding Walks and Self-Avoiding T…

We present a high-statistics Monte Carlo determination of the exponent gamma for self-avoiding walks on a Manhattan lattice in two dimensions. A conservative estimate is $\gamma \gtapprox 1.3425(3)$, in agreement with the universal value…

The surface critical behaviour of the interacting self-avoiding trail is examined using transfer matrix methods coupled with finite-size scaling. Particular attention is paid to the critical exponents at the ordinary and special points…

The analysis of the radial distribution function of a system provides a possible procedure for uncovering interaction rules between individuals out of collective movement patterns. This approach from classical statistical mechanics has…

We analyse new exact enumeration data for self-avoiding polygons, counted by perimeter and area on the square, triangular and hexagonal lattices. In extending earlier analyses, we focus on the perimeter moments in the vicinity of the…

A growing self-avoiding walk (GSAW) is a stochastic process that starts from the origin on a lattice and grows by occupying an unoccupied adjacent lattice site at random. A sufficiently long GSAW will reach a state in which all adjacent…

Oriented self-avoiding walks (OSAWs) on a square lattice are studied, with binding energies between steps that are oriented parallel across a face of the lattice. By means of exact enumeration and Monte Carlo simulation, we reconstruct the…

In order to study long chain polymers many lattice models accommodate a pulling force applied to a particular part of the chain, often a free endpoint. This is in addition to well-studied features such as energetic interaction between the…

In [BEI] we introduced a Levy process on a hierarchical lattice which is four dimensional, in the sense that the Green's function for the process equals 1/x^2. If the process is modified so as to be weakly self-repelling, it was shown that…

In two dimensions polymer collapse has been shown to be complex with multiple low temperature states and multi-critical points. Recently, strong numerical evidence has been provided for a long-standing prediction of universal scaling of…

Various types of walks on complex networks have been used in recent years to model search and navigation in several kinds of systems, with particular emphasis on random walks. This gives valuable information on network properties, but…

We review the existence of the infinite length self-avoiding walk in the half plane and its relationship to bridges. We prove that this probability measure is also given by the limit as $\beta \rightarrow \beta_c-$ of the probability…

We study self-avoiding walk on graphs whose automorphism group has a transitive nonunimodular subgroup. We prove that self-avoiding walk is ballistic, that the bubble diagram converges at criticality, and that the critical two-point…

This paper proves the formula \nu(d) =1 for d=1 and \nu(d) = max(1/4 +1/d, 1/2) for d > 1 for the root mean square displacement exponent \nu(d) of the self-avoiding walk (SAW) in Z^d, and thus, resolves some major long-standing open…

We have simulated four-dimensional interacting self-avoiding trails (ISAT) on the hyper-cubic lattice with standard interactions at a wide range of temperatures up to length 4096 and at some temperatures up to length 16384. The results…

Counting the number of N-step self-avoiding walks (SAWs) on a lattice is one of the most difficult problems of enumerative combinatorics. Once we give up calculating the exact number of them, however, we have a chance to apply powerful…

We consider a self-avoiding walk on the dual $\mathbb{Z}^2$ lattice. This walk can traverse the same square twice but cannot cross the same edge more than once. The weight of each square visited by the walk depends on the way the walk…

We present a Monte Carlo study of Kinetic Growth Walk on square as well as triangular lattice to show that it is not equivalent to canonical Self Avoiding Walk.

We study the variable-length ensemble of self-avoiding walks on the complete graph. We obtain the leading order asymptotics of the mean and variance of the walk length, as the number of vertices goes to infinity. Central limit theorems for…

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 thus only an entropic effect, or attractive.…

We investigate, by series methods, the behaviour of interacting self-avoiding walks (ISAWs) on the honeycomb lattice and on the square lattice. This is the first such investigation of ISAWs on the honeycomb lattice. We have generated data…