Directed percolation and generalized friendly random walkers
Physical Review Letters 82:11 (1999) 2232-2235
Abstract:
We show that the problem of directed percolation on an arbitrary lattice is equivalent to the problem of m directed random walkers with rather general attractive interactions, when suitably continued to m=0. In 1+1 dimensions, this is dual to a model of interacting steps on a vicinal surface. A similar correspondence with interacting self-avoiding walks is constructed for isotropic percolation. © 1999 The American Physical Society.Critical exponents near a random fractal boundary
JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL 32:16 (1999) L177-L182
Quenched randomness at first-order transitions
PHYSICA A 263:1-4 (1999) 215-221
On the non-universality of a critical exponent for self-avoiding walks
Nuclear Physics B 528:3 (1998) 533-552
Abstract:
We have extended the enumeration of self-avoiding walks on the Manhattan lattice from 28 to 53 steps and for self-avoiding polygons from 48 to 84 steps. Analysis of this data suggests that the walk generating function exponent γ = 1.3385 ± 0.003, which is different from the corresponding exponent on the square, triangular and honeycomb lattices. This provides numerical support for an argument recently advanced by Cardy, to the effect that excluding walks with parallel nearest-neighbour steps should cause a change in the exponent γ. The lattice topology of the Manhattan lattice precludes such parallel steps. © 1998 Elsevier Science B.V.Universal amplitude ratios in the two-dimensional q-state Potts model and percolation from quantum field theory
Nuclear Physics B 519:3 (1998) 551-578