Related papers: Self-attracting self-avoiding walk
We review the existence of the infinite length self-avoiding walk in the half plane and its relationship to bridges. We prove that this probability measure is also given by the limit as $\beta \rightarrow \beta_c-$ of the probability…
We investigate a model of continuous-time simple random walk paths in $\mathbb{Z}^d$ undergoing two competing interactions: an attractive one towards the large values of a random potential, and a self-repellent one in the spirit of the…
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…
Recently, Duminil-Copin and Smirnov proved a long-standing conjecture by Nienhuis that the connective constant of self-avoiding walks on the honeycomb lattice is $\sqrt{2+\sqrt{2}}.$ A key identity used in that proof depends on the…
Self-avoiding walks (SAW) are the source of very difficult problems in probabilities and enumerative combinatorics. They are also of great interest as they are, for instance, the basis of protein structure prediction in bioinformatics.…
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 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 present an analytical and numerical study of the paths of self avoiding walks (SAWs) on random networks. Since these walks do not retrace their paths, they effectively delete the nodes they visit, together with their links, thus pruning…
Self-attracting walks (SATW) with attractive interaction u > 0 display a swelling-collapse transition at a critical u_{\mathrm{c}} for dimensions d >= 2, analogous to the \Theta transition of polymers. We are interested in the structure of…
A self-avoiding walk (SAW) on the square lattice is prudent if it never takes a step towards a vertex it has already visited. Prudent walks differ from most classes of SAW that have been counted so far in that they can wind around their…
We study via Monte Carlo simulation a generalisation of the so-called vertex interacting self-avoiding walk (VISAW) model on the square lattice. The configurations are actually not self-avoiding walks but rather restricted self-avoiding…
We present simulations of self-avoiding random walks on 2-d lattices with the topology of an infinitely long cylinder, in the limit where the cylinder circumference L is much smaller than the Flory radius. We study in particular the…
Although the title seems self-contradictory, it does not contain a misprint. The model we study is a seemingly minor modification of the "true self-avoiding walk" (TSAW) model of Amit, Parisi, and Peliti in two dimensions. The walks in it…
We show numerically that critical exponents for two-point interchain correlation of an infinite chain characterize those of finite chains in Self-Avoiding Walk (SAW) and Self-Avoiding Polygon (SAP) under a topological constraint. We…
If the three dimensional self-avoiding walk (SAW) is conformally invariant, then one can compute the hitting densities for the SAW in a half-space and in a sphere. The ensembles of SAW's used to define these hitting densities involve walks…
In this paper, we derive the distribution of a two-dimensional (complex) random walk in which the angle of each step is restricted to a subset of the circle. This setting appears in various domains, such as in over-the-air computation in…
Building on a work by Alm, we consider a model of weighted self-avoiding walks on a lattice and develop a method for computing upper bounds on the corresponding weighted connective constant, which we implement in a publicly available…
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…
It is widely believed that the scaling limit of self-avoiding walks (SAWs) at the critical temperature is (i) conformally invariant, and (ii) describable by Schramm-Loewner Evolution (SLE) with parameter $\kappa = 8/3.$ We consider SAWs in…
The self-avoiding walk, and lattice spin systems such as the $\varphi^4$ model, are models of interest both in mathematics and in physics. Many of their important mathematical problems remain unsolved, particularly those involving critical…