Self-Avoiding Walks on Hyperbolic Graphs

DOI10.1017/S0963548305006772MaRDI QIDQ5696362zbMATH OpenOpenAlexFDO

Authors 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 polygonself-avoiding walk

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 201032
• Counting self-avoiding walks on free products of graphs
• On the Number of Self-Avoiding Walks on Hyperbolic Lattices
• scientific article; zbMATH DE number 6456216
• Positive speed self-avoiding walks on graphs with more than one end

Cited in

(27)

• The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.
• Algebraic bounds for heterogeneous site percolation on directed and undirected graphs
• Hyperbolic self avoiding walk
• Self-avoiding walk on nonunimodular transitive graphs
• Entropy-driven phase transition in low-temperature antiferromagnetic Potts models
• Counting walks by their last erased self-avoiding polygons using sieves
• Directed random walk on the lattices of genus two
• Self-avoiding walks and connective constants
• Critical behavior in spherical and hyperbolic spaces
• On the Number of Self-Avoiding Walks on Hyperbolic Lattices
• Self-avoiding walk is sub-ballistic
• Self-avoiding walks and polygons on non-Euclidean lattices
• Self-avoiding walks and polygons on quasiperiodic tilings
• The Language of Self-Avoiding Walks
• A lower bound for the end-to-end distance of self-avoiding walk
• Greedy Random Walk
• Self-avoiding walks on finite graphs of large girth
• Self‐avoiding walk on the hypercube
• Self-avoiding walks of specified lengths on rectangular grid graphs
• Self-avoiding walks and polygons on hyperbolic graphs
• Self-avoiding walks and their languages
• 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
• Counting self-avoiding walks on free products of graphs
• Positive speed self-avoiding walks on graphs with more than one end
• Quenched averages for self-avoiding walks and polygons on deterministic fractals

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

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