✦ LIBER ✦

Lower bound for the connective constant of a self-avoiding walk on a square lattice

✍ Scribed by W.A Beyer; M.B Wells

Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 311 KB
Volume: 13
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(72)90024-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Renormalization of the self-avoiding wal

Renormalization of the self-avoiding walk on a lattice

✍ H.J. Hilhorst 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 158 KB

A new lower bound for the critical proba

A new lower bound for the critical probability of site percolation on the square lattice

✍ J. van den Berg; A. Ermakov 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 705 KB

The critical probability for site percolation on the square lattice is not known exactly. Several authors have given rigorous upper and lower bounds. Some recent lower bounds are (each displayed here with the first three digits) 0.503 (Toth [13]), 0.522 (Zuev [15]), and the best lower bound so far,

Computer simulation study of the statist

Computer simulation study of the statistics of self-avoiding-walks on a dilute lattice

✍ B.K. Chakrabarti; K. Bhadra; A.K. Roy; S.N. Karmakar 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 170 KB