Related papers: Self-avoiding walks and polygons -- an overview
We study the connective constants of weighted self-avoiding walks (SAWs) on infinite graphs and groups. The main focus is upon weighted SAWs on finitely generated, virtually indicable groups. Such groups possess so-called 'height…
We analyze the solution of the coined quantum walk on a line. First, we derive the full solution, for arbitrary unitary transformations, by using a new approach based on the four "walk fields" which we show determine the dynamics. The…
These lecture notes provide a rapid introduction to a number of rigorous results on self-avoiding walks, with emphasis on the critical behaviour. Following an introductory overview of the central problems, an account is given of the…
We consider nearest neighbour spatial random permutations on $\mathbb{Z}^d$. In this case, the energy of the system is proportional the sum of all cycle lengths, and the system can be interpreted as an ensemble of edge-weighted, mutually…
Modeling of polymer chains has received a lot of attention in mathematics. In fact, probabilistic models that naturally arise in statistical mechanics have been widely studied by mathematicians for the very challenging and novel problems…
Prudent walks are special self-avoiding walks that never take a step towards an already occupied site, and \emph{$k$-sided prudent walks} (with $k=1,2,3,4$) are, in essence, only allowed to grow along $k$ directions. Prudent polygons are…
We present an algorithm, based on the iteration of conformal maps, that produces independent samples of self-avoiding paths in the plane. It is a discrete process approximating radial Schramm-Loewner evolution growing to infinity. We focus…
We consider the model of self-avoiding walks on the $d$-dimensional hypercubic lattice interacting with a $d^*$-dimensional defect, where $1\leq d^*<d$. Such an interaction can be attractive or repulsive, and is controlled by a Boltzmann…
We use a one-dimensional random walk on $D$-dimensional hyper-spheres to determine the critical behavior of statistical systems in hyper-spherical geometries. First, we demonstrate the properties of such walk by studying the phase diagram…
There have been extensive studies of a random walk among a field of immobile traps (or obstacles), where one is interested in the probability of survival as well as the law of the random walk conditioned on its survival up to time $t$. In…
Over the years, problems like percolation and self-avoiding walks have provided important testing grounds for our understanding of the nature of the critical state. I describe some very recent ideas, as well as some older ones, which cast…
We consider self-avoiding walk on finite graphs with large girth. We study a few aspects of the model originally considered by Lawler, Schramm and Werner on finite balls in Z^d. The expected length of a random self avoiding path is…
Simulations of the self-avoiding walk (SAW) are performed in a half-plane and a cut-plane (the complex plane with the positive real axis removed) using the pivot algorithm. We test the conjecture of Lawler, Schramm and Werner that the…
Polymer chains undergoing a continuous adsorption-desorption transition are studied through extensive computer simulations. A three-dimensional self-avoiding walk lattice model of a polymer chain grafted onto a surface has been treated for…
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…
Quantum walks are expected to provide useful algorithmic tools for quantum computation. This paper introduces absorbing probability and time of quantum walks and gives both numerical simulation results and theoretical analyses on Hadamard…
Self-avoiding walks and self-avoiding trails, two models of a polymer coil in dilute solution, have been shown to be governed by the same universality class. On the other hand, self-avoiding walks interacting via nearest-neighbour contacts…
We numerically test the correspondence between the scaling limit of self-avoiding walks (SAW) in the plane and Schramm-Loewner evolution (SLE) with k=8/3. We introduce a discrete-time process approximating SLE in the exterior of the unit…
We obtain expected number of arrivals, absorption probabilities and expected time until absorption for an asymmetric discrete random walk on a graph in the presence of multiple function barriers. On each edge of the graph and in each vertex…
Using exact enumerations of self-avoiding walks (SAWs) we compute the inhomogeneous pressure exerted by a two-dimensional end-grafted polymer on the grafting line which limits a semi-infinite square lattice. The results for SAWs show that…