Related papers: Statistics of self-avoiding walks on randomly dilu…
We study a lattice model of a magnetic polymer where the XY spin variables are located on a self-avoiding walk (SAW) on a regular lattice in two and three dimensions. We consider the regime where both spins and conformations are dynamic,…
We recently published [J. Phys A: Math. Theor. {\bf 45} 115202 (2012)] a new and more efficient implementation of a transfer-matrix algorithm for exact enumerations of self-avoiding polygons. Here we extend this work to the enumeration of…
We enumerate self-avoiding walks and polygons, counted by perimeter, on the quasiperiodic rhombic Penrose and Ammann-Beenker tilings, thereby considerably extending previous results. In contrast to similar problems on regular lattices,…
This article employs Schramm-Loewner Evolution to obtain intersection exponents for several chordal $SLE_{8/3}$ curves in a wedge. As $SLE_{8/3}$ is believed to describe the continuum limit of self-avoiding walks, these exponents correspond…
This work develops a methodical approach to counting of walks on cartesian products, biproducts, symmetric and exterior powers and bipowers, Schur operations, coverings and semicoverings of weighted graphs. For weight and root lattices of…
The scaling properties of self-avoiding walks on a d-dimensional diluted lattice at the percolation threshold are analyzed by a field-theoretical renormalization group approach. To this end we reconsider the model of Y. Meir and A. B.…
We introduce a self-avoiding walk model for which end-effects are completely eliminated. We enumerate the number of these walks for various lattices in dimensions two and three, and use these enumerations to study the properties of this…
We study a continuous time branching process where an individual splits into two daughters with rate b and dies with rate a, starting from a single individual at t=0. We show that the model can be mapped exactly to a random walk problem…
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…
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$ to that of terminally-attached…
The decay of directional correlations in self-avoiding random walks on the square lattice is investigated. Analysis of exact enumerations and Monte Carlo data suggest that the correlation between the directions of the first step and the…
We consider random self-avoiding walks between two points on the boundary of a finite subdomain of Z^d (the probability of a self-avoiding trajectory gamma is proportional to mu^{-length(gamma)}). We show that the random trajectory becomes…
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 study a discrete random walk on a one-dimensional finite lattice, where each state has different probabilities to move one step forward, backward, staying for a moment or being absorbed. We obtain expected number of arrivals and expected…
We consider a discrete random walk on a diagonal lattice in two and three dimensions and obtain explicit solutions of absorption probabilities and probabilities of return in several domains. In three dimensions we consider both the cube and…
The probability distribution of the number $s$ of distinct sites visited up to time $t$ by a random walk on the fully-connected lattice with $N$ sites is first obtained by solving the eigenvalue problem associated with the discrete master…
We consider a class of self-interacting random walks in deterministic or random environments, known as excited random walks or cookie walks, on the d-dimensional integer lattice. The main purpose of this paper is two-fold: to give a survey…
We define a random walk problem which admits analytic results, on a class of infinite periodic lattices which are directed and colored. Our approach is motivated from the fact that such lattices arise in string theoretic constructs of…
We introduce classes of restricted walks, surfaces and their generalisations. For example, self-osculating walks (SOWs) are supersets of self-avoiding walks (SAWs) where edges are still not allowed to cross but may 'kiss' at a vertex. They…
We investigate semi-stiff interacting self-avoiding walks on the square lattice with random impurities. The walks are simulated using the flatPERM algorithm and the inhomogeneity is realised as a random fraction of the lattice that is…