相关论文: Two-dimensional oriented self-avoiding walks with …
We model a set of point-to-point transports on a network as a system of polydisperse interacting self-avoiding walks (SAWs) over a finite square lattice. The ends of each SAW may be located both at random, uniformly distributed, positions…
We theoretically investigate a tight binding model of fermions hopping on the square-octagon lattice which consists of a square lattice with plaquette corners themselves decorated by squares. Upon the inclusion of second neighbor spin-orbit…
The present paper is dedicated to the 2-dimensional Interacting Partially Directed Self Avoiding Walk constrained to remain in the upper-half plan and interacting with the horizontal axis. The model has been introduced in \cite{F90} to…
Contact matrices provide a coarse grained description of the configuration omega of a linear chain (polymer or random walk) on Z^n: C_{ij}(omega)=1 when the distance between the position of the i-th and j-th step are less than or equal to…
A mixture of hard squares, dimers and vacancies on a square lattice is known to undergo a transition from a low-density disordered phase to high-density columnar ordered phase. Along the fully packed square-dimer line, the system undergoes…
The pivot algorithm is a Markov Chain Monte Carlo algorithm for simulating the self-avoiding walk. At each iteration a pivot which produces a global change in the walk is proposed. If the resulting walk is self-avoiding, the new walk is…
We explore the phase diagram of the O($n$) loop model on the square lattice in the $(x,n)$ plane, where $x$ is the weight of a lattice edge covered by a loop. These results are based on transfer-matrix calculations and finite-size scaling.…
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…
The smart kinetic self-avoiding walk (SKSAW) is a random walk which never intersects itself and grows forever when run in the full-plane. At each time step the walk chooses the next step uniformly from among the allowable nearest neighbors…
In the loop $O(n)$ model a collection of mutually-disjoint self-avoiding loops is drawn at random on a finite domain of a lattice with probability proportional to $${\lambda^{\# \mbox{edges}} n^{\# \mbox{loops}},}$$ where $\lambda, n \in…
We study an isotropic Heisenberg spin-1/2 model on a trellis ladder which is composed of two $J_1-J_2$ zigzag ladders interacting through anti-ferromagnetic rung couplings $J_3$. The $J_1$ and $J_2$ are ferromagnetic zigzag spin interaction…
A $\delta$ once-reinforced random walk ($\delta$-ORRW) on connected graph is a self-interacting random walk which moves to its neighbors at each step according to the weights of the edges at that time, where the weights are $1$ on edges…
Recently Beaton, de Gier and Guttmann proved a conjecture of Batchelor and Yung that the critical fugacity of self-avoiding walks interacting with (alternate) sites on the surface of the honeycomb lattice is $1+\sqrt{2}$. A key identity…
Single linear polymer chains in dilute solutions under good solvent conditions are studied by Monte Carlo simulations with the pruned-enriched Rosenbluth method up to the chain length $N \sim {\cal O}(10^4)$. Based on the standard simple…
We consider random paths on a square lattice which take a left or a right turn at every vertex. The possible turns are taken with equal probability, except at a vertex which has been visited before. In such case the vertex is left via the…
Lattice model of directed self avoiding walk has been solved analytically to investigate adsorption desorption phase transition behaviour of a semiflexible sequential copolymer chain on a two dimensional impenetrable surface perpendicular…
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…
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…
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…
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 analysis of the generating functions…