Related papers: Lectures on Self-Avoiding Walks
We have developed an improved algorithm that allows us to enumerate the number of self-avoiding polygons on the square lattice to perimeter length 90. Analysis of the resulting series yields very accurate estimates of the connective…
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…
The statistics of a long closed self-avoiding walk (SAW) or polymer ring on a $ d $-dimensional lattice obeys hyperscaling. The combination $ p_N \left\langle R^2 \right\rangle^{ d/2}_N\mu^{ -N}, $ (where $ p_N $ is the number of…
The lecture delivered at the \emph{Current Developments in Mathematics} conference (Harvard-MIT, 2021) focused on the recent proof of the Gaussian structure of the scaling limits of the critical Ising and $\varphi^4$ fields in the marginal…
We present a new proof of $|x|^{-(d-2)}$ decay of critical two-point functions for spread-out statistical mechanical models on $\mathbb{Z}^d$ above the upper critical dimension, based on the lace expansion and assuming appropriate…
We give conditions on a real-valued function $F$ on $\mathbb{Z}^d$, for $d>2$, which ensure that the solution $G$ to the convolution equation $(F*G)(x) = \delta_{0,x}$ has Gaussian decay $|x|^{-(d-2)}$ for large $|x|$. Precursors of our…
A generalised model for interacting self-avoiding trails on the square lattice is presented and studied using numerical transfer matrix methods. The model differentiates between on-site double visits corresponding to collisions, and…
We make a high-precision Monte Carlo study of two- and three-dimensional self-avoiding walks (SAWs) of length up to 80000 steps, using the pivot algorithm and the Karp-Luby algorithm. We study the critical exponents $\nu$ and $2\Delta_4…
As a model of trapping by biased motion in random structure, we study the time taken for a biased random walk to return to the root of a subcritical Galton-Watson tree. We do so for trees in which these biases are randomly chosen,…
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 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…
Lattice walks are used to model various physical phenomena. In particular, walks within Weyl chambers connect directly to representation theory via the Littelmann path model. We derive asymptotics for centrally weighted lattice walks within…
Self-avoiding walks are a simple and well-known model of long, flexible polymers in a good solvent. Polymers being pulled away from a surface by an external agent can be modelled with self-avoiding walks in a half-space, with a Boltzmann…
In this work, the outward and inward accessibilities of individual nodes are defined and their potential for application is illustrated with respect to the investigation of 6 different types of networks. The outward accessibility quantifies…
In this paper, we study the abundance of self-avoiding paths of a given length on a supercritical percolation cluster on $\bbZ^d$. More precisely, we count $Z_N$ the number of self-avoiding paths of length $N$ on the infinite cluster,…
Despite its elementary definition, the self-avoiding walk (SAW) poses notoriously hard enumerative problems: exact connective constants are known for only a handful of infinite graphs, notably the honeycomb lattice \cite{ds}. We establish a…
Some time ago Salmhofer demonstrated the equivalence of the strong coupling lattice Schwinger model with Wilson fermions to a certain 8-vertex model which can be understood as a self-avoiding loop model on the square lattice with bending…
We study self-avoiding walks on the square lattice restricted to a square box of side $L$ weighted by a length fugacity without restriction of their end points. This models a confined polymer in dilute solution. The model admits a phase…
The Bordelaise philosophy, or rather a juvenile version of it, is used to enumerate self avoiding walks in a $[0,1] \times (- \infty, \infty)$.
We consider the enumeration of walks on the non-negative lattice $\mathbb{N}^d$, with steps defined by a set $\mathcal{S} \subset \{-1, 0, 1\}^d \setminus \{\mathbf{0}\}$. Previous work in this area has established asymptotics for the…