Related papers: Self-avoiding walk on nonunimodular transitive gra…

We find the generating function of self-avoiding walks and trails on a semi-regular lattice called the $3.12^2$ lattice in terms of the generating functions of simple graphs, such as self-avoiding walks, polygons and tadpole graphs on the…

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…

Turn the set of permutations of $n$ objects into a graph $G_n$ by connecting two permutations that differ by one transposition, and let $\sigma_t$ be the simple random walk on this graph. In a previous paper, Berestycki and Durrett [In…

We study the correction-to-scaling exponents for the two-dimensional self-avoiding walk, using a combination of series-extrapolation and Monte Carlo methods. We enumerate all self-avoiding walks up to 59 steps on the square lattice, and up…

Quantum walks exhibit many unique characteristics compared to classical random walks. In the classical setting, self-avoiding random walks have been studied as a variation on the usual classical random walk. Classical self-avoiding random…

Motivated by recent claims of a proof that the length scale exponent for the end-to-end distance scaling of self-avoiding walks is precisely $7/12=0.5833...$, we present results of large-scale simulations of self-avoiding walks and…

For d at least two and integer n, let c_n = c_n(d) denote the number of length n self-avoiding walks beginning at the origin in the integer lattice Z^d, and, for even n, let p_n = p_n(d) denote the number of length n self-avoiding polygons…

We describe some ideas of John Hammersley for proving the existence of critical exponents for two-dimensional self-avoiding walks and provide numerical evidence for their correctness.

Let $G$ be an infinite, locally finite graph. We investigate the relation between supercritical, transient branching random walk and the Martin boundary of its underlying random walk. We show results regarding the typical asymptotic…

In a recent paper by Beaton et al, it was proved that a model of self-avoiding walks on the honeycomb lattice, interacting with an impenetrable surface, undergoes an adsorption phase transition when the surface fugacity is $1+\sqrt{2}$.…

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…

An important conjecture in percolation theory is that almost surely no infinite cluster exists in critical percolation on any transitive graph for which the critical probability is less than 1. Earlier work has established this for the…

We reduce the problem of counting self-avoiding walks in the square lattice to a problem of counting the number of integral points in multidimensional domains. We obtain an asymptotic estimate of the number of self-avoiding walks of length…

The statistics of self-avoiding random walks have been used to model polymer physics for decades. A self-avoiding walk that grows one step at a time on a lattice will eventually trap itself, which occurs after an average of 71 steps on a…

We study biased random walk on subcritical and supercritical Galton-Watson trees conditioned to survive in the transient, sub-ballistic regime. By considering offspring laws with infinite variance, we extend previously known results for the…

We consider a self-avoiding walk model of polymer adsorption where the adsorbed polymer can be desorbed by the application of a force, concentrating on the case of the square lattice. Using series analysis methods we investigate the…

Various subsets of self-avoiding walks naturally appear when investigating existing methods designed to predict the 3D conformation of a protein of interest. Two such subsets, namely the folded and the unfoldable self-avoiding walks, are…

We provide an introductory account of a tricritical phase diagram, in the setting of a mean-field random walk model of a polymer density transition, and clarify the nature of the density transition in this context. We consider a…

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…

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,…