Self-avoiding walks and polygons on hyperbolic graphs

DOI10.1002/JGT.23087MaRDI QIDQ6322994zbMATH OpenOpenAlexFDO

Authors Christoforos Panagiotis

Publication date 31 July 2019

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/jgt.23087

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Planar graphs; geometric and topological aspects of graph theory (05C10) Random walks on graphs (05C81) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20)

Abstract: We prove that for the $d$-regular tessellations of the hyperbolic plane by $k$-gons, there are exponentially more self-avoiding walks of length $n$ than there are self-avoiding polygons of length $n$. We then prove that this property implies that the self-avoiding walk is ballistic, even on an arbitrary vertex-transitive graph. Moreover, for every fixed $k$, we show that the connective constant for self-avoiding walks satisfies the asymptotic expansion $d-1-O(1/d)$ as $doinfty$; on the other hand, the connective constant for self-avoiding polygons remains bounded. Finally, we show for all but two tessellations that the number of self-avoiding walks of length $n$ is comparable to the $n$th power of their connective constant. Some of these results were previously obtained by Madras and Wu cite{MaWuSAW} for all but finitely many regular tessellations of the hyperbolic plane.

Recommendations

• Self-Avoiding Walks on Hyperbolic Graphs
• On the Number of Self-Avoiding Walks on Hyperbolic Lattices
• Self-avoiding walk on nonunimodular transitive graphs
• Counting self-avoiding walks on free products of graphs
• Self-avoiding walks and trees in spread-out lattices

Cited in

(3)

• Self-avoiding walk is ballistic on graphs with more than one end
• Cone types and spectral radius of hyperbolic triangle groups and hyperbolic tessellations
• The Maker-Breaker percolation game on a random board

This page was built for publication: Self-avoiding walks and polygons on hyperbolic graphs

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