Positive speed self-avoiding walks on graphs with more than one end
From MaRDI portal
Publication:778695
DOI10.1016/j.jcta.2020.105257zbMath1442.05111arXiv1612.02464OpenAlexW3023028943MaRDI QIDQ778695
Publication date: 3 July 2020
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.02464
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Self-avoiding walk is sub-ballistic
- Self-avoiding walks and the Fisher transformation
- The connective constant of the honeycomb lattice equals \(\sqrt{2+\sqrt 2}\)
- Bounds on connective constants of regular graphs
- Spectral radius of finite and infinite planar graphs and of graphs of bounded genus
- Counting self-avoiding walks on free products of graphs
- Non-amenable Cayley graphs of high girth have \(p_c < p_u\) and mean-field exponents
- Self-avoiding walk in 5 or more dimensions
- Isoperimetric inequalities, growth, and the spectrum of graphs
- Self-avoiding walk in five or more dimensions. I: The critical behaviour
- Percolation beyond \(\mathbb{Z}^ d\), many questions and a few answers
- Self-avoiding walks and amenability
- Locality of connective constants
- Cubic graphs and the golden mean
- On torsion-free groups with infinitely many ends
- Strict Inequalities for Connective Constants of Transitive Graphs
- Self-Avoiding Walks and Connective Constants
- Stretched polygons in a lattice tube
- On non-uniqueness of percolation on nonamenable Cayley graphs
- Connective constants and height functions for Cayley graphs
- Lectures on Self-Avoiding Walks
- Self-Avoiding Walks on Hyperbolic Graphs
- On the Number of Self-Avoiding Walks
This page was built for publication: Positive speed self-avoiding walks on graphs with more than one end
