Weakly directed self-avoiding walks
From MaRDI portal
Publication:640847
DOI10.1016/j.jcta.2011.06.001zbMath1230.82027arXiv1010.3200OpenAlexW2003153172MaRDI QIDQ640847
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
Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Related Items
On the Importance Sampling of Self-Avoiding Walks ⋮ Unnamed Item ⋮ Analytic combinatorics of lattice paths with forbidden patterns, the vectorial kernel method, and generating functions for pushdown automata
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\)
- A noncommutative version of the matrix inversion formula
- Prudent self-avoiding walks
- Families of prudent self-avoiding walks
- Generating functions for generating trees
- Linear recurrences with constant coefficients: The multivariate case
- A faster implementation of the pivot algorithm for self-avoiding walks
- Square lattice
- The kernel method: a collection of examples
- Renormalisation group analysis of weakly self-avoiding walk in dimensions four and higher
- Random self-avoiding walks on one-dimensional lattices
- Culminating paths
- Canonical Monte Carlo determination of the connective constant of self-avoiding walks
- Improved lower bounds on the connective constants for two-dimensional self-avoiding walks
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- Self-avoiding polygons on the square lattice
- On the Number of Self-Avoiding Walks
- FURTHER RESULTS ON THE RATE OF CONVERGENCE TO THE CONNECTIVE CONSTANT OF THE HYPERCUBICAL LATTICE
