Related papers: Universal Amplitude Combinations for Self-Avoiding…
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 consider branching random walks on the Euclidean lattice in dimensions five and higher. In this non-Markovian setting, we first obtain a relationship between the equilibrium measure and Green's function, in the form of an approximate…
We study quenched distributions on random walks in a random potential on integer lattices of arbitrary dimension and with an arbitrary finite set of admissible steps. The potential can be unbounded and can depend on a few steps of the walk.…
We prove some theorems about self-avoiding walks attached to an impenetrable surface (i.e. positive walks) and subject to a force. Specifically we show the force dependence of the free energy is identical when the force is applied at 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…
A prototypical problem on which techniques for exact enumeration are tested and compared is the enumeration of self-avoiding walks. Here, we show an advance in the methodology of enumeration, making the process thousands or millions of…
We consider self-avoiding walks terminally attached to a surface at which they can adsorb. A force is applied, normal to the surface, to desorb the walk and we investigate how the behaviour depends on the vertex of the walk at which the…
Models of random walks are considered in which walkers are born at one location and die at all other locations with uniform death rate. Steady-state distributions of random walkers exhibit dimensionally dependent critical behavior as a…
We present general algorithms (fully implemented in Maple) for calculations of various quantities related to constrained directed walks for a general set of steps on the square lattice in two dimensions. As a special case, we rederive…
Consider a point process in Euclidean space obtained by perturbing the integer lattice with independent and identically distributed random vectors. Under mild assumptions on the law of the perturbations, we construct a translation-invariant…
Self-avoiding walks on the body-centered-cubic (BCC) and face-centered-cubic (FCC) lattices are enumerated up to lengths 28 and 24, respectively, using the length-doubling method. Analysis of the enumeration results yields values for the…
We study various self-avoiding walks (SAWs) which are constrained to lie in the upper half-plane and are subjected to a compressive force. This force is applied to the vertex or vertices of the walk located at the maximum distance above the…
The study of random walks has increasingly been popular across diverse disciplines such as statistics, mathematics, quantum physics, where they are used to model paths consisting of successive random steps in a mathematical space. A…
We investigate polymers pulled away from an interacting surface, where the force is applied to the untethered endpoint and at an angle $\theta$ to the surface. We use the canonical self-avoiding walk model of polymers and obtain the phase…
We consider the proportion of generalized visible lattice points in the plane visited by random walkers. Our work concerns the visible lattice points in random walks in three aspects: (1) generalized visibility along curves; (2) one random…
Consider non-negative lattice paths ending at their maximum height, which will be called admissible paths. We show that the probability for a lattice path to be admissible is related to the Chebyshev polynomials of the first or second kind,…
We introduce a new class of models for polymer collapse, given by random walks on regular lattices which are weighted according to multiple site visits. A Boltzmann weight $\omega_l$ is assigned to each $(l+1)$-fold visited lattice site,…
We establish the existence of generalized Busemann functions and Gibbs-Dobrushin-Landford-Ruelle measures for a general class of lattice random walks in random potential with finitely many admissible steps. This class encompasses directed…
Using a connection between the $q$-oscillator algebra and the coefficients of the high temperature expansion of the frustrated Gaussian spin model, we derive an exact formula for the number of closed random walks of given length and area,…
The model of self-avoiding lattice walks and the asymptotic analysis of power-series have been two of the major research themes of Tony Guttmann. In this paper we bring the two together and perform a new analysis of the generating functions…