High-Dimensional Graphical Networks of Self-Avoiding Walks

DOI10.4153/CJM-2004-005-1MaRDI QIDQ4464251zbMATH OpenOpenAlexFDO

Authors A. A. Járai, Akira Sakai, Gordon Slade, Mark Holmes

Publication date 27 May 2004

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/cjm-2004-005-1

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Recommendations

• The lace expansion on a tree with application to networks of self-avoiding walks
• The Self-Avoiding-Walk and Percolation Critical Points in High Dimensions
• THE LACE EXPANSION FOR SELF-AVOIDING WALK IN FIVE OR MORE DIMENSIONS
• Self-avoiding walk in five or more dimensions. I: The critical behaviour
• Self-avoiding walks on finite graphs of large girth

Cited in

(6)

• The lace expansion on a tree with application to networks of self-avoiding walks
• A self-avoiding walk with attractive interactions
• The lace expansion and its application. École d'Été de Probabilités de Saint-Flour XXXIV -- 2004.
• Critical correlation functions for the 4-dimensional weakly self-avoiding walk and \(n\)-component \(|\varphi|^4\) model
• Complex network classification using partially self-avoiding deterministic walks
• Polygons and the lace expansion

This page was built for publication: High-Dimensional Graphical Networks of Self-Avoiding Walks

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