On the Number of Self-Avoiding Walks
From MaRDI portal
Publication:5734793
DOI10.1063/1.1704022zbMath0122.36502OpenAlexW2058301955MaRDI QIDQ5734793
Publication date: 1963
Published in: Journal of Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1063/1.1704022
Related Items
On the probability that self-avoiding walk ends at a given point ⋮ On the number of hexagonal polyominoes ⋮ LINKING OF RANDOM p-SPHERES IN Zd ⋮ GENERALIZED ATMOSPHERIC SAMPLING OF KNOTTED POLYGONS ⋮ The number of smallest knots on the cubic lattice ⋮ Statistical topology and knotting of fluctuating filaments ⋮ Monotonicity of the number of self-avoiding walks ⋮ Entanglement complexity of graphs in Z3 ⋮ Current trends in asymptotics: Some problems and some solutions ⋮ Upper Bounds for the Connective Constant of Self-Avoiding Walks ⋮ A METHOD FOR COMPUTING FAMILIES OF DISCRETE KNOTS USING KNOT NUMBERS ⋮ Models of random knots ⋮ End patterns of self-avoiding walks ⋮ Self-avoiding walk is sub-ballistic ⋮ Partially directed paths in a wedge ⋮ The escape transition in a self-avoiding walk model of linear polymers ⋮ Lattice stick number of knots ⋮ Location of the adsorption transition for lattice polymers ⋮ An introduction to infinite particle systems ⋮ The self-avoiding walk spanning a strip ⋮ Weakly directed self-avoiding walks ⋮ The distribution of first hitting times of randomwalks on Erdős–Rényi networks ⋮ The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk. ⋮ Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints. ⋮ The critical fugacity for surface adsorption of self-avoiding walks on the honeycomb lattice is \(1+\sqrt{2}\) ⋮ Shifted critical threshold in the loop \(O(n)\) model at arbitrarily small \(n\) ⋮ Self-avoiding walks and polymer adsorption: low temperature behaviour ⋮ A random walk with Stu Whittington ⋮ Self-Avoiding Walks and Connective Constants ⋮ Transforming fixed-length self-avoiding walks into radial \(\text{SLE}_{8/3}\) ⋮ An upper bound on the number of self-avoiding polygons via joining ⋮ KNOTS, SLIPKNOTS, AND EPHEMERAL KNOTS IN RANDOM WALKS AND EQUILATERAL POLYGONS ⋮ Pattern theorems, ratio limit theorems and Gumbel maximal clusters for random fields ⋮ Large Deviations and Ratio Limit Theorems for Pattern-Avoiding Permutations ⋮ Self-avoiding walk in five or more dimensions. I: The critical behaviour ⋮ Polymers with spatial or topological constraints: theoretical and computational results ⋮ Self-avoiding walk on \(\mathbb{Z}^2\) with Yang-Baxter weights: universality of critical fugacity and 2-point function ⋮ Bridge decomposition of restriction measures ⋮ Statistical topology of closed curves: Some applications in polymer physics ⋮ Phase Coexistence for the Hard-Core Model on ℤ2 ⋮ On self-avoiding polygons and walks: The snake method via pattern fluctuation ⋮ ALMOST UNKNOTTED EMBEDDINGS OF GRAPHS IN Z3 AND HIGHER DIMENSIONAL ANALOGUES ⋮ Thoughts on lattice knot statistics ⋮ Knots in random walks ⋮ History and Introduction to Polygon Models and Polyominoes ⋮ Lattice Polygons and Related Objects ⋮ Polygons and the Lace Expansion ⋮ Monte Carlo Methods for Lattice Polygons ⋮ Lower bound for the connective constant of a self-avoiding walk on a square lattice ⋮ Entanglement complexity of lattice ribbons ⋮ Mean unknotting times of random knots and embeddings ⋮ Positive speed self-avoiding walks on graphs with more than one end ⋮ Bounding the number of self-avoiding walks: Hammersley-Welsh with polygon insertion ⋮ Adsorption of lattice polymers with quenched topologies ⋮ A pattern theorem for lattice clusters ⋮ On the existence of critical exponents for self-avoiding walks ⋮ Asymptotic laws for random knot diagrams ⋮ Supermultiplicative relations in models of interacting self-avoiding walks and polygons ⋮ Self-avoiding walks ⋮ On the Number of Self-Avoiding Walks. II
Cites Work
This page was built for publication: On the Number of Self-Avoiding Walks
