On Measures of Average Degree for Lattices

DOI10.1017/S0963548305007418MaRDI QIDQ5295397zbMATH OpenOpenAlexFDO

Authors Sven Erick Alm

Publication date 30 July 2007

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

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

zbMATH Keywords

Archimedian latticeLaves latticeMarkov chainpercolationrandom walk

Mathematics Subject Classification ID

Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Percolation (82B43)

Recommendations

• Upper and lower bounds for the connective constants of self-avoiding walks on the Archimedean and Laves lattices
• Self-avoiding walks, neighbour-avoiding walks and trails on semiregular lattices
• scientific article; zbMATH DE number 7703288
• scientific article; zbMATH DE number 201032
• A numerical adaptation of self-avoiding walk identities from the honeycomb to other 2D lattices

This page was built for publication: On Measures of Average Degree for Lattices

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