Related papers: Self-avoiding walks and polygons on the triangular…
We use the lattice model of directed walks to investigate the conformational as well as the adsorption properties of a semiflexible homopolymer chain immersed in a good solvent in two and three dimensions. To account for the stiffness in…
We compute the exponent gamma for self-avoiding walks in three dimensions. We get gamma = 1.1575 +- 0.0006 in agreement with renormalization-group predictions. Earlier Monte Carlo and exact-enumeration determinations are now seen to be…
The lace expansion is a powerful tool for analysing the critical behaviour of self-avoiding walks and percolation. It gives rise to a recursion relation which we abstract and study using an adaptation of the inductive method introduced by…
The aim of this survey is to explain, in a self-contained and relatively beginner-friendly manner, the lace expansion for the nearest-neighbor models of self-avoiding walk and percolation that converges in all dimensions above 6 and 9,…
Self-avoiding walks (SAWs) were introduced in chemistry to model the real-life behavior of chain-like entities such as solvents and polymers, whose physical volume prohibits multiple occupation of the same spatial point. In mathematics, a…
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 perform a numerical study of a new microcanonical polymer model on the three dimensional cubic lattice, consisting of ideal chains whose range and number of nearest-neighbor contacts are fixed to given values. Our simulations suggest an…
The self-avoiding walk on the square site-diluted correlated percolation lattice is considered. The Ising model is employed to realize the spatial correlations of the metric space. As a well-accepted result, the (generalized) Flory's mean…
We show numerically that critical exponents for two-point interchain correlation of an infinite chain characterize those of finite chains in Self-Avoiding Walk (SAW) and Self-Avoiding Polygon (SAP) under a topological constraint. We…
We prove error bounds in a central limit theorem for solutions of certain convolution equations. The main motivation for investigating these equations stems from applications to lace expansions, in particular to weakly self-avoiding random…
Prudent walks are self-avoiding walks on the square lattice which never step into the direction of an already occupied vertex. We study the closed version of these walks, called prudent polygons, where the last vertex is adjacent to the…
In this thesis we study in detail the self-intersection properties of Random Walks. Although notoriously hard to tackle, these properties are crucially related to the excluded-volume effect and other central features of real polymers. Our…
We present simulations of self-avoiding random walks on 2-d lattices with the topology of an infinitely long cylinder, in the limit where the cylinder circumference L is much smaller than the Flory radius. We study in particular the…
We formulate an irreversible Markov chain Monte Carlo algorithm for the self-avoiding walk (SAW), which violates the detailed balance condition and satisfies the balance condition. Its performance improves significantly compared to that of…
We use a one-dimensional random walk on $D$-dimensional hyper-spheres to determine the critical behavior of statistical systems in hyper-spherical geometries. First, we demonstrate the properties of such walk by studying the phase diagram…
In this paper we present a new and flexible method to show that, in one dimension, various self-repellent random walks converge to self-repellent Brownian motion in the limit of weak interaction after appropriate space-time scaling. Our…
Using the results obtained by the non commutative geometry techniques applied to the Harper equation, we derive the areas distribution of random walks of length $ N $ on a two-dimensional square lattice for large $ N $, taking into account…
Exactly solvable models of planar polygons, weighted by perimeter and area, have deepened our understanding of the critical behaviour of polygon models in recent years. Based on these results, we derive a conjecture for the exact form of…
The self-avoid random walk algorithm has been extensively used in the study of polymers. In this work we study the basic properties of the trajectories generated with this algorithm when two interactions are added to it: contact and folding…
The Fisher transformation acts on cubic graphs by replacing each vertex by a triangle. We explore the action of the Fisher transformation on the set of self-avoiding walks of a cubic graph. Iteration of the transformation yields a sequence…