Related papers: Adsorption of self-avoiding walks at a defect
Stretched polymers with attractive interaction are studied in two and three dimensions. They are described by biased self-avoiding random walks with nearest neighbour attraction. The bias corresponds to opposite forces applied to the first…
Polymer chains with hard-core interaction on a two-dimensional lattice are modeled by directed random walks. Two models, one with intersecting walks (IW) and another with non-intersecting walks (NIW) are presented, solved and compared. The…
We study the motion of a particle on the two-dimensional honeycomb lattice, whose sites are occupied by either flipping rotators or flipping mirrors, which scatter the particle according to a deterministic rule. For both types of scatterers…
We obtain the solution of models of self-avoiding walks with attractive interactions on Husimi lattices built with squares. Two attractive interactions are considered: between monomers on first-neighbor sites and not consecutive along a…
The phase diagram and surface critical behaviour of the vertex-interacting self-avoiding walk are examined using transfer matrix methods extended using DMRG and coupled with finite-size scaling. Particular attention is paid to the critical…
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 consider self-avoiding walk and percolation in $\Zd$, oriented percolation in $\Zd\times\Zp$, and the contact process in $\Zd$, with $p D(\cdot)$ being the coupling function whose range is denoted by $L<\infty$. For percolation, for…
We have studied a model of self-attracting walk proposed by Sapozhnikov using Monte Carlo method. The mean square displacement $ < R^2(t) > \sim t^{2\nu}$ and the mean number of visited sites $ < S(t) > \sim t^{k}$ are calculated for one-,…
The statistics of a long closed self-avoiding walk (SAW) or polymer ring on a $ d $-dimensional lattice obeys hyperscaling. The combination $ p_N \left\langle R^2 \right\rangle^{ d/2}_N\mu^{ -N}, $ (where $ p_N $ is the number of…
The critical adsorption point (CAP) of self-avoiding walks (SAW) interacting with a planar surface with surface disorder or sequence disorder has been studied. We present theoretical equations, based on ones previously developed by Soteros…
We prove several rigorous results about the asymptotic behaviour of the numbers of polygons and self-avoiding walks confined to a square on the square lattice. Specifically we prove that the dominant asymptotic behaviour of polygons…
In a recent letter, a simple method was proposed to generate solvable models that predict the critical properties of statistical systems in hyperspherical geometries. To that end, it was shown how to reduce a random walk in $D$ dimensions…
We explore the critical behaviour of two and three dimensional lattice models of polymers in dilute solution where the monomers carry a magnetic moment which interacts ferromagnetically with near-neighbour monomers. Specifically, the model…
We have analyzed geometric and topological features of self-avoiding walks. We introduce a new kind of walk: the loop-deleted self-avoiding walk (LDSAW) motivated by the interaction of chromatin with the nuclear lamina. Its critical…
We solve a model of polymers represented by self-avoiding walks on a lattice which may visit the same site up to three times in the grand-canonical formalism on the Bethe lattice. This may be a model for the collapse transition of polymers…
We consider lattice self-avoiding walks and discuss the dynamic critical behavior of two dynamics that use local and bilocal moves and generalize the usual reptation dynamics. We determine the integrated and exponential autocorrelation…
We study the conformational properties of polymers in presence of extended columnar defects of parallel orientation. Two classes of macromolecules are considered: the so-called partially directed polymers with preferred orientation along…
We use new algorithms, based on the finite lattice method of series expansion, to extend the enumeration of self-avoiding walks and polygons on the triangular lattice to length 40 and 60, respectively. For self-avoiding walks to length 40…
We show that the critical density of the Activated Random Walk model on $\mathbb{Z}^d$ is strictly less than one when the sleep rate $\lambda$ is small enough, and tends to $0$ when $\lambda\to 0$, in any dimension $d\geqslant 1$. As far as…
We consider nearest neighbour spatial random permutations on $\mathbb{Z}^d$. In this case, the energy of the system is proportional the sum of all cycle lengths, and the system can be interpreted as an ensemble of edge-weighted, mutually…