An upper bound on the number of self-avoiding polygons via joining
From MaRDI portal
Publication:1747750
DOI10.1214/17-AOP1182zbMath1434.60294arXiv1808.09032OpenAlexW2790591176MaRDI QIDQ1747750
Publication date: 27 April 2018
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.09032
Geometric probability and stochastic geometry (60D05) Interacting random processes; statistical mechanics type models; percolation theory (60K35)
Related Items (5)
On self-avoiding polygons and walks: the snake method via polygon joining ⋮ On self-avoiding polygons and walks: The snake method via pattern fluctuation ⋮ Bounding the number of self-avoiding walks: Hammersley-Welsh with polygon insertion ⋮ Self-attracting self-avoiding walk ⋮ On the existence of critical exponents for self-avoiding walks
Cites Work
- On the probability that self-avoiding walk ends at a given point
- Critical behavior of two-dimensional spin models and charge asymmetry in the Coulomb gas
- Self-avoiding walk in five or more dimensions. I: The critical behaviour
- A rigorous bound on the critical exponent for the number of lattice trees, animals, and polygons.
- Logarithmic correction for the susceptibility of the 4-dimensional weakly self-avoiding walk: a renormalisation group analysis
- A renormalisation group method. I. Gaussian integration and normed algebras
- A renormalisation group method. II. Approximation by local polynomials
- A renormalisation group method. III. Perturbative analysis
- A renormalisation group method. IV. Stability analysis
- A renormalisation group method. V. A single renormalisation group step
- On self-avoiding polygons and walks: the snake method via polygon joining
- Exactly Solved Models
- THE LACE EXPANSION FOR SELF-AVOIDING WALK IN FIVE OR MORE DIMENSIONS
- On self-avoiding polygons and walks: The snake method via pattern fluctuation
- Lectures on Self-Avoiding Walks
- On the Number of Self-Avoiding Walks
- An inequality related to the isoperimetric inequality
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An upper bound on the number of self-avoiding polygons via joining
