Related papers: Connective constant for a weighted self-avoiding w…
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,…
A linear polymer grafted to a hard wall and underneath an AFM tip can be modelled in a lattice as a grafted lattice polymer (or self-avoiding walk) compressed underneath a piston approaching the wall. As the piston approaches the wall the…
We use the recently conjectured exact $S$-matrix of the massive ${\rm O}(n)$ model to derive its form factors and ground state energy. This information is then used in the limit $n\to0$ to obtain quantitative results for various universal…
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…
Let $\mu$ be the self-avoiding walk connective constant on $\ZZ^d$. We show that the asymptotic expansion for $\beta_c=1/\mu$ in powers of $1/(2d)$ satisfies Borel type bounds. This supports the conjecture that the expansion is Borel…
This paper is a sequel to Chaika and Krishnan [arXiv:1612.00434]. We again consider translation invariant measures on families of nearest-neighbor semi-infinite walks on the integer lattice Z^d. We assume that once walks meet, they…
We present a high-statistics Monte Carlo determination of the exponent gamma for self-avoiding walks on a Manhattan lattice in two dimensions. A conservative estimate is $\gamma \gtapprox 1.3425(3)$, in agreement with the universal value…
A previous paper (hep-lat/9311011) proposed a new kind of random walk on a spherically-symmetric lattice in arbitrary noninteger dimension $D$. Such a lattice avoids the problems associated with a hypercubic lattice in noninteger dimension.…
We consider a long-range version of self-avoiding walk in dimension $d > 2(\alpha \wedge 2)$, where $d$ denotes dimension and $\alpha$ the power-law decay exponent of the coupling function. Under appropriate scaling we prove convergence to…
We consider self-avoiding walk on a tree with random conductances. It is proven that in the weak disorder regime, the quenched critical point is equal to the annealed one, and that in the strong disorder regime, these critical points are…
We introduce a self-avoiding walk model for which end-effects are completely eliminated. We enumerate the number of these walks for various lattices in dimensions two and three, and use these enumerations to study the properties of this…
The connective constant of a graph is the exponential growth rate of the number of self-avoiding walks starting at a given vertex. Strict inequalities are proved for connective constants of vertex-transitive graphs. Firstly, the connective…
We consider random walk and self-avoiding walk whose 1-step distribution is given by $D$, and oriented percolation whose bond-occupation probability is proportional to $D$. Suppose that $D(x)$ decays as $|x|^{-d-\alpha}$ with $\alpha>0$.…
The smart kinetic self-avoiding walk (SKSAW) is a random walk which never intersects itself and grows forever when run in the full-plane. At each time step the walk chooses the next step uniformly from among the allowable nearest neighbors…
We consider the two-dimensional self-avoiding walk (SAW) in a simply connected domain that contains the origin. The SAW starts at the origin and ends somewhere on the boundary. The distribution of the endpoint along the boundary is expected…
In probability theory, reinforced walks are random walks on a lattice (or more generally a graph) that preferentially revisit neighboring `locations' (sites or bonds) that have been visited before. In this paper, we consider walks with…
We prove that the susceptibility of the continuous-time weakly self-avoiding walk on $\mathbb{Z}^d$, in the critical dimension $d=4$, has a logarithmic correction to mean-field scaling behaviour as the critical point is approached, with…
The nearest neighbor contacts between the two halves of an N-site lattice self-avoiding walk offer an unusual example of scaling random geometry: for N going to infinity they are strictly finite in number but their radius of gyration Rc is…
A recently developed model of random walks on a $D$-dimensional hyperspherical lattice, where $D$ is {\sl not} restricted to integer values, is extended to include the possibility of creating and annihilating random walkers. Steady-state…
We extract an effective strong coupling constant using low-Q^2 data and sum rules. Its behavior is established over the full Q^2-range and is compared to calculations based on lattice QCD, Schwinger-Dyson equations and a quark model.…