Related papers: Self-avoiding walks crossing a square
We consider spread-out models of the self-avoiding walk and its finite-memory version, known as the memory-$\tau$ walk, which prohibits loops whose length is at most $\tau$, in dimensions $d>4$. The critical point is defined as the radius…
In this paper we give a complete characterization of the scaling limit of the critical Interacting Partially Directed Self-Avoiding Walk (IPDSAW) introduced in Zwanzig and Lauritzen (1968). As the system size $L$ diverges, we prove that the…
We consider a one dimensional asymmetric random walk whose jumps are identical, independent and drawn from a distribution \phi(\eta) displaying asymmetric power law tails (i.e. \phi(\eta) \sim c/\eta^{\alpha +1} for large positive jumps and…
We study a number of combinatorial and algebraic structures arising from walks on the two-dimensional integer lattice. To a given step set $X\subseteq\mathbb Z^2$, there are two naturally associated monoids: $\mathscr F_X$, the monoid of…
We study the number $c_n^{(N)}$ of $n$-step self-avoiding walks on the $N$-dimensional hypercube, and identify an $N$-dependent \emph{connective constant} $\mu_N$ and amplitude $A_N$ such that $c_n^{(N)}$ is $O(\mu_N^n)$ for all $n$ and…
We present a Monte Carlo study of the fractal geometry of clusters formed by discrete-time simple random walks (sRW) of $L^2$ steps on a periodic square $L\times L$ lattice. We verify with high precision that the asymptotic behavior of the…
Recently Kauers, Koutschan and Spahn announced a significant increase in the length of the so-called {\em gerrymander sequence}, given as A348456 in the OEIS, extending the sequence from 3 terms to 7 terms. We give a further extension to 11…
We study branching random walks in random environment on the $d$-dimensional square lattice, $d \geq 1$. In this model, the environment has finite range dependence, and the population size cannot decrease. We prove limit theorems (laws of…
A recently developed model of random walks on a $D$-dimensional hyperspherical lattice, where $D$ is {\sl not} restricted to integer values, is used to study polymer growth near a $D$-dimensional attractive hyperspherical boundary. The…
We study analytically a simple random walk model on a one-dimensional lattice, where at each time step the walker resets to the maximum of the already visited positions (to the rightmost visited site) with a probability $r$, and with…
The dynamics of the avalanche width in the evolution model is described using a random walk picture. In this approach the critical exponents for avalanche distribution, $\tau$, and avalanche average time, $\gamma$, are found to be the same…
This work presents new asymptotic formulas for family of walks in Weyl chambers. The models studied here are defined by step sets which exhibit many symmetries and are restricted to the first orthant. The resulting formulas are very…
We study Hamiltonian walks (HWs) on the family of three--dimensional modified Sierpinski gasket fractals, as a model for compact polymers in nonhomogeneous media in three dimensions. Each member of this fractal family is labeled with an…
For $d \geq 2$ and $n \in \mathbb{N}$ even, let $p_n = p_n(d)$ denote the number of length $n$ self-avoiding polygons in $\mathbb{Z}^d$ up to translation. The polygon cardinality grows exponentially, and the growth rate $\lim_{n \in…
We investigate a functional equation which resembles the functional equation for the generating function of a lattice walk model for the quarter plane. The interesting feature of this equation is that its orbit sum is zero while its…
We have developed a parallel algorithm that allows us to enumerate the number of self-avoiding polygons on the square lattice to perimeter length 110. We have also extended the series for the first 10 area-weighted moments and the radius of…
We study the dynamics of random walks hopping on homogeneous hyper-cubic lattices and multiplying at a fertile site. In one and two dimensions, the total number $\mathcal{N}(t)$ of walkers grows exponentially at a Malthusian rate depending…
It has been recently suggested that a totally asymmetric exclusion process with two species on an open chain could exhibit spontaneous symmetry breaking in some range of the parameters defining its dynamics. The symmetry breaking is…
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 present a real space renormalization-group map for probabilities of random walks on a hierarchical lattice. From this, we study the asymptotic behavior of the end-to-end distance of a weakly self- avoiding random walk (SARW) that…