Related papers: Self-Attracting Walk on Lattices
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,…
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…
There have been separate studies of the polymer collapse transition, where the collapse was induced by two different types of attraction. In each case, the configurations of the polymer were given by the same subset of random walks being…
A celebrated result in probability theory is that a simple symmetric random walk on the $d$-dimensional lattice $\mathbb{Z}^d$ is recurrent for $d=1,2$ and transient for $d\geq 3$. In this note, we derive a closed-form expression, in terms…
Simple random walks on various types of partially horizontally oriented regular lattices are considered. The horizontal orientations of the lattices can be of various types (deterministic or random) and depending on the nature of the…
We consider a random walk on the first quadrant of the square lattice, whose increment law is, roughly speaking, homogeneous along a finite number of half-lines near each of the two boundaries, and hence essentially specified by…
We discuss possible sources of systematic errors in the computation of critical exponents by renormalization-group methods, extrapolations from exact enumerations and Monte Carlo simulations. A careful Monte Carlo determination of the…
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 study the asymptotic behaviour of a $d$-dimensional self-interacting random walk $X_n$ ($n = 1,2,...$) which is repelled or attracted by the centre of mass $G_n = n^{-1} \sum_{i=1}^n X_i$ of its previous trajectory. The walk's trajectory…
The number of free sites next to the end of a self-avoiding walk is known as the atmosphere. The average atmosphere can be related to the number of configurations. Here we study the distribution of atmospheres as a function of length and…
We address a long-standing debate regarding the finite-size scaling of the Ising model in high dimensions, by introducing a random-length random walk model, which we then study rigorously. We prove that this model exhibits the same…
Random walks with memory typically involve rules where a preference for either revisiting or avoiding those sites visited in the past are introduced somehow. Such effects have a direct consequence on the statistics of first-passage and…
Several kinds of walks on complex networks are currently used to analyze search and navigation in different systems. Many analytical and computational results are known for random walks on such networks. Self-avoiding walks (SAWs) are…
We study an annealed model of Uniform Infinite Planar Quadrangulation (UIPQ) with an infinite two-sided self-avoiding walk (SAW), which can also be described as the result of glueing together two independent uniform infinite…
We have calculated long series expansions for self-avoiding walks and polygons on the honeycomb lattice, including series for metric properties such as mean-squared radius of gyration as well as series for moments of the area-distribution…
Returning walks on a lattice are sequences of moves that start at a given lattice site and return to the same site after $n$ steps. Determining the total number of returning walks of a given length $n$ is a typical graph-theoretical problem…
The properties of the coinless quantum walk model have not been as thoroughly analyzed as those of the coined model. Both evolve in discrete time steps but the former uses a smaller Hilbert space, which is spanned merely by the site basis.…
We study a generalized interacting self-avoiding walk (ISAW) model with nearest- and next nearest-neighbor (NN and NNN) interactions on the square and cubic lattices. In both dimensions, the phase diagrams show coil and globule phases…
We study the scattering properties of a bi-inductive electrical lattice consisting of a one-dimensional array of coupled LC units. For an initially localized electrical excitation, and in the absence of any impurity, we compute in closed…
We investigate asymptotical behavior of numbers of long Hamiltonian walks (HWs), i.e. self-avoiding random walks that visit every site of a lattice, on various fractal lattices. By applying an exact recursive technique we obtain scaling…