Title of article
Weakly directed self-avoiding walks
Author/Authors
Bacher، نويسنده , , Axel and Bousquet-Mélou، نويسنده , , Mireille، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
27
From page
2365
To page
2391
Abstract
We define a new family of self-avoiding walks (SAW) on the square lattice, called weakly directed walks. These walks have a simple characterization in terms of the irreducible bridges that compose them. We determine their generating function. This series has a complex singularity structure and in particular, is not D-finite. The growth constant is approximately 2.54 and is thus larger than that of all natural families of SAW enumerated so far (but smaller than that of general SAW, which is about 2.64). We also prove that the end-to-end distance of weakly directed walks grows linearly. Finally, we study a diagonal variant of this model.
Keywords
Enumeration , Partially directed bridges , Non-D-finite series , Random generation , Self-avoiding walks
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2011
Journal title
Journal of Combinatorial Theory Series A
Record number
1531706
Link To Document