Self-Avoiding Walks on Hyperbolic Graphs

DOI10.1017/S0963548305006772zbMath1139.82026OpenAlexW2004887104MaRDI QIDQ5696362

Neal Madras, C. Chris Wu

Publication date: 18 October 2005

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548305006772

zbMATH Keywords

critical exponentself-avoiding walkself-avoiding polygon

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Combinatorial probability (60C05) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (2) dimensions (aspects of discrete geometry) (52C20) Dynamic critical phenomena in statistical mechanics (82C27)

Related Items (12)

Self-avoiding walk is sub-ballistic ⋮ Self‐avoiding walk on the hypercube ⋮ Self-avoiding walks of specified lengths on rectangular grid graphs ⋮ Self-Avoiding Walks and Connective Constants ⋮ Critical behavior in spherical and hyperbolic spaces ⋮ Greedy Random Walk ⋮ Self-avoiding walk on nonunimodular transitive graphs ⋮ Algebraic bounds for heterogeneous site percolation on directed and undirected graphs ⋮ Entropy-driven phase transition in low-temperature antiferromagnetic Potts models ⋮ Counting self-avoiding walks on free products of graphs ⋮ Hyperbolic self avoiding walk ⋮ Positive speed self-avoiding walks on graphs with more than one end

This page was built for publication: Self-Avoiding Walks on Hyperbolic Graphs