Weakly directed self-avoiding walks

DOI10.1016/J.JCTA.2011.06.001MaRDI QIDQ640847zbMATH OpenOpenAlexFDO

Authors Axel Bacher, Mireille Bousquet-Mélou

Publication date 21 October 2011

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1010.3200

zbMATH Keywords

enumerationnon-D-finite seriespartially directed bridgesrandom generationself-avoiding walks

Mathematics Subject Classification ID

Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

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.

Recommendations

• scientific article; zbMATH DE number 6806804
• Weakly prudent self-avoiding bridges
• scientific article; zbMATH DE number 201032
• Self-avoiding walks and polygons crossing a domain on the square and hexagonal lattices
• Families of prudent self-avoiding walks

Cites work

• A faster implementation of the pivot algorithm for self-avoiding walks
• A noncommutative version of the matrix inversion formula
• Analytic combinatorics
• Boltzmann Samplers for the Random Generation of Combinatorial Structures
• Canonical Monte Carlo determination of the connective constant of self-avoiding walks
• Culminating paths
• Families of prudent self-avoiding walks
• FURTHER RESULTS ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICE
• Generating functions for generating trees
• scientific article; zbMATH DE number 4002104 (Why is no real title available?)
• scientific article; zbMATH DE number 1033382 (Why is no real title available?)
• scientific article; zbMATH DE number 1498643 (Why is no real title available?)
• scientific article; zbMATH DE number 6806804 (Why is no real title available?)
• scientific article; zbMATH DE number 2154241 (Why is no real title available?)
• scientific article; zbMATH DE number 201032 (Why is no real title available?)
• Improved lower bounds on the connective constants for two-dimensional self-avoiding walks
• Linear recurrences with constant coefficients: The multivariate case
• On the Number of Self-Avoiding Walks
• Prudent self-avoiding walks
• Random self-avoiding walks on one-dimensional lattices
• Renormalisation group analysis of weakly self-avoiding walk in dimensions four and higher
• Self-avoiding polygons on the square lattice
• Square lattice
• The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\)
• The kernel method: a collection of examples

Cited in

(8)

• Random walk weakly attracted to a wall
• A class of weakly self-avoiding walks
• Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata
• Anisotropic self-avoiding walks.
• On the importance sampling of self-avoiding walks
• Weakly prudent self-avoiding bridges
• scientific article; zbMATH DE number 6806804 (Why is no real title available?)
• Analytic combinatorics of lattice paths with forbidden patterns: asymptotic aspects and Borges's theorem

Describes a project that uses

Uses Software

• MARKOV
• ANIMALS
• FreeANIMALS
• SAP
• FreeSAP
• SAW
• FreeSAW

This page was built for publication: Weakly directed self-avoiding walks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640847)