Self-avoiding walks and trees in spread-out lattices
From MaRDI portal
Publication:1906397
DOI10.1007/BF02186829zbMATH Open0838.60064MaRDI QIDQ1906397FDOQ1906397
Authors: Mathew D. Penrose 
Publication date: 19 March 1996
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 5159453
- The lace expansion on a tree with application to networks of self-avoiding walks
- Self-avoiding walks, neighbour-avoiding walks and trails on semiregular lattices
- scientific article; zbMATH DE number 4103108
- Self-avoiding walks on finite graphs of large girth
- Self-avoiding walks on lattice strips
- Random walk on the self-avoiding tree
- Self-avoiding walks and polygons on non-Euclidean lattices
- Random self-avoiding walks on one-dimensional lattices
Sums of independent random variables; random walks (60G50) Statistical mechanics of polymers (82D60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Self-avoiding walk in five or more dimensions. I: The critical behaviour
- Title not available (Why is that?)
- Title not available (Why is that?)
- Percolation Processes: Lower Bounds for the Critical Probability
- Rigorous Treatment of the Van Der Waals-Maxwell Theory of the Liquid-Vapor Transition
- Title not available (Why is that?)
- Cell Growth Problems
- On the Number of Self-Avoiding Walks. II
- The Self-Avoiding-Walk and Percolation Critical Points in High Dimensions
- THE LACE EXPANSION FOR SELF-AVOIDING WALK IN FIVE OR MORE DIMENSIONS
- On the spread-out limit for bond and continuum percolation
- On the upper critical dimension of lattice trees and lattice animals
- Title not available (Why is that?)
Cited In (10)
- Self-avoiding walks and polygons on hyperbolic graphs
- A spectral independence view on hard spheres via block dynamics
- On anisotropic spiral self-avoiding walks
- Multi-level pinning problems for random walks and self-avoiding lattice paths
- Title not available (Why is that?)
- Critical two-point functions and the lace expansion for spread-out high-dimensional percolation and related models.
- Spread-out limit of the critical points for lattice trees and lattice animals in dimensions \(\boldsymbol{d}\boldsymbol> \textbf{8} \)
- Self-avoiding walks and trails on the 3.122 lattice
- Algorithms for hard-constraint point processes via discretization
- Equilibration time scales in closed many-body quantum systems
This page was built for publication: Self-avoiding walks and trees in spread-out lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1906397)
